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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
