Customer order scheduling on batch processing machines with incompatible job families

Zhongshun Shi, Zewen Huang and Leyuan Shi

International Journal of Production Research, 2018, vol. 56, issue 1-2, 795-808

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.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2017.1401247 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:56:y:2018:i:1-2:p:795-808

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2017.1401247

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().