Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints

References

• Balakrishnan, N., J. J. Kanet, and V. Sridharan. 1999. “Early/Tardy Scheduling with Sequence Dependent Setups on Uniform Parallel Machines.” Computers and Operations Research 26 (2): 127–141. doi: 10.1016/S0305-0548(98)00051-3
   Web of Science ®Google Scholar
• Bilyk, A., and L. Monch. 2012. “A Variable Neighborhood Search Approach for Planning and Scheduling of Jobs on Unrelated Parallel Machines.” Journal of Intelligent Manufacturing 23 (5): 1621–1635. doi: 10.1007/s10845-010-0464-6
   Web of Science ®Google Scholar
• Blazewicz, J. 1984. “Scheduling Pre-emptible Tasks on Parallel Processors with Information Loss.” Technique et Science Informatiques 3: 415–420.
   Google Scholar
• Çakar, T., R. Köker, and Y. Sari. 2012. “Parallel Robot Scheduling to Minimize Mean Tardiness with Unequal Release Date and Precedence Constraints Using a Hybrid Intelligent System.” International Journal of Advanced Robotic Systems 9: 1–13. doi: 10.5772/54381
   Web of Science ®Google Scholar
• Centeno, G., and R. L. Armacost. 1997. “Parallel Machine Scheduling with Release Time and Machine Eligibility Restrictions.” Computers and Industrial Engineering 33 (1–2): 273–276. doi: 10.1016/S0360-8352(97)00091-0
   Web of Science ®Google Scholar
• Centeno, G., and R. L. Armacost. 2004. “Minimizing Makespan on Parallel Machines with Release Time and Machine Eligibility Restrictions.” International Journal of Production Research 42 (6): 1243–1256. doi: 10.1080/00207540310001631584
   Web of Science ®Google Scholar
• Chung, T-P., C-J. Liao, and M. Smith. 2013. “A Canned Food Scheduling Problem with Batch Due Date.” Engineering Optimization 46 (9): 1284–1294. doi: 10.1080/0305215X.2013.827674
   Web of Science ®Google Scholar
• Dorigo, M., G. Di Caro, and L. M. Gambardella. 1999. “Ant Algorithms for Discrete Optimization.” Artificial Life 5 (2): 137–172. doi: 10.1162/106454699568728
   PubMed Web of Science ®Google Scholar
• Driessel, R., and L. Monch. 2011. “Variable Neighborhood Search Approaches for Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times, Precedence Constraints, and Ready Times.” Computers and Industrial Engineering 61 (2): 336–345. doi: 10.1016/j.cie.2010.07.001
   Web of Science ®Google Scholar
• Edis, E. B., and I. Ozkarahan. 2011. “A Combined Integer/Constraint Programming Approach to a Resource-constrained Parallel Machine Scheduling Problem with Machine Eligibility Restrictions.” Engineering Optimization 43 (2): 135–157. doi: 10.1080/03052151003759117
   Web of Science ®Google Scholar
• Gacias, B., C. Artigues, and P. Lopez. 2010. “Parallel Machine Scheduling with Precedence Constraints and Setup Times.” Computers and Operations Research 37 (12): 2141–2151. doi: 10.1016/j.cor.2010.03.003
   Web of Science ®Google Scholar
• Gokhale, R., and M. Mathirajan. 2012. “Scheduling Identical Parallel Machines with Machine Eligibility Restrictions to Minimize Total Weighted Flow Time in Automobile Gear Manufacturing.” International Journal of Advanced Manufacturing Technology 60 (9–12): 1099–1110. doi: 10.1007/s00170-011-3653-3
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Holland, J. 1992. “Genetic Algorithms.” Scientific American 267 (1): 66–72. doi: 10.1038/scientificamerican0792-66
   PubMed Web of Science ®Google Scholar
• Hu, X., J-S. Bao, and Y. Jin. 2010. “Minimising Makespan on Parallel Machines with Precedence Constraints and Machine Eligibility Restrictions.” International Journal of Production Research 48 (6): 1639–1651. doi: 10.1080/00207540802620779
   Web of Science ®Google Scholar
• Hurink, J., and S. Knust. 2001. “List Scheduling in a Parallel Machine Environment with Precedence Constraints and Setup Times.” Operational Research Letters 29 (5): 231–239. doi: 10.1016/S0167-6377(01)00104-3
   Web of Science ®Google Scholar
• Joo, C. M., and B. S. Kim. 2012. “Parallel Machine Scheduling Problem with Ready Times, Due Times and Sequence-dependent Setup Times Using Meta-heuristic Algorithms.” Engineering Optimization 44 (9): 1021–1034. doi: 10.1080/0305215X.2011.628388
   Web of Science ®Google Scholar
