Velde S.L. van de

S.L. van de Velde

Information about the author S.L. van de Velde will soon be added to the site.
Found 13 papers in total
Scheduling with target start times
Scheduling with target start times
2001
We address the single-machine problem of scheduling n independent jobs subject to...
Positioning automated guided vehicles in a loop layout
Positioning automated guided vehicles in a loop layout
2000
We address the problem of determining the home positions for m automated guided...
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...
Single-machine scheduling with release dates, due dates and family setup times
Single-machine scheduling with release dates, due dates and family setup times
1996
We address the NP-hard problem of scheduling n independent jobs with release dates,...
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...
Dual decomposition of a single-machine scheduling problem
Dual decomposition of a single-machine scheduling problem
1995
The paper designs a fast ascent direction algorithm for the Lagrangian dual problem of...
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...
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...
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
1990
A branch-and-bound algorithm is presented for the two-machine flow shop problem with...
Papers per page: