Abstract
We consider a scheduling problem for parallel identical batch processing machines. A batch is a set of jobs that can be processed at the same time on a single machine. The jobs belong to incompatible job families. Only jobs of the same family can be batched together. We are interested in minimizing the total weighted tardiness (TWT) of the jobs. Problems of this type arise, for instance, in semiconductor manufacturing. Other known occurrence of batch processing machines can be found in gear manufacturing. We describe a genetic algorithm (GA), an ant colony optimization (ACO) approach, and a large neighborhood search (LNS) approach for this scheduling problem. The performance of the three metaheuristic approaches is compared based on randomly generated problem instances. The LNS scheme outperforms the two other metaheuristics and is comparable with a variable neighborhood search (VNS) approach, the best performing heuristic for this scheduling problem from the literature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Almeder C, Mönch L (2011) Metaheuristics for scheduling jobs with incompatible families on parallel batch machines. J Oper Res Soc 62:2083–2096
Aytuk H, Khouja M, Vergara FE (2003) Use of genetic algorithms to solve production and operations management problems: a review. Int J Prod Res 41(17):3955–4009
Balasubramanian H, Mönch L, Fowler JW, Pfund ME (2004) Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int J Prod Res 42(8):1621–1638
Bilyk A, Mönch L, Almeder C (2014) Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. Comput Ind Eng 78:175–185
Bücher B (2014) Exakte und heuristische Ablaufplanungsverfahren für Jobs mit inkompatiblen Jobfamilien auf einer Batchmaschine. Bachelor thesis, University of Hagen, Department of Mathematics and Computer Science
den Besten M, Stützle T, Dorigo M (2000) Ant colony optimization for the total weighted tardiness problem. In: Proceedings 6th international conference parallel problem solving from nature (PPSN VI), pp 611–620
Devpura A, Fowler JW, Carlyle M, Perez I (2000) Minimizing total weighted tardiness on a single batch processing machine with incompatible job families. Proc Symp Oper Res 2000:366–371
Dorigo M, Stützle T (2004) Ant colony optimization. MIT Press, Boston
Kovacs AA, Parragh SN, Doerner KF, Hartl RF (2012) Adaptive large neighborhood search for service technician routing and scheduling problems. J Sched 15(5):579–600
Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29:990–1001
Mehta SV, Uzsoy R (1998) Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Trans 30(2):165–178
Mönch L, Fowler JW, Dauzére-Pèrés S, Mason SJ, Rose O (2011a) Scheduling semiconductor manufacturing operations: problems, solution techniques, and future challenges. J Sched 14(6):583–595
Mönch L, Ziarnetzky T, Devpura A, Fowler JW (2011b) A genetic algorithm based column generation scheme for parallel machine scheduling with total weighted tardiness objective. In: Proceedings of the VIII metaheuristic international conference (MIC) 2011, pp 299–307
Mönch L, Fowler JW, Mason SJ (2013) Production planning and control for semiconductor wafer fabrication facilities: modeling, analysis, and systems. Springer, New York
Pacino D, Van Hentenryck P (2011) Large neighborhood search and adaptive randomized decompositions for flexible job shop scheduling. In: Proceedings of the twenty-second international joint conference on artificial intelligence, 1999–2003
Parsa NR, Karimi B, Kashan AH (2010) A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes. Comput Oper Res 37(10): 1720–1730
Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. Springer, Berlin, pp 399–420
Ropke S, Pisinger D (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403–2435
Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings fourth international conference on principles and practice of constraint programming (CP-98)
Wang P, Reinelt G, Tan Y (2012) Self-adaptive large neighborhood search algorithm for parallel machine scheduling. J Syst Eng Electron 23(2):208–215
Yuan Y, Xu H (2013) An integrated search heuristic for large-scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Lausch, S., Mönch, L. (2016). Metaheuristic Approaches for Scheduling Jobs on Parallel Batch Processing Machines. In: Rabadi, G. (eds) Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. International Series in Operations Research & Management Science, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-26024-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-26024-2_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26022-8
Online ISBN: 978-3-319-26024-2
eBook Packages: Business and ManagementBusiness and Management (R0)