| Article ID: | iaor19951321 |
| Country: | United Kingdom |
| Volume: | 45 |
| Issue: | 10 |
| Start Page Number: | 1211 |
| End Page Number: | 1215 |
| Publication Date: | Oct 1994 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Cheng T.C.E., Gordon V.S. |
| Keywords: | programming: dynamic |
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. Thee 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.