Abstract
If the shop capacity is limited it may not be possible to make a schedule that leads the completion times of all the parts processed in the shop to be exactly (just-in-time) at their due dates. As a result, the shop may have to incur holding cost for the parts finished earlier. This paper addresses a multi-due-date heterogeneous machines batch-scheduling problem, considering the just-in-time delivery, and the holding cost and the requirement that material to be processed should arrive at the production line just-in-time. We propose a solution procedure that divides the whole planning horizon into a number of periods, allots the parts to be processed in the shop to the divided periods, distributes the parts to be processed in each period to the available machines, and solves the problem of batch-scheduling on each machine. Numerical experience that shows the characteristics of the problem and the computational time required by the proposed procedure is also presented.
