Minimizing Makespan in a Pallet-Constrained Flowshop

Hoogeveen, J. (Han) A.; Sethi, Suresh; Sriskandarajah, Chelliah; van de Velde, S. L.; Wang, M. W.

Download This Paper

Open PDF in Browser

Add Paper to My Library

Minimizing Makespan in a Pallet-Constrained Flowshop

Journal of Scheduling, Vol. 2, No. 3, 1999

3 Pages Posted: 17 Jan 2009

See all articles by J. (Han) A. Hoogeveen

Suresh Sethi

University of Texas at Dallas - Naveen Jindal School of Management

S. L. van de Velde

Erasmus University Rotterdam (EUR) - Department of Technology and Operations Management

We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by a positive integer K <= n. We look on the impact of the number of pallets on the makespan. We identify a class of instances for which we can prove a worst-case bound on the minimum K that guarantees the least possible makespan. Furthermore, we look at the trade-off between the number of pallets used and the obtained makespan if we process the jobs in the order dictated by Gilmore-Gomory's algorithm.

Keywords: Scheduling; Flow-shop; Resource optimization; Makespan, Heuristics, Constraint on pallets, Worst-case bounds, the Gilmore-Gomory algorithm

JEL Classification: C00, C61, M11

Suggested Citation: Suggested Citation

Hoogeveen, J. (Han) A. and Sethi, Suresh and Sriskandarajah, Chelliah and van de Velde, Steef and Wang, M. W., Minimizing Makespan in a Pallet-Constrained Flowshop. Journal of Scheduling, Vol. 2, No. 3, 1999, Available at SSRN: https://ssrn.com/abstract=1328967