论文信息 - Batch Delivery Scheduling on a Single Machine

Batch Delivery Scheduling on a Single Machine

The problem of partitioning a set of independent and simultaneously available jobs into batches and sequencing them for processing on a single machine is presented. Jobs in the same batch are to be delivered together, upon completion of the last job in the batch. Jobs finished before this time have to wait until delivery. There are a delivery cost depending on the number of batches formed and an earliness cost for jobs finished before delivery. The dynamic programming approach to minimizing the total cost is considered, yielding two pseudopolynomial algorithms when the number of batches has a fixed upper bound. A polynomial algorithm for a special case of the problem is also presented.

T.C.E. Cheng | V. S. Gordon | V. Gordon | T. Cheng

[1] Uday S. Karmarkar,et al. Batching to minimize flow times on parallel heterogeneous machines , 1989 .

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

[3] Susanne Albers,et al. The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..

[4] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[5] Uday S. Karmarkar,et al. Batching to minimize flow times on one machine , 1987 .

[6] Michael H. Rothkopf,et al. Scheduling Independent Tasks on Parallel Processors , 1966 .

[7] T.C.E. Cheng,et al. Survey of scheduling research involving due date determination decisions , 1989 .

[8] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .

[9] Denis Naddef,et al. One-pass batching algorithms for the one-machine problem , 1988, Discret. Appl. Math..

[10] P. B. Coaker,et al. Applied Dynamic Programming , 1964 .