Single machine scheduling with batch deliveries

https://doi.org/10.1016/0377-2217(96)00127-0Get rights and content

Abstract

The single machine batch scheduling problem is studied. The jobs in a batch are delivered to the customer together upon the completion time of the last job in the batch. The earliness of a job is defined as the difference between the delivery time of the batch to which it belongs and its completion time. The objective is to minimize the sum of the batch delivery and job earliness penalties. A relation between this problem and the parallel machine scheduling problem is identified. This enables the establishment of complexity results and algorithms for the former problem based on known results for the latter problem.

References (18)

There are more references available in the full text version of this article.

Cited by (0)

1

Supported in part by RGC Grant HKP54/94E.

2

Supported in part by INTAS Grant 93–257.

View full text