• Kaplan, S., and G. Rabadi. 2013. “Simulated Annealing and Metaheuristic for Randomized Priority Search Algorithms for the Aerial Refuelling Parallel Machine Scheduling Problem with Due Date-to-Deadline Windows and Release Times.” Engineering Optimization 45 (1): 67–87. doi: 10.1080/0305215X.2012.658783
   Web of Science ®Google Scholar
• Keskinturk, T., M. B. Yildirim, and M. Barut. 2012. “An Ant Colony Optimization Algorithm for Load Balancing in Parallel Machines with Sequence-dependent Setup Times.” Computers and Operations Research 39 (6): 1225–1235. doi: 10.1016/j.cor.2010.12.003
   Web of Science ®Google Scholar
• Kim, D-W., K-H. Kim, W. Jang, and F. Frank Chen. 2002. “Unrelated Parallel Machine Scheduling with Setup Times Using Simulated Annealing.” Robotics and Computer-Integrated Manufacturing 18 (3–4): 223–231. doi: 10.1016/S0736-5845(02)00013-3
   Web of Science ®Google Scholar
• Kirkpatrick, S., C. D. Gelatt Jr, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220: 671–680. doi: 10.1126/science.220.4598.671
   PubMed Web of Science ®Google Scholar
• Lee, H. T., D. L. Yang, and S. J. Yang. 2013. “Multi-machine Scheduling with Deterioration Effects and Maintenance Activities for Minimizing the Total Earliness and Tardiness Costs.” International Journal of Advanced Manufacturing Technology 66 (1–4): 547–554. doi: 10.1007/s00170-012-4348-0
   Web of Science ®Google Scholar
• Liao, L. W., and G. J. Sheen. 2008. “Parallel Machine Scheduling with Machine Availability and Eligibility Constraints.” European Journal of Operational Research 184 (2): 458–467. doi: 10.1016/j.ejor.2006.11.027
   Web of Science ®Google Scholar
• Lin, B. M. T., F. C. Lin, and R. C. T. Lee. 2006. “Two-machine Flow-shop Scheduling to Minimize Total Late Work.” Engineering Optimization 38 (4): 501–509. doi: 10.1080/03052150500420439
   Web of Science ®Google Scholar
• Nogueira, J. P. C. M., J. E. C. Arroyo, H. M. M. Villadiego, and L. B. Goncalves. 2014. “Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties.” Electronic Notes in Theoretical Computer Science 302: 53–72. doi: 10.1016/j.entcs.2014.01.020
   Google Scholar
• Potts, C. N., and L. N. Van Wassenhove. 1992. “Single Machine Scheduling to Minimize Total Late Work.” Operations Research 40 (3): 586–595. doi: 10.1287/opre.40.3.586
   Web of Science ®Google Scholar
• Radhakrishnan, S., and J. A. Ventura. 2000. “Simulated Annealing for Parallel Machine Scheduling with Earliness-tardiness Penalties and Sequence-Dependent Set-up Times.” International Journal of Production Research 38 (10): 2233–2252. doi: 10.1080/00207540050028070
   Web of Science ®Google Scholar
• Sheen, G. J., L. W. Liao, and C. F. Lin. 2008. “Optimal Parallel Machines Scheduling with Machine Availability and Eligibility Constraints.” International Journal of Advanced Manufacturing Technology 36 (1–2): 132–139. doi: 10.1007/s00170-006-0810-1
   Web of Science ®Google Scholar
• Silva, C., and J. M. Magalhaes. 2006. “Heuristic Lot Size Scheduling on Unrelated Parallel Machines with Applications in the Textile Industry.” Computer and Industrial Engineering 50 (1–2): 76–89. doi: 10.1016/j.cie.2006.01.001
   Web of Science ®Google Scholar
• Sterna, M. 2011. “A Survey of Scheduling Problems with Late Work Criteria.” Omega 39 (2): 120–129. doi: 10.1016/j.omega.2010.06.006
   Web of Science ®Google Scholar
• Tavakkoli-Moghaddam, R., F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani. 2009. “Design of a Genetic Algorithm for bi-objective Unrelated Parallel Machines Scheduling with Sequence-dependent Setup Times and Precedence Constraints.” Computers and Operations Research 36 (12): 3224–3230. doi: 10.1016/j.cor.2009.02.012
   Web of Science ®Google Scholar
• Wang, I-L., Y-C. Wang, and C-W. Chen. 2013. “Scheduling Unrelated Parallel Machines in Semiconductor Manufacturing by Problem Reduction and Local Search Heuristics.” Flexible Services and Manufacturing Journal 25 (3): 343–366. doi: 10.1007/s10696-012-9150-7
   Web of Science ®Google Scholar
• Yu, L., H. M. Shih, M. Pfund, W. M. Carlyle, and J. W. Fowler. 2002. “Scheduling of Unrelated Parallel Machines: An Application to PWB Manufacturing.” IIE Transactions 34 (11): 921–931.
   Web of Science ®Google Scholar