A parallel machine scheduling problem with two-agent and tool change activities: an efficient hybrid metaheuristic algorithm

References

• Agnetis, A., G. de Pascale, and D. Pacciarelli. 2009. “A Lagrangian Approach to Single-Machine Scheduling Problems with Two Competing Agents.” Journal of Scheduling 12 (4): 401–415. doi:10.1007/s10951-008-0098-0.
   Web of Science ®Google Scholar
• Agnetis, A., D. Pacciarelli, and A. Pacifici. 2007. “Multi-Agent Single Machine Scheduling.” Annals of Operations Research 150 (1): 3–15. doi:10.1007/s10479-006-0164-y.
   Web of Science ®Google Scholar
• Agnetis, A., P. B. Mirchandani, D. Pacciarelli, and A. Pacifici. 2004. “Scheduling Problems with Two Competing Agents.” Operations Research 52 (2): 229–242. doi:10.1287/opre.1030.0092.
   Web of Science ®Google Scholar
• Akturk, M. S., J. B. Ghosh, and E. D. Gunes. 2003. “Scheduling with Tool Changes to Minimize Total Completion Time: A Study of Heuristics and Their Performance.” Naval Research Logistics (NRL) 50 (1): 15–30. doi:10.1002/nav.10045.
   Web of Science ®Google Scholar
• Akturk, M. S., J. B. Ghosh, and E. D. Gunes. 2004. “Scheduling with Tool Changes to Minimize Total Completion Time: Basic Results and SPT Performance.” European Journal of Operational Research 157 (3): 784–790. doi:10.1016/S0377-2217(03)00232-7.
   Web of Science ®Google Scholar
• Akturk, M. S., J. B. Ghosh, and R. K. Kayan. 2007. “Scheduling with Tool Changes to Minimize Total Completion Time under Controllable Machining Conditions.” Computers & Operations Research 34 (7): 2130–2146. doi:10.1016/j.cor.2005.08.014.
   Web of Science ®Google Scholar
• Atashpaz-Gargari, E., and C. Lucas. 2007. “Imperialist Competitive Algorithm: An Algorithm for Optimization Inspired by Imperialistic Competition.” In IEEE Congress on Evolutionary Computation, CEC 2007, Singapore, September 25–28. doi:10.1109/CEC.2007.4425083.
   Google Scholar
• Azadeh, A., J. Seif, M. Sheikhalishahi, and M. Yazdani. 2015. “An Integrated Support Vector Regression–Imperialist Competitive Algorithm for Reliability Estimation of a Shearing Machine.” International Journal of Computer Integrated Manufacturing ( ahead-of-print): 1–9. doi:10.1080/0951192X.2014.1002810.
   Web of Science ®Google Scholar
• Azadeh, A., M. Sheikhalishahi, M. Firoozi, and S. M. Khalili. 2013. “An Integrated Multi-Criteria Taguchi Computer Simulation-Dea Approach for Optimum Maintenance Policy and Planning by Incorporating Learning Effects.” International Journal of Production Research 51 (18): 5374–5385. doi:10.1080/00207543.2013.774496.
   Web of Science ®Google Scholar
• Azadeh, A., M. Sheikhalishahi, S. M. Khalili, and M. Firoozi. 2014. “An Integrated Fuzzy Simulation–Fuzzy Data Envelopment Analysis Approach for Optimum Maintenance Planning.” International Journal of Computer Integrated Manufacturing 27 (2): 181–199. doi:10.1080/0951192X.2013.812804.
   Web of Science ®Google Scholar
• Baker, K. R., and J. C. Smith. 2003. “A Multiple-Criterion Model for Machine Scheduling.” Journal of Scheduling 6 (1): 7–16. doi:10.1023/A:1022231419049.
   Web of Science ®Google Scholar
• Behnamian, J., and M. Zandieh. 2011. “A Discrete Colonial Competitive Algorithm for Hybrid Flowshop Scheduling to Minimize Earliness and Quadratic Tardiness Penalties.” Expert Systems with Applications 38 (12): 14490–14498. doi:10.1016/j.eswa.2011.04.241.
   Web of Science ®Google Scholar
