Customer order scheduling on batch processing machines with incompatible job families

Abstract

This paper addresses the order scheduling problems under configurations of single batch machine and parallel batch machines. Each order consists of several kinds of jobs from different incompatible job families with specific quantities. The batch machine is able to handle a group of jobs simultaneously. Incompatible job families are considered. The objectives are to minimise the order makespan and total weighted order completion time. We prove that the problems with minimising order makespan can be solved in polynomial time for single batch machine and parallel batch machines. As for minimising the total weighted order completion time, efficient heuristic algorithms together with the worst-case analysis are proposed. Numerical results show that the proposed algorithms can achieve high-quality solutions.

Keywords:

• order scheduling
• batch machine
• incompatible job families
• order makespan
• total weighted order completion time

Notes

No potential conflict of interest was reported by the authors.

Additional information

Funding

This research was supported in part by National Science Foundation of China [grant number 71690232], [grant number 71371015]; National Science Foundation, Division of Civil, Mechanical and Manufacturing Innovation [grant number CMMI-1435800].