Identical Parallel Machine Scheduling Problem with Additional Resources and Partial Confirmed Orders in Make-to-Stock Strategy

Abstract

This research deals with the parallel machine scheduling problem for identical machines that need additional operational resources during the changeover. The production strategy is mainly based on make-to-stock. When the current inventory is less than the quantity of the new order, the corresponding products will be scheduled for production in predetermined production batches that are larger than the quantity of the order. Because the additional resources are limited, batch splitting, which increases the number of changeovers, is not permitted. The objective is to minimize both the makespan and total tardiness. A two-phase methodology is proposed. In the first phase, a mixed-integer program is developed to minimize the makespan. The resulting minimal makespan becomes the constraint in the second phase. An extended mixed-integer program is then developed to minimize the total tardiness. A case study of a plastic pallet manufacturing company is introduced. The experimental results show that the proposed methodology can minimize the makespan and total tardiness efficiently. Moreover, it also shows the promise of the proposed methodology for solving practical applications.