• Chen, J.-S. 2008. “Optimization Models for the Tool Change Scheduling Problem.” Omega 36 (5): 888–894. doi:10.1016/j.omega.2006.04.006.
   Web of Science ®Google Scholar
• Chen, Y.-C. 2013. “An Optimal Production and Inspection Strategy with Preventive Maintenance Error and Rework.” Journal of Manufacturing Systems 32 (1): 99–106. doi:10.1016/j.jmsy.2012.07.010.
   Web of Science ®Google Scholar
• Cheng, S.-R. 2014. “Some New Problems on Two-Agent Scheduling to Minimize the Earliness Costs.” International Journal of Production Economics 156: 24–30. doi:10.1016/j.ijpe.2014.05.004.
   Web of Science ®Google Scholar
• Cheng, T. C. E., S.-R. Cheng, W.-H. Wu, P.-H. Hsu, and C.-C. Wu. 2011. “A Two-Agent Single-Machine Scheduling Problem with Truncated Sum-of-Processing-Times-Based Learning Considerations.” Computers & Industrial Engineering 60 (4): 534–541. doi:10.1016/j.cie.2010.12.008.
   Web of Science ®Google Scholar
• Cheng, T. C. E., Y.-H. Chung, S.-C. Liao, and W.-C. Lee. 2013. “Two-Agent Singe-Machine Scheduling with Release Times to Minimize the Total Weighted Completion Time.” Computers & Operations Research 40 (1): 353–361. doi:10.1016/j.cor.2012.07.013.
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. T. Ng, and J. J. Yuan. 2006. “Multi-Agent Scheduling on a Single Machine to Minimize Total Weighted Number of Tardy Jobs.” Theoretical Computer Science 362 (1–3): 273–281. doi:10.1016/j.tcs.2006.07.011.
   Web of Science ®Google Scholar
• Cheng, T. C. E., C. T. Ng, and J. J. Yuan. 2008. “Multi-Agent Scheduling on a Single Machine with Max-Form Criteria.” European Journal of Operational Research 188 (2): 603–609. doi:10.1016/j.ejor.2007.04.040.
   Web of Science ®Google Scholar
• Cheng, T. C. E., W.-H. Wu, S.-R. Cheng, and C.-C. Wu. 2011. “Two-Agent Scheduling with Position-Based Deteriorating Jobs and Learning Effects.” Applied Mathematics and Computation 217 (21): 8804–8824. doi:10.1016/j.amc.2011.04.005.
   Web of Science ®Google Scholar
• Choi, B.-C., and J. Chung. 2014. “Two-Agent Single-Machine Scheduling Problem with Just-In-Time Jobs.” Theoretical Computer Science 543: 37–45. doi:10.1016/j.tcs.2014.05.022.
   Web of Science ®Google Scholar
• Choi, J. Y. 2015. “Minimizing Total Weighted Completion Time under Makespan Constraint for Two-Agent Scheduling with Job-Dependent Aging Effects.” Computers & Industrial Engineering 83: 237–243. doi:10.1016/j.cie.2015.02.024.
   Web of Science ®Google Scholar
• Feng, Q., J. Yuan, H. Liu, and H. Cheng. 2013. “A Note on Two-Agent Scheduling on an Unbounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives.” Applied Mathematical Modelling 37 (10–11): 7071–7076. doi:10.1016/j.apm.2013.03.013.
   Web of Science ®Google Scholar
• Ghodratnama, A., M. Rabbani, R. Tavakkoli-Moghaddam, and A. Baboli. 2010. “Solving a Single-Machine Scheduling Problem with Maintenance, Job Deterioration and Learning Effect by Simulated Annealing.” Journal of Manufacturing Systems 29 (1): 1–9. doi:10.1016/j.jmsy.2010.06.004.
   Web of Science ®Google Scholar
• Lee, K., B.-C. Choi, J. Y.-T. Leung, and M. L. Pinedo. 2009. “Approximation Algorithms for Multi-Agent Scheduling to Minimize Total Weighted Completion Time.” Information Processing Letters 109 (16): 913–917. doi:10.1016/j.ipl.2009.04.018.
   Web of Science ®Google Scholar
