论文信息 - Batching to minimize flow times on one machine

Batching to minimize flow times on one machine

Machine sequencing formulations typically assume that the characteristics of the job set to be processed are given. However, in many applications, jobs can be batched in different ways. Two types of minimum flow-time sequencing problems with lot sizing are formulated. The "item-flow" formulation is solved giving an index rule for ordering items. The "batch-flow" formulation is solved for the single product case showing that processing is done in unequal batches ordered in decreasing size. Heuristics and bounds are provided for the multiproduct case.

Uday S. Karmarkar | Gregory Dobson | Jeffrey L. Rummel | G. Dobson | U. Karmarkar

[1] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

[2] Shimon Y. Nof,et al. Performance evaluation of a flexible manufacturing cell with random multiproduct feedback flow , 1985 .

[3] Uday S. Karmarkar,et al. Lot Sizes, Lead Times and In-Process Inventories , 1987 .

[4] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5] Kevin Mahon,et al. Deterministic and Stochastic Scheduling , 1983 .

[6] Michael J. Magazine,et al. Batching in single operation manufacturing systems , 1985 .

[7] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[8] Stephen C. Graves,et al. A Review of Production Scheduling , 1981, Oper. Res..

[9] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[10] Paul H. Zipkin,et al. Models for Design and Control of Stochastic, Multi-Item Batch Production Systems , 1986, Oper. Res..

[11] William L. Maxwell,et al. Theory of scheduling , 1967 .

[12] Uday S. Karmarkar,et al. Lot-sizing and sequencing delays , 1987 .

[13] Jan Karel Lenstra,et al. Scheduling theory since 1981: an annotated bibliography , 1983 .