{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:24:00Z","timestamp":1768559040544,"version":"3.49.0"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,10]],"date-time":"2009-01-10T00:00:00Z","timestamp":1231545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10479-008-0501-4","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T22:17:53Z","timestamp":1231539473000},"page":"165-196","source":"Crossref","is-referenced-by-count":28,"title":["Metaheuristics for the multi-objective FJSP with\u00a0sequence-dependent set-up times, auxiliary resources and\u00a0machine down time"],"prefix":"10.1007","volume":"180","author":[{"given":"Jacomine","family":"Grobler","sequence":"first","affiliation":[]},{"given":"Andries P.","family":"Engelbrecht","sequence":"additional","affiliation":[]},{"given":"Schalk","family":"Kok","sequence":"additional","affiliation":[]},{"given":"Sarma","family":"Yadavalli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,10]]},"reference":[{"key":"501_CR1","unstructured":"Abdedda\u2019im, Y., & Maler, O. (2002). Pre-emptive job shop scheduling problem using stopwatch automata. In Proceedings of the 8th international conference on tools and algorithms for the construction and analysis of systems (pp. 113\u2013126)."},{"issue":"12","key":"501_CR2","doi-asserted-by":"crossref","first-page":"2635","DOI":"10.1080\/00207540110047711","volume":"39","author":"K. A. Aldakhilallah","year":"2001","unstructured":"Aldakhilallah, K. A., & Ramesh, R. (2001). Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment. International Journal of Production Research, 39(12), 2635\u20132657.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"501_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D. Anghinolfi","year":"2009","unstructured":"Anghinolfi, D., & Paolucci, M. (2009). A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 193(1), 73\u201385.","journal-title":"European Journal of Operational Research"},{"key":"501_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0921-8890(00)00087-7","volume":"33","author":"M. E. Aydin","year":"2000","unstructured":"Aydin, M. E., & Oztemel, E. (2000). Dynamic job-shop scheduling using reinforcement learning agents. Robotics and Autonomous Systems, 33, 169\u2013178.","journal-title":"Robotics and Autonomous Systems"},{"key":"501_CR5","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0377-2217(03)00434-X","volume":"159","author":"S. Bertel","year":"2004","unstructured":"Bertel, S., & Billaut, J. C. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research, 159, 651\u2013662.","journal-title":"European Journal of Operational Research"},{"key":"501_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., & Pesch, E. (1996). The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93, 1\u201333.","journal-title":"European Journal of Operational Research"},{"key":"501_CR7","doi-asserted-by":"crossref","unstructured":"Brizuela, C.A., Zhao, Y., & Sannomiya, N. (2001). No-wait and blocking job-shops: challenging problems for GA\u2019s. In Proceedings of the 2001 IEEE international conference on systems, man, and cybernetics (pp. 2349\u20132354).","DOI":"10.1109\/ICSMC.2001.972908"},{"key":"501_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms (4th ed.). Berlin: Springer.","edition":"4"},{"key":"501_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10951-005-1639-4","volume":"8","author":"P. Brucker","year":"2005","unstructured":"Brucker, P., & Kampmeyer, T. (2005). Tabu search algorithms for cyclic machine scheduling problems. Journal of Scheduling, 8, 303\u2013322.","journal-title":"Journal of Scheduling"},{"key":"501_CR10","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P. Brucker","year":"1996","unstructured":"Brucker, P., & Kramer, A. (1996). Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research, 90, 214\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"501_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2003.03.001","volume":"161","author":"G. Cavory","year":"2005","unstructured":"Cavory, G., Dupas, R., & Goncalves, G. (2005). A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. European Journal of Operational Research, 161, 73\u201385.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"501_CR12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1080\/03052150600574341","volume":"38","author":"J. Chen","year":"2006","unstructured":"Chen, J., & Pan, J. C. (2006). Integer programming models for the re-entrant shop scheduling problem. Engineering Optimization, 38(5), 577\u2013592.","journal-title":"Engineering Optimization"},{"key":"501_CR13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1014990729837","volume":"107","author":"W. Cheung","year":"2001","unstructured":"Cheung, W., & Zhou, H. (2001). Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Annals of Operations Research, 107, 65\u201381.","journal-title":"Annals of Operations Research"},{"key":"501_CR14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ijpe.2004.05.023","volume":"98","author":"D. Chung","year":"2005","unstructured":"Chung, D., Lee, K., Shin, K., & Park, J. (2005). A new approach to jobshop scheduling problems with due date constraints considering operation subcontracts. International Journal of Production Economics, 98, 238\u2013250.","journal-title":"International Journal of Production Economics"},{"key":"501_CR15","volume-title":"Fundamentals of computational swarm intelligence","author":"A. P. Engelbrecht","year":"2005","unstructured":"Engelbrecht, A. P. (2005). Fundamentals of computational swarm intelligence. New York: Wiley."},{"key":"501_CR16","first-page":"309","volume-title":"Lecture notes in computer science","author":"M. F. Ercan","year":"2007","unstructured":"Ercan, M. F., & Fung, Y. (2007). Performance of particle swarm optimization in scheduling hybrid flow-shops with multiprocessor tasks. In Lecture notes in computer science (Vol.\u00a04707, pp. 309\u2013318). Berlin: Springer."},{"key":"501_CR17","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I. Essafi","year":"2008","unstructured":"Essafi, I., Mati, Y., & Dauz\u00e8re-P\u00e9r\u00e8s, D. (2008). A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers and Operations Research, 35, 2599\u20132616.","journal-title":"Computers and Operations Research"},{"issue":"10","key":"501_CR18","doi-asserted-by":"crossref","first-page":"2783","DOI":"10.1080\/00207549608905059","volume":"34","author":"L. D. Fredendall","year":"1996","unstructured":"Fredendall, L. D., Melnyk, S. A., & Ragatz, G. (1996). Information and scheduling in a dual resource constrained job shop. International Journal of Production Research, 34(10), 2783\u20132802.","journal-title":"International Journal of Production Research"},{"key":"501_CR19","doi-asserted-by":"crossref","unstructured":"Gao, J., Gen, M., & Sun, L. (2006). A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem. In Proceedings of the 8th annual conference on genetic and evolutionary computation (pp. 1157\u20131164).","DOI":"10.1145\/1143997.1144181"},{"key":"501_CR20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"J. Giffler","year":"1960","unstructured":"Giffler, J., & Thompson, G. L. (1960). Algorithms for solving production scheduling problems. Operations Research, 8, 487\u2013503.","journal-title":"Operations Research"},{"key":"501_CR21","first-page":"472","volume-title":"Lecture notes in artificial intelligence","author":"M. A. Gonzalez","year":"2006","unstructured":"Gonzalez, M. A., Vela, C. R., Sierra, M., Gonzales, I., & Varela, R. (2006). Comparing schedule generation schemes in memetic algorithms for the job shop scheduling problem with sequence dependent setup times. In Lecture notes in artificial intelligence (Vol.\u00a04293, pp. 472\u2013482). Berlin: Springer."},{"key":"501_CR22","doi-asserted-by":"crossref","unstructured":"Grobler, J., & Engelbrecht, A. P. (2007). A scheduling-specific modeling approach for real world scheduling. In Proceedings of the 2007 IEEE international conference on industrial engineering and engineering management (pp. 85\u201389).","DOI":"10.1109\/IEEM.2007.4419156"},{"key":"501_CR23","doi-asserted-by":"crossref","unstructured":"Grobler, J., Engelbrecht, A. P., Joubert, J. W., & Kok, S. (2007). A starting-time based-approach to production scheduling with particle swarm optimization. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling (pp. 121\u2013128).","DOI":"10.1109\/SCIS.2007.367679"},{"issue":"1","key":"501_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/70.210791","volume":"9","author":"D. J. Hoitomt","year":"1993","unstructured":"Hoitomt, D. J., Luh, P. B., & Pattipati, K. R. (1993). A practical approach to job-shop scheduling problems. IEEE Transactions on Robotics and Automation, 9(1), 1\u201313.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"3","key":"501_CR25","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0360-8352(97)00250-7","volume":"33","author":"H. Hwang","year":"1997","unstructured":"Hwang, H., & Sun, J. U. (1997). Production sequencing problem with reentrant work flows and sequence-dependent set-up times. Computers and Industrial Engineering, 33(3), 773\u2013776.","journal-title":"Computers and Industrial Engineering"},{"key":"501_CR26","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A. S. Jain","year":"1999","unstructured":"Jain, A. S., & Meeran, S. (1999). Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research, 113, 390\u2013434.","journal-title":"European Journal of Operational Research"},{"key":"501_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2004.03.025","volume":"167","author":"K. Jansen","year":"2005","unstructured":"Jansen, K., Mastrolilli, M., & Solis-Oba, R. (2005). Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research, 167, 297\u2013319.","journal-title":"European Journal of Operational Research"},{"key":"501_CR28","doi-asserted-by":"crossref","unstructured":"Jia, Z., Chen, H., & Tang, J. (2007a). An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem. In Proceedings of the 2007 IEEE international conference on grey systems and intelligent services (pp. 1587\u20131592).","DOI":"10.1109\/GSIS.2007.4443539"},{"key":"501_CR29","doi-asserted-by":"crossref","unstructured":"Jia, Z., Chen, H., & Tang, J. (2007b). A new multi-objective fully-informed particle swarm algorithm for flexible job-shop scheduling problems. In Proceedings of the 2007 international conference on computational intelligence and security workshops (pp. 191\u2013194).","DOI":"10.1109\/CISW.2007.4425477"},{"issue":"1","key":"501_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I. Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002a). Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 32(1), 1\u201313.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews"},{"key":"501_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I. Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002b). Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245\u2013276.","journal-title":"Mathematics and Computers in Simulation"},{"key":"501_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE international conference on neural networks (Vol. 4, pp. 1942\u20131948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"501_CR33","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Mendes, R. (2002). Population structure and particle performance. In Proceedings of the IEEE congress on evolutionary computation (Vol. 2, pp. 1671\u20131676).","DOI":"10.1109\/CEC.2002.1004493"},{"key":"501_CR34","volume-title":"Swarm intelligence","author":"J. Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm intelligence. San Mateo: Morgan Kaufmann."},{"key":"501_CR35","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009613717770","volume":"5","author":"C. Le Pape","year":"1999","unstructured":"Le Pape, C., & Baptiste, P. (1999). Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem. Journal of Heuristics, 5, 305\u2013325.","journal-title":"Journal of Heuristics"},{"key":"501_CR36","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"C. Lee","year":"2004","unstructured":"Lee, C. (2004). Machine scheduling with availability constraints. In J.\u00a0Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (Vol.\u00a022). London: Chapman and Hall\/CRC."},{"issue":"4","key":"501_CR37","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cie.2007.11.007","volume":"54","author":"D. Lei","year":"2008","unstructured":"Lei, D. (2008). A Pareto archive particle swarm optimization for multi-objective job shop scheduling. Computers and Industrial Engineering, 54(4), 960\u2013971.","journal-title":"Computers and Industrial Engineering"},{"key":"501_CR38","doi-asserted-by":"crossref","unstructured":"Lei, D., & Xiong, H. (2007). An efficient evolutionary algorithm for multi-objective stochastic job shop scheduling. In Proceedings of the 6th international conference on machine learning cybernetics (pp.\u00a0867\u2013872).","DOI":"10.1109\/ICMLC.2007.4370264"},{"key":"501_CR39","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"Z. Lian","year":"2006","unstructured":"Lian, Z., Jiao, B., & Gu, X. (2006a). A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation, 183, 1008\u20131017.","journal-title":"Applied Mathematics and Computation"},{"key":"501_CR40","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.amc.2005.07.042","volume":"175","author":"Z. Lian","year":"2006","unstructured":"Lian, Z., Jiao, B., & Gu, X. (2006b). A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation, 175, 773\u2013785.","journal-title":"Applied Mathematics and Computation"},{"key":"501_CR41","first-page":"630","volume-title":"Lecture notes in artificial intelligence","author":"B. Liu","year":"2005","unstructured":"Liu, B., Wang, L., & Jin, Y. (2005). Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time. In Lecture notes in artificial intelligence (pp. 630\u2013637). Berlin: Springer."},{"key":"501_CR42","first-page":"197","volume-title":"Lecture notes in computer science","author":"H. Liu","year":"2006","unstructured":"Liu, H., Abraham, A., Choi, O., & Moon, S. H. (2006). Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. In Lecture notes in computer science (pp.\u00a0197\u2013204). Berlin: Springer."},{"key":"501_CR43","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1007\/s00170-005-0277-5","volume":"31","author":"B. Liu","year":"2007","unstructured":"Liu, B., Wang, L., & Jin, Y. (2007a). An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology, 31, 1001\u20131011.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"501_CR44","doi-asserted-by":"crossref","unstructured":"Liu, H., Abraham, A., & Grosan, C. (2007b). A novel variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. In Proceedings of the 2nd international conference on digital information management (pp. 138\u2013145).","DOI":"10.1109\/ICDIM.2007.4444214"},{"key":"501_CR45","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B. Liu","year":"2008","unstructured":"Liu, B., Wang, L., & Jin, Y. (2008). An effective hybrid pso-based algorithm for flow shop scheduling with limited buffers. Computers and Operations Research, 35, 2791\u20132806.","journal-title":"Computers and Operations Research"},{"key":"501_CR46","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A. Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143, 498\u2013517.","journal-title":"European Journal of Operational Research"},{"key":"501_CR47","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","volume":"131","author":"C. Meloni","year":"2004","unstructured":"Meloni, C., Pacciarelli, D., & Pranzo, M. (2004). A rollout metaheuristic for job shop scheduling problems. Annals of Operations Research, 131, 215\u2013235.","journal-title":"Annals of Operations Research"},{"key":"501_CR48","doi-asserted-by":"crossref","unstructured":"Nakamura, M., Tome, H., Hachiman, K., Ombuki, B. M., & Onaga, K. (2000). Cyclic job-shop-scheduling based on evolutionary petri nets. In Proceedings of the 26th annual conference of the IEEE industrial electronics society (pp. 2855\u20132860).","DOI":"10.1109\/IECON.2000.972451"},{"key":"501_CR49","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s00170-005-0258-8","volume":"31","author":"K. Natarajan","year":"2007","unstructured":"Natarajan, K., Mohanasundaram, K. M., Shoban Babu, B., Suresh, S., Antony Arokia Durai Raj, K., & Rajendran, C. (2007). Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. International Journal of Advanced Manufacturing Technology, 31, 751\u2013761.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"501_CR50","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-L","volume":"46","author":"B. A. Norman","year":"1999","unstructured":"Norman, B. A., & Bean, J. C. (1999). A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics, 46(2), 199\u2013211.","journal-title":"Naval Research Logistics"},{"key":"501_CR51","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W. P. M. Nuijtne","year":"1996","unstructured":"Nuijtne, W. P. M., & Aarts, E. H. L. (1996). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research, 90, 269\u2013284.","journal-title":"European Journal of Operational Research"},{"key":"501_CR52","first-page":"460","volume-title":"Lecture notes in computer science","author":"Q. Pan","year":"2006","unstructured":"Pan, Q., Tasgetiren, M. F., & Liang, Y. (2006). Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm. In Lecture notes in computer science (pp. 460\u2013467). Berlin: Springer."},{"issue":"7\u20138","key":"501_CR53","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/s00170-007-1252-0","volume":"39","author":"Q. Pan","year":"2008","unstructured":"Pan, Q., & Wang, L. (2008). No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 39(7\u20138), 796\u2013807.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"3\u20134","key":"501_CR54","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00170-007-1099-4","volume":"38","author":"Q. Pan","year":"2008","unstructured":"Pan, Q., Wang, L., Tasgetiren, M. F., & Zhao, B. H. (2008). A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology, 38(3\u20134), 337\u2013347.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"501_CR55","unstructured":"Petrovic, S., Carole, F., & Petrovic, D. (2005). Job shop scheduling with lot-sizing and batching in an uncertain real-world environment. In Proceedings of the 2nd multidisciplinary international conference on scheduling (pp. 363\u2013379)."},{"key":"501_CR56","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C. N. Potts","year":"2000","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228\u2013249.","journal-title":"European Journal of Operational Research"},{"key":"501_CR57","unstructured":"Potts, C. N., Strusevich, V. A., & Tautenhahn, T. (1998). Scheduling batches with simultaneous job processing for two-machine shop problems (Technical report). University of Southampton."},{"issue":"8","key":"501_CR58","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s001700070052","volume":"16","author":"J. G. Qi","year":"2000","unstructured":"Qi, J. G., Burns, G. R., & Harrison, D. K. (2000). The application of parallel multipopulation genetic algorithms to dynamic job-shop scheduling. The International Journal of Advanced Manufacturing Technology, 16(8), 609\u2013615.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"501_CR59","doi-asserted-by":"crossref","unstructured":"Schuster, C. J., & Framinan, J. M. (2003). Approximative procedures for no-wait job shop scheduling. Operations Research Letters, 31, 308\u2013318.","DOI":"10.1016\/S0167-6377(03)00005-1"},{"key":"501_CR60","doi-asserted-by":"crossref","unstructured":"Sha, D. Y., & Hsu, C. (2006). A hybrid particle swarm optimization for job shop scheduling problem. Computers and Industrial Engineering, 51, 791\u2013808.","DOI":"10.1016\/j.cie.2006.09.002"},{"issue":"15","key":"501_CR61","doi-asserted-by":"crossref","first-page":"3623","DOI":"10.1080\/002075400422824","volume":"38","author":"M. Singer","year":"2000","unstructured":"Singer, M. (2000). Forecasting policies for scheduling a stochastic due date job shop. International Journal of Production Research, 38(15), 3623\u20133637.","journal-title":"International Journal of Production Research"},{"key":"501_CR62","first-page":"109","volume":"30","author":"M. Singer","year":"1998","unstructured":"Singer, M., & Pinedo, M. (1998). A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Transactions, 30, 109\u2013118.","journal-title":"IIE Transactions"},{"key":"501_CR63","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R. Storn","year":"1997","unstructured":"Storn, R., & Price, K. (1997). Differential evolution \u2014 a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11, 341\u2013359.","journal-title":"Journal of Global Optimization"},{"key":"501_CR64","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"M.F. Tasgetiren","year":"2007","unstructured":"Tasgetiren, M.F., Sevkli, M., Liang, Y. & Gencyilmaz (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177, 1930\u20131947.","journal-title":"European Journal of Operational Research"},{"key":"501_CR65","doi-asserted-by":"crossref","unstructured":"Van den Bergh, F., & Engelbrecht, A.P. (2002). A new locally convergent particle swarm optimiser. In Proceedings of the IEEE international conference on systems, man and cybernetics (Vol. 3, pp.\u00a06\u201312).","DOI":"10.1109\/ICSMC.2002.1176018"},{"key":"501_CR66","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(98)80001-5","volume":"106","author":"M. G. A. Verhoeven","year":"1998","unstructured":"Verhoeven, M. G. A. (1998). Tabu search for resource-constrained scheduling. European Journal of Operational Research, 106, 266\u2013276.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"501_CR67","first-page":"245","volume":"5","author":"J. H. Weng","year":"2003","unstructured":"Weng, J. H., Hiroki, O., & Hisashi, O. (2003). An integrated algorithm based on tabu search for flexible assembly job-shop scheduling. Journal of Japan Industrial Management Association, 5(4), 245\u2013252.","journal-title":"Journal of Japan Industrial Management Association"},{"key":"501_CR68","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W. Xia","year":"2005","unstructured":"Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering, 48, 409\u2013425.","journal-title":"Computers and Industrial Engineering"},{"key":"501_CR69","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/s00170-005-2513-4","volume":"29","author":"W. Xia","year":"2006","unstructured":"Xia, W., & Wu, Z. (2006). A hybrid particle swarm optimization approach for the job-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 29, 360\u2013366.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"501_CR70","unstructured":"Xia, W., Wu, Z., & Yang, G. (2004). A new hybrid optimization algorithm for the job-shop scheduling problem. In Proceedings of the 2004 American control conference (pp. 5552\u20135557)."},{"key":"501_CR71","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1111\/1475-3995.00429","volume":"10","author":"Y. Yoshitomi","year":"2003","unstructured":"Yoshitomi, Y., & Yamaguchi, R. (2003). A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling. International Transactions in Operations Research, 10, 577\u2013596.","journal-title":"International Transactions in Operations Research"},{"key":"501_CR72","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0360-8352(01)00010-9","volume":"39","author":"H. Yu","year":"2001","unstructured":"Yu, H., & Liang, W. (2001). Neural network and genetic algorithm-based approach to expanded job-shop scheduling. Computers and Industrial Engineering, 39, 337\u2013356.","journal-title":"Computers and Industrial Engineering"},{"key":"501_CR73","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0360-8352(02)00130-4","volume":"43","author":"S. Y. Yun","year":"2002","unstructured":"Yun, S. Y. (2002). Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems. Computers and Industrial Engineering, 43, 623\u2013644.","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"501_CR74","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.amc.2005.11.136","volume":"180","author":"M. Zandieh","year":"2006","unstructured":"Zandieh, M., Ghomi, S. M. T. F., & Husseini, S. M. M. (2006). An immune algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180(1), 111\u2013127.","journal-title":"Applied Mathematics and Computation"},{"key":"501_CR75","doi-asserted-by":"crossref","unstructured":"Zhao, F., Hong, Y., & Yu, D. (2005). A hybrid approach based on artificial neural network and genetic algorithm for job-shop scheduling problem. In Proceedings of the 2005 international conference on neural networks and brain (pp. 1687\u20131692).","DOI":"10.1109\/ICNNB.2005.1614954"},{"key":"501_CR76","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00170-005-0022-0","volume":"30","author":"Y. Zhou","year":"2006","unstructured":"Zhou, Y., Li, B., & Yang, J. (2006). Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. International Journal of Advanced Manufacturing Technology, 30, 105\u2013111.","journal-title":"International Journal of Advanced Manufacturing Technology"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0501-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0501-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0501-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T22:19:45Z","timestamp":1738880385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0501-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,10]]},"references-count":76,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0501-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,10]]}}}