AN ITERATIVE PROCEDURE FOR LOT STREAMING IN JOB-SHOP SCHEDULING

The issue in Lot Streaming is to split lots into sublots in order to i mprove the makespan (or some other criterion). We present a model and an iterative procedure in a general job-shop environment. In a first s tep, optimal sublot-sizes are computed given a sequence of sublots on the machines. In a second step, a better sequence is computed by solvi ng a standard job-shop scheduling problem with fixed sublot-sizes. Som e computational results on a sample (including the famous 10-10) are r eported. In case of no set-up, in few iterations, the makespan approac hes a lower bound with few sublots.