Hoogeveen J.A.

J.A. Hoogeveen

Information about the author J.A. Hoogeveen will soon be added to the site.
Found 16 papers in total
Minimizing maximum promptness and maximum lateness on a single machine
Minimizing maximum promptness and maximum lateness on a single machine
1996
We consider the following single-machine bicriteria scheduling problem. A set of n...
Scheduling with target start times
Scheduling with target start times
2001
We address the single-machine problem of scheduling n independent jobs subject to...
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
2000
Scheduling problems in multipurpose batch process industries are very hard to solve...
Parallel machine scheduling by column generation
Parallel machine scheduling by column generation
1999
Parallel machine scheduling problems concern the scheduling of n jobs on m machines to...
Short shop schedules
Short shop schedules
1997
We consider the open shop, job shop, and flow shop scheduling problems with integral...
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
1996
We address the NP-hard single-machine problem of scheduling n independent jobs so as...
Earliness–tardiness scheduling around almost equal due dates
Earliness–tardiness scheduling around almost equal due dates
1997
The just-in-time concept in manufacturing has aroused interest in machine scheduling...
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
1996
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine...
A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
1996
The authors address the NP-hard single-machine problem of scheduling n independent...
Earliness-tardiness scheduling around almost equal due dates
Earliness-tardiness scheduling around almost equal due dates
1997
The just-in-time concept in manufacturing has aroused interest in machine scheduling...
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
1995
Lagrangian relaxation is a powerful bounding technique that has been applied...
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
1995
The authors prove that the bicriteria single-machine scheduling problem of minimizing...
Three, four, five, six, or the complexity of scheduling with communication delays
Three, four, five, six, or the complexity of scheduling with communication delays
1994
A set of unit-time tasks has to be processed on identical parallel processors subject...
New lower and upper bounds for scheduling around a small common due date
New lower and upper bounds for scheduling around a small common due date
1994
The authors consider the single-machine problem of scheduling n jobs to minimize the...
Scheduling around a small common due date
Scheduling around a small common due date
1991
A set of n jobs has to be scheduled on a single machine which can handle only one job...
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
1991
For the traveling salesman problem in which the distances satisfy the triangle...
Papers per page: