Efficient flow-shop scheduling for large print shops with heavy-tail job size distributions

In this talk, we focus on the flexible flow-shop scheduling problem that arises in large print shops. Special attention is given to heavy-tail job size distributions and sequence-dependent setup costs that can be found in many print-shop environments. We describe a number of computationally efficient approaches to improving the productivity of large print shops while keeping the number of late jobs low.

Citation

Zhou, R.; Rai, S. Efficient flow-shop scheduling for large print shops with heavy-tail job size distributions. INFORMS Annual Meeting; 2008 October 12-15; Washington DC.