Scheduling with Grouping Considerations

WB07.1 Clustered Flow Shop Models Wlodzimierz Szwarc --- Univ. of WI, Sch. of Bus., Milwaukee, WI 53201 , (wmr@csd.uwm.edu)

This presentation deals with flow-shop models where n-items are¨ grouped in k sequences called clusters. The clusters are processed¨ on machines in the same order. The objective is to minimize¨ completion time. Models with setup times for clusters are also¨ examined. Approximate solutions along with lower bounds are¨ presented.

WB07.2 Scheduling of Customer Orders with Due Dates Reza H. Ahmadi, U. Bagchi --- UCLA, Anderson Grad. Sch. of Mgmt., 405 Hilgard Ave., Los Angeles, CA 90024-1481,

We consider a make-to-order manufacturer that uses dedicated¨ facilities to make a variety of products. Each customer order is for¨ a subset of the products with specified quantities. Furthermore,¨ each customer order has an associated due date and must be shipped¨ in whole. We address several performance measures.

WB07.3 Scheduling a Batch Processing Machine Steef van de Velde, Peter Brucker, Andrei Gladky, Han Hoogeveen, Mikhail Kovalyov, Chris Potts, Thomas Tautenhahn --- Univ. of Twente, Dept. of Mech. Eng., PO Box 217, Enschede 7500 AE, , The Netherlands (s.l.vandevelde@wb.utwente.nl)

We consider various single-machine scheduling problems where the¨ machine can process up to B jobs at the same time. We present new¨ results for different objectives, for the case that B is arbitrary¨ or bounded, and for a restricted number of different job types or¨ different batches.

WB07.4 A Minimal Model for the Discrete Lot-Sizing & Scheduling Problem Wolfgang Brueggemann, Kathrin Fischer, Hermann Jahnke --- Univ. Hamburg, Saling 14, 20535 Hamburg, , Germany (na.brueggemann@na-net.ornl.gov)

A drawback of known models for the DLSP is their exponential size¨ relative to a 'reasonable' encoding of the data. In analogy to¨ different model formulations for the JSP, we propose a new model for¨ the DLSP which has polynomial size and is therefore minimal.