Handling Sequence-dependent Setup Time Flexible Job Shop Problem with Learning and Deterioration Considerations using Evolutionary Bi-level Optimization

References

• Allahverdi, A. 2015. The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research 246:345–78. doi:10.1016/j.ejor.2015.04.004.
   Web of Science ®Google Scholar
• Amiri, M., M. Zandieh, M. Yazdani, and A. Bagheri. 2010. A variable neighbourhood search algorithm for the flexible job-shop scheduling problem. International Journal of Production Research 48 (19):5671–89. doi:10.1080/00207540903055743.
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and L. Ben Said. 2017. A hybrid algorithm for flexible job-shop scheduling problem with setup times. International Journal of Production Management and Engineering 5 (1):23–30. doi:10.4995/ijpme.2017.6618.
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and L. Ben Said. 2018. Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research 56 (4):1642–61. doi:10.1080/00207543.2017.1355576.
   Web of Science ®Google Scholar
• Azzouz, A., M. Ennigrou, and B. Jlifi. 2015. Diversifying ts using ga in multi-agent system for solving flexible job shop problem. Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics (ICINCO), France, vol. 1, 94–101.
   Google Scholar
• Azzouz, A., M. Ennigrou, and L. B. Said. 2016. Flexible job-shop scheduling problem with sequence-dependent setup times using genetic algorithm. 18th International Conference on Enterprise Information Systems (ICEIS), Italy, vol. 2, 47–53.
   Google Scholar
• Bagheri, A., and M. Zandieh. 2011. Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach. Journal of Manufacturing Systems 30 (1):8–15. doi:10.1016/j.jmsy.2011.02.004.
   Web of Science ®Google Scholar
• Bard, J. F. 2013. Practical bilevel optimization: Algorithms and applications, vol. 30. Springer Science & Business Media.
   Google Scholar
• Bracken, J., and J. T. McGill. 1973. Mathematical programs with optimization problems in the constraints. Operations Research 21 (1):37–44. doi:10.1287/opre.21.1.37.
   Web of Science ®Google Scholar
• Brandimarte, P. 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 41 (3):157–83. doi:10.1007/BF02023073.
   Google Scholar
• Candler, W., and R. Norton. 1977. Multilevel programming. Technical Report 20, World Bank Development Research, Washington, D. C.
   Google Scholar
• Chaabani, A., S. Bechikh, and L. B. Said. 2015b. A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. 2015 IEEE Congress on Evolutionary Computation (CEC), IEEE, Japan, 1659–66.
   Google Scholar
• Colson, B., P. Marcotte, and G. Savard. 2007. An overview of bilevel optimization. Annals of Operations Research 153 (1):235–56. doi:10.1007/s10479-007-0176-2.
   Web of Science ®Google Scholar
• Davis, L. D. 1985. Applying adaptive algorithms to epistatic domains. In Proc. International Joint Conference on Artificial Intelligence, USA. 162–64.
   Google Scholar
• Dempe, S. 2002. Foundations of bilevel programming. Springer Science & Business Media.
   Google Scholar
• Derrac, J., S. Garca, D. Molina, and F. Herrera. 2011. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation 1 (1):3–18. doi:10.1016/j.swevo.2011.02.002.
   Web of Science ®Google Scholar
• Ennigrou, M., and K. Ghedira. 2008. New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach. In Autonomous Agents and Multi-Agent Systems 17 (2):270–87. doi:10.1007/s10458-008-9031-3.
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and L. Stockmeyer. 1976. Some simplified np-complete graph problems. Theoretical Computer Science 1 (3):237–67. doi:10.1016/0304-3975(76)90059-1.
   Google Scholar
• González, M. A., C. Rodriguez Vela, and R. Varela. 2013. An efficient memetic algorithm for the flexible job shop with setup times. InTwenty-Third International Conference on Au-tomated Planning and Scheduling, Italy. 91–99.
   Google Scholar
• Gupta, J. N., and S. K. Gupta. 1988. Single facility scheduling with nonlinear processing times. Computers & Industrial Engineering 14 (4):387–93. doi:10.1016/0360-8352(88)90041-1.
   Web of Science ®Google Scholar
• Hosseini, N., and R. Tavakkoli-Moghaddam. 2013. Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals. The International Journal of Advanced Manufacturing Technology 65:771–86. doi:10.1007/s00170-012-4216-y.
   Web of Science ®Google Scholar
• Hurink, J., B. Jurisch, and M. Thole. 1994. Tabu search for the job shop scheduling problem with multi-purpose machines. Operations-Research-Spektrum 15 (4):205–15. doi:10.1007/BF01719451.
   Google Scholar
• Kacem, S., I. Hammadi, and P. Borne. 2002. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. Syst IEEE Syst Man Cybern 32 (1):1–13.
   Web of Science ®Google Scholar
• Nuijten, W. P., and E. H. Aarts. 1996. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 90 (2):269–84. doi:10.1016/0377-2217(95)00354-1.
   Web of Science ®Google Scholar
• Pezzella, F., G. Morganti, and G. Ciaschetti. 2008. A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research 35 (10):3202–12. doi:10.1016/j.cor.2007.02.014.
   Web of Science ®Google Scholar
• Pinedo, M. 1995. Scheduling theory, algorithms, and systems. New York: Springer-Verlag.
   Google Scholar
• Roy, R. K. 2001. Design of experiments using the Taguchi approach: 16 steps to product and process improvement. John Wiley & Sons.
   Google Scholar
• Ruiz, R., C. Maroto, and J. Alcaraz. 2006. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 (5):461–76. doi:10.1016/j.omega.2004.12.006.
   Web of Science ®Google Scholar
• Saidi-Mehrabad, M., and P. Fattahi. 2007. Flexible job shop scheduling with tabu search algorithms. The International Journal of Advanced Manufacturing Technology 32 (5–6):563–70. doi:10.1007/s00170-005-0375-4.
   Web of Science ®Google Scholar
• Tayebi Araghi, M. F., . J., 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 (Iss):8. doi:10.1080/0951192X.2013.834465.
   Google Scholar
• Wang, X., and T. Cheng. 2007. Single-machine scheduing with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research 178:57–70. doi:10.1016/j.ejor.2006.01.017.
   Web of Science ®Google Scholar
• Wright, T. P. 1936. Factors affecting the cost of airplanes. Journal of the Aeronautical Science 3 (2):122–28. doi:10.2514/8.155.
   Google Scholar
• Ziaee, M. 2014. A heuristic algorithm for solving flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology 71:519. doi:10.1007/s00170-013-5510-z.
   Web of Science ®Google Scholar
• Zribi, N., I. Kacem, and A. El Kamel. 2004. Hierarchical optimization for the flexible job shop scheduling problem. IFAC Proceedings Volumes 37 (4):479–84. doi:10.1016/S1474-6670(17)36160-8.
   Google Scholar