Velde Steef van de

Steef van de Velde

Information about the author Steef van de Velde will soon be added to the site.
Found 5 papers in total
Lower bounds for minimizing total completion time in a two-machine flow shop
Lower bounds for minimizing total completion time in a two-machine flow shop
2006
For the NP-hard problem of scheduling n jobs in a two-machine flow shop so as to...
Multi-product lot-sizing with a transportation capacity reservation contract
Multi-product lot-sizing with a transportation capacity reservation contract
2005
Although transportation costs can form more than 50% of the total logistics...
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
1998
We consider a scheduling problem introduced by Ahmadi et at ., batching and scheduling...
Scheduling deteriorating jobs to minimize makespan
Scheduling deteriorating jobs to minimize makespan
1998
We consider a single-machine problem of scheduling n independent jobs to minimize...
Minimizing makespan in flowshops with pallet requirements: Computational complexity
Minimizing makespan in flowshops with pallet requirements: Computational complexity
1997
We establish the computational complexity of the problem of minimizing makespan in a...
Papers per page: