haku: @journal_id 112 / yhteensä: 1577
viite: 87 / 1577
| Tekijä: | Dauzere-Peres, S. Lasserre, J. -B. |
| Otsikko: | Lot streaming in job-shop scheduling |
| Lehti: | Operations Research
1997 : JUL-AUG, Vol. 45:4, p. 584-595 |
| Asiasana: | JOB-SHOP SCHEDULING PRODUCTION WORK STUDY |
| Kieli: | eng |
| Tiivistelmä: | The issue in Lot Streaming is how to split lots into sublots in order to improve the makespan. We present a model and an interative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublots on the machines, and a standard job-shop scheduling problem with fixed sublot sizes. We report the computational results on a significant sample of 120 job-shop and flow-shop scheduling problems. In case of no setup , in a few iterations, the makespan approaches a lower bound using very few sublots, suggesting that the procedure yields a gobal optimum. As a by-product, this result somehow validates the capacitated lot-sizing models in which the detailed capacity constraints, induced by the sequencing of operations, are ignored. |
SCIMA