Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics

Computers and Industrial Engineering

Volumn 78, Issue , 2014, Pages 175-185

  Bilyk, Andrew ^a   Mönch, Lars ^a   Almeder, Christian ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b EUROPEAN UNIVERSITY VIADRINA   (Germany)

Author keywords

Batching; Greedy randomized adaptive search; Parallel machines; Scheduling; Variable neighborhood search

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION; SILICON WAFERS;

ADAPTIVE SEARCH; BATCHING; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; PARALLEL MACHINE; SEMICONDUCTOR WAFER FABRICATION; SHIFTING BOTTLENECK HEURISTIC; TOTAL-WEIGHTED TARDINESS; VARIABLE NEIGHBORHOOD SEARCH;

SCHEDULING;

EID: 84912568162     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2014.10.008     Document Type: Article

References (39)

1. C. Almeder, and L. Mönch Metaheuristics for scheduling jobs with incompatible families on parallel batching machines Journal of the Operational Research Society 62 2011 2083 2096
2. C. Almeder, and L. Mönch A GRASP approach for scheduling jobs with incompatible families on parallel batch machines Proceedings Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA) 2011 2011 557 560
3. V.A. Armentano, and M.F. de Franca Filho Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach European Journal of Operational Research 183 2007 100 114
4. A. Bilyk, and L. Mönch Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops Proceedings IEEE International Conference on Automation Science and Engineering (CASE) 2012 2012 419 424
5. A.R. Brodtkorb, T.R. Hagen, C. Schulz, and G. Hasle GPU computing in discrete optimization. Part I: Introduction to the GPU EURO Journal on Transportation and Logistics 2 2013 129 157
6. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, and T. Tautenhahn Scheduling a batching machine Journal of Scheduling 1 1998 31 54
7. T.C.E. Cheng, C.T. Ng, J.J. Yuan, and Z.H. Liu Single machine parallel batch scheduling subject to precedence constraints Naval Research Logistics 51 2004 949 958
8. T.C. Chiang, H.C. Cheng, and L.C. Fu A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival Computers and Operations Research 37 12 2010 2257 2269 2010
9. M. Czapinski, and S. Barnes Tabu search with two approaches to parallel flow shop evaluation on CUDA platform Journal of Parallel and Distributed Computing 71 2011 802 811
10. P. Damodaran, and M.C. Vélez-Gallego Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times The International Journal of Advanced Manufacturing Technology 49 9-12 2010 1119 1128
11. P. Damodaran, and M.C. Vélez-Gallego A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times Expert Systems with Applications 39 1 2012 1451 1458
12. P. Damodaran, M.C. Vélez-Gallego, and J. Maya A GRASP approach for makespan minimization on parallel batch processing machines Journal of Intelligent Manufacturing 22 5 2011 767 777
13. T.A. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters 8 1989 67 71
14. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A Survey Annals of Discrete Mathematics 5 1979 287 326
15. P. Hansen, and N. Mladenovic Variable neighborhood search: Principles and applications European Journal of Operational Research 130 2001 449 467
16. Z. Jia, and J.Y.T. Leung A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes European Journal of Operational Research 2014 (to appear)
17. Y.-D. Kim, B.-J. Joo, and S.-Y. Choi Scheduling wafer lots on diffusion machines in a semiconductor wafer fabrication facility IEEE Transactions on Semiconductor Manufacturing 23 2 2010 246 252
18. Klemmt, A.; Weigert, G.; Almeder, C.; Mönch, L. (2009) A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. In: Proceedings of the 2009 winter simulation conference, pp. 1684-1694.
19. A. Klemmt, G. Weigert, and S. Werner Optimisation approaches for batch scheduling in semiconductor manufacturing European Journal of Industrial Engineering 5 3 2011 338 359
20. E.L. Lawler A "pseudopolynomial" time algorithm for sequencing jobs to minimize total tardiness Annals of Discrete Mathematics 1 1977 331 342
21. D. Lei, and X.P. Guo Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines International Journal of Production Research 49 2 2011 519 529
22. L. Liu Batch Scheduling Problems. PhD Thesis 2007 The Honkong Polytechnic University, Department of Logistics
23. L.L. Liu, C.T. Ng, and T.C.E. Cheng On the complexity of bi-criteria scheduling on a single batch processing machine Journal of Scheduling 13 6 2010 629 638
24. L.L. Liu, C.T. Ng, and T.C.E. Cheng Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan Optimization Letters 8 2014 307 318
25. L. Liu, and H. Zhou Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem Information Sciences 226 2013 68 92
26. M. Mathirajan, and A.I. Sivakumar A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor International Journal of Advanced Manufacturing Technology 29 2006 990 1001
27. N. Mladenovic, and P. Hansen Variable neighborhood search Computers and Operations Research 24 1997 1097 1100
28. L. Mönch, H. Balasubramanian, J.W. Fowler, and M.E. Pfund Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times Computers and Operations Research 32 2005 2731 2750
29. L. Mönch, J.W. Fowler, S. Dauzère-Pérès, S.J. Mason, and O. Rose A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations Journal of Scheduling 14 6 2011 583 599
30. L. Mönch, J.W. Fowler, and S.J. Mason Production planning and control of semiconductor wafer fabrication facilities: Modeling, analysis, and systems 2012 Springer New York
31. L. Mönch, R. Schabacker, D. Pabst, and J.W. Fowler Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops European Journal of Operational Research 177 3 2007 2100 2118
32. I.M. Ovacik, and R. Uzsoy Decomposition methods for complex factory scheduling problems 1997 Kluwer Academic Publishers Boston
33. M. Pinedo Scheduling: Theory, algorithms, and systems 3rd ed. 2008 Prentice Hall Englewood Cliffs, NJ
34. M.G.C. Resende, and C.C. Ribeiro Parallel greedy randomized adaptive search procedures E. Alba, Handbook on parallel metaheuristics: A new class of algorithms 2005 Wiley 315 346
35. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedure F. Glover, G. Kochenberger, Handbook in metaheuristics 2003 Kluwer Academic Publishers 219 249
36. L. Shen, L. Mönch, and U. Buscher A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups Journal of Scheduling 17 5 2014 471 487
37. Sobeyko, O.; Mönch L. (2011). A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs. In: Proceedings of the 2011 Winter Simulation Conference, 2011-2021.
38. A. Vepsalainen, and T.E. Morton Priority rules and lead time estimates for job shop scheduling with weighted tardiness costs Management Science 33 1987 1036 1047
39. C. Yugma, S. Dauzère-Pérès, C. Artigues, A. Derreumaux, and O. Sibille A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing International Journal of Production Research 50 8 2012 2118 2132