• Lee, W.-C., S.-K. Chen, and C.-C. Wu. 2010. “Branch-and-Bound and Simulated Annealing Algorithms for a Two-Agent Scheduling Problem.” Expert Systems with Applications 37 (9): 6594–6601. doi:10.1016/j.eswa.2010.02.125.
   Web of Science ®Google Scholar
• Lee, W.-C., Y.-H. Chung, and M.-C. Hu. 2012. “Genetic Algorithms for a Two-Agent Single-Machine Problem with Release Time.” Applied Soft Computing 12 (11): 3580–3589. doi:10.1016/j.asoc.2012.06.015.
   Web of Science ®Google Scholar
• Lee, W.-C., and J.-Y. Wang. 2014. “A Scheduling Problem with Three Competing Agents.” Computers & Operations Research 51: 208–217. doi:10.1016/j.cor.2014.06.011.
   Web of Science ®Google Scholar
• Lee, W.-C., W.-J. Wang, Y.-R. Shiau, and C.-C. Wu. 2010. “A Single-Machine Scheduling Problem with Two-Agent and Deteriorating Jobs.” Applied Mathematical Modelling 34 (10): 3098–3107. doi:10.1016/j.apm.2010.01.015.
   Web of Science ®Google Scholar
• Leung, J. Y.-T., M. Pinedo, and G. Wan. 2010. “Competitive Two-Agent Scheduling and Its Applications.” Operations Research 58 (2): 458–469. doi:10.1287/opre.1090.0744.
   Web of Science ®Google Scholar
• Li, D.-C., and P.-H. Hsu. 2012. “Solving a Two-Agent Single-Machine Scheduling Problem considering Learning Effect.” Computers & Operations Research 39 (7): 1644–1651. doi:10.1016/j.cor.2011.09.018.
   Web of Science ®Google Scholar
• Liu, P., and L. Tang. 2008. “Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine.” Lecture Notes in Computer Science 50 (92): 642–650. doi:10.1007/978-3-540-69733-6_63.
   Google Scholar
• Liu, P., N. Yi, and X. Zhou. 2011. “Two-Agent Single-Machine Scheduling Problems under Increasing Linear Deterioration.” Applied Mathematical Modelling 35 (5): 2290–2296. doi:10.1016/j.apm.2010.11.026.
   Web of Science ®Google Scholar
• Liu, P., N. Yi, X. Zhou, and H. Gong. 2013. “Scheduling Two Agents with Sum-Of-Processing-Times-Based Deterioration on a Single Machine.” Applied Mathematics and Computation 219 (17): 8848–8855. doi:10.1016/j.amc.2013.03.040.
   Web of Science ®Google Scholar
• Liu, P., X. Zhou, and L. Tang. 2010. “Two-Agent Single-Machine Scheduling with Position-Dependent Processing Times.” The International Journal of Advanced Manufacturing Technology 48 (1–4): 325–331. doi:10.1007/s00170-009-2259-5.
   Web of Science ®Google Scholar
• Montgomery, D. C. 2008. Design and Analysis of Experiments. 8th ed. New York: John Wiley & Sons.
   Google Scholar
• Mor, B., and G. Mosheiov. 2011. “Single Machine Batch Scheduling with Two Competing Agents to Minimize Total Flowtime.” European Journal of Operational Research 215 (3): 524–531. doi:10.1016/j.ejor.2011.06.037.
   Web of Science ®Google Scholar
• Naderi, B., M. Khalili, and R. Tavakkoli-Moghaddam. 2009. “A Hybrid Artificial Immune Algorithm for A Realistic Variant of Job Shops to Minimize the Total Completion Time.” Computers & Industrial Engineering 56 (4): 1494–1501. doi:10.1016/j.cie.2008.09.031.
   Web of Science ®Google Scholar
• Ng, C. T., T. C. E. Cheng, and J. J. Yuan. 2006. “A Note on the Complexity of the Problem of Two-Agent Scheduling on A Single Machine.” Journal of Combinatorial Optimization 12 (4): 387–394. doi:10.1007/s10878-006-9001-0.
   Web of Science ®Google Scholar
