MINIMIZE THE BATCH DELIVERY IN MACHINE SCHEDULING

Abstract

This paper is to Minimize the Batch Delivery in Machine Scheduling, study a problem in which a set of jobs has to be batched as well as scheduled for processing on a single machine. Each delivery batch has a capacity and incurs cost. A constant machine set-up time is required before the first job of each batch is processed. A schedule specifies the sequence of batches, where each batch comprises a sequence of jobs. The batch delivery time is defined as the completion time of the last job in a batch. The earliness of a job is defined as the difference between the delivery time of the batch to which it belongs and the job completion time. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost and to minimize the sum of the total weighted job earliness and mean batch delivery time.