• Oron, D., D. Shabtay, and G. Steiner. 2015. “Single Machine Scheduling with Two Competing Agents and Equal Job Processing Times.” European Journal of Operational Research 244 (1): 86–99. doi:10.1016/j.ejor.2015.01.003.
   Web of Science ®Google Scholar
• Pargar, F., and M. Zandieh. 2012. “Bi-Criteria SDST Hybrid Flow Shop Scheduling with Learning Effect of Setup Times: Water Flow-Like Algorithm Approach.” International Journal of Production Research 50 (10): 2609–2623. doi:10.1080/00207543.2010.546380.
   Web of Science ®Google Scholar
• Perez-Gonzalez, P., and J. M. Framinan. 2014. “A Common Framework and Taxonomy for Multicriteria Scheduling Problems with Interfering and Competing Jobs: Multi-Agent Scheduling Problems.” European Journal of Operational Research 235 (1): 1–16. doi:10.1016/j.ejor.2013.09.017.
   Web of Science ®Google Scholar
• Qi, X. 2007. “A Note on Worst-Case Performance of Heuristics for Maintenance Scheduling Problems.” Discrete Applied Mathematics 155 (3): 416–422. doi:10.1016/j.dam.2006.06.005.
   Web of Science ®Google Scholar
• Ramezanian, R., M. Saidi-Mehrabad, and P. Fattahi. 2013. “MIP Formulation and Heuristics for Multi-Stage Capacitated Lot-Sizing and Scheduling Problem with Availability Constraints.” Journal of Manufacturing Systems 32 (2): 392–401. doi:10.1016/j.jmsy.2013.01.002.
   Web of Science ®Google Scholar
• Reisi-Nafchi, M., and G. Moslehi. 2015. “A Hybrid Genetic and Linear Programming Algorithm for Two-Agent Order Acceptance and Scheduling Problem.” Applied Soft Computing 33: 37–47. doi:10.1016/j.asoc.2015.04.027.
   Web of Science ®Google Scholar
• Renna, P. 2014. “Deteriorating Job Scheduling Problem in a Job-Shop Manufacturing System by Multi-Agent System.” International Journal of Computer Integrated Manufacturing 1–10. doi:10.1080/0951192X.2014.928747.
   Google Scholar
• Sbihi, M., and C. Varnier. 2008. “Single-Machine Scheduling with Periodic and Flexible Periodic Maintenance to Minimize Maximum Tardiness.” Computers & Industrial Engineering 55 (4): 830–840. doi:10.1016/j.cie.2008.03.005.
   Web of Science ®Google Scholar
• Sun, K., and H. Li. 2010. “Scheduling Problems with Multiple Maintenance Activities and Non-Preemptive Jobs on Two Identical Parallel Machines.” International Journal of Production Economics 124 (1): 151–158. doi:10.1016/j.ijpe.2009.10.018.
   Web of Science ®Google Scholar
• Tayebi Araghi, M. E., F. Jolai, and M. Rabiee. 2014. “Incorporating Learning Effect and Deterioration for Solving a SDST Flexible Job-Shop Scheduling Problem with a Hybrid Meta-Heuristic Approach.” International Journal of Computer Integrated Manufacturing 27 (8): 733–746. doi:10.1080/0951192X.2013.834465.
   Web of Science ®Google Scholar
• Wan, G., S. R. Vakati, J. Y. T. Leung, and M. Pinedo. 2010. “Scheduling Two Agents with Controllable Processing Times.” European Journal of Operational Research 205 (3): 528–539. doi:10.1016/j.ejor.2010.01.005.
   Web of Science ®Google Scholar
• Wu, C.-C., S.-K. Huang, and W.-C. Lee. 2011. “Two-Agent Scheduling with Learning Consideration.” Computers & Industrial Engineering 61 (4): 1324–1335. doi:10.1016/j.cie.2011.08.007.
   Web of Science ®Google Scholar
• Wu, C.-C., W.-C. Lee, and M.-J. Liou. 2013. “Single-Machine Scheduling with Two Competing Agents and Learning Consideration.” Information Sciences 251: 136–149. doi:10.1016/j.ins.2013.06.054.
   Web of Science ®Google Scholar
• Wu, C.-C., W.-H. Wu, J.-C. Chen, Y. Yin, and W.-H. Wu. 2013. “A Study of the Single-Machine Two-Agent Scheduling Problem with Release Times.” Applied Soft Computing 13 (2): 998–1006. doi:10.1016/j.asoc.2012.10.003.
   Web of Science ®Google Scholar
• Wu, W.-H. 2013. “A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations.” Mathematical Problems in Engineering 2013. doi:10.1155/2013/648082.
   Web of Science ®Google Scholar
• Wu, W.-H. 2014. “Solving a Two-Agent Single-Machine Learning Scheduling Problem.” International Journal of Computer Integrated Manufacturing 27 (1): 20–35. doi:10.1080/0951192X.2013.800229.
   Web of Science ®Google Scholar
• Wu, W.-H., S.-R. Cheng, C.-C. Wu, and Y. Yin. 2012. “Ant Colony Algorithms for a Two-Agent Scheduling with Sum-of Processing Times-Based Learning and Deteriorating Considerations.” Journal of Intelligent Manufacturing 23 (5): 1985–1993. doi:10.1007/s10845-011-0525-5.
   Web of Science ®Google Scholar
• Xu, D., M. Liu, Y. Yin, and J. Hao. 2013. “Scheduling Tool Changes and Special Jobs on a Single Machine to Minimize Makespan.” Omega 41 (2): 299–304. doi:10.1016/j.omega.2012.04.003.
   Web of Science ®Google Scholar
• Yazdani, M., and F. Jolai. 2015. “Lion Optimization Algorithm (LOA): A Nature-Inspired Metaheuristic Algorithm”. Journal of Computational Design and Engineering ( ahead-of-print). doi:10.1016/j.jcde.2015.06.003.
   Google Scholar
• Yazdani Sabouni, M. T., and F. Jolai. 2010. “Optimal Methods for Batch Processing Problem with Makespan and Maximum Lateness Objectives.” Applied Mathematical Modelling 34 (2): 314–324. doi:10.1016/j.apm.2009.04.007.
   Web of Science ®Google Scholar
• Yin, Y., S.-R. Cheng, T. C. E. Cheng, W.-H. Wu, and C.-C. Wu. 2013. “Two-Agent Single-Machine Scheduling with Release Times and Deadlines.” International Journal of Shipping and Transport Logistics 5 (1): 75–94. doi:10.1504/IJSTL.2013.050590.
   Web of Science ®Google Scholar
• Yin, Y., S.-R. Cheng, and C.-C. Wu. 2012. “Scheduling Problems with Two Agents and a Linear Non-Increasing Deterioration to Minimize Earliness Penalties.” Information Sciences 189: 282–292. doi:10.1016/j.ins.2011.11.035.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, L. Wan, C.-C. Wu, and J. Liu. 2015. “Two-Agent Single-Machine Scheduling with Deteriorating Jobs.” Computers & Industrial Engineering 81: 177–185. doi:10.1016/j.cie.2015.01.002.
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, X. Yang, and C.-C. Wu. 2015. “Two-Agent Single-Machine Scheduling with Unrestricted Due Date Assignment.” Computers & Industrial Engineering 79: 148–155. doi:10.1016/j.cie.2014.10.025.
   Web of Science ®Google Scholar
• Yin, Y., W.-H. Wu, S.-R. Cheng, and C.-C. Wu. 2012. “An Investigation on a Two-Agent Single-Machine Scheduling Problem with Unequal Release Dates.” Computers & Operations Research 39 (12): 3062–3073. doi:10.1016/j.cor.2012.03.012.
   Web of Science ®Google Scholar
• Yuan, J. J., W. P. Shang, and Q. Feng. 2005. “A Note on the Scheduling with Two Families of Jobs.” Journal of Scheduling 8 (6): 537–542. doi:10.1007/s10951-005-4997-z.
   Web of Science ®Google Scholar
• Yuan, S., B. Skinner, S. Huang, and D. Liu. 2013. “A New Crossover Approach for Solving the Multiple Travelling Salesmen Problem Using Genetic Algorithms.” European Journal of Operational Research 228 (1): 72–82. doi:10.1016/j.ejor.2013.01.043.
   Web of Science ®Google Scholar