{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:24:09Z","timestamp":1753885449406,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319282695"},{"type":"electronic","value":"9783319282701"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28270-1_19","type":"book-chapter","created":{"date-parts":[[2016,1,22]],"date-time":"2016-01-22T07:59:41Z","timestamp":1453449581000},"page":"221-233","source":"Crossref","is-referenced-by-count":5,"title":["A Hybrid Imperialist Competitive Algorithm for the Flexible Job Shop Problem"],"prefix":"10.1007","author":[{"given":"Behrooz","family":"Ghasemishabankareh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasser","family":"Shahsavari-Pour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad-Ali","family":"Basiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,23]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Gary","year":"1976","unstructured":"Gary, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","volume":"23","author":"A Rossi","year":"2007","unstructured":"Rossi, A., Dini, G.: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method. Robot. Comput. Integr. Manuf. 23(5), 503\u2013516 (2007)","journal-title":"Robot. Comput. Integr. Manuf."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"issue":"1","key":"19_CR5","first-page":"1","volume":"2","author":"R Thamilselvan","year":"2009","unstructured":"Thamilselvan, R., Balasubramanie, P.: Integrating genetic algorithm, tabu search approach for job shop scheduling. Int. J. Comput. Sci. Inf. Secur. 2(1), 1\u20136 (2009)","journal-title":"Int. J. Comput. Sci. Inf. Secur."},{"doi-asserted-by":"crossref","unstructured":"Najid, N.M., Dauzere-Peres, S., Zaidat, A.: A modified simulated annealing method for flexible job shop scheduling problem. In: 2002 IEEE International Conference on Systems, Man and Cybernetics, vol. 5 (2002)","key":"19_CR6","DOI":"10.1109\/ICSMC.2002.1176334"},{"key":"19_CR7","first-page":"39","volume":"34","author":"A Colorni","year":"1994","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant system for job-shop scheduling. Belg. J. Oper. Res. Statist. Comput. Sci. 34, 39\u201354 (1994)","journal-title":"Belg. J. Oper. Res. Statist. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Chen, H., Ihlow, J., Lehmann, C.: A genetic algorithm for flexible job-shop scheduling. In: Proceeding of IEEE International Conference on Robotics, pp. 1120\u20131125 (1999)","key":"19_CR8","DOI":"10.1109\/ROBOT.1999.772512"},{"doi-asserted-by":"crossref","unstructured":"Atashpaz-Garagari, E., Lucas, C.: Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, pp. 4661\u20134667 (2007)","key":"19_CR9","DOI":"10.1109\/CEC.2007.4425083"},{"issue":"1\u20132","key":"19_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1504\/IJBIC.2009.022781","volume":"1","author":"A Khabbazi","year":"2009","unstructured":"Khabbazi, A., Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm for minimum bit error rate beam forming. Int. J. Bio-Inspired Comput. 1(1\u20132), 125\u2013133 (2009)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"12","key":"19_CR11","doi-asserted-by":"publisher","first-page":"7615","DOI":"10.1016\/j.eswa.2010.04.081","volume":"37","author":"S Nazari-Shirkouhi","year":"2010","unstructured":"Nazari-Shirkouhi, S., Eivazy, H., Ghods, R., Rezaie, K., Atashpaz-Gargari, E.: Solving the integrated product mix-outsourcing problem using the imperialist competitive algorithm. Expert Syst. Appl. 37(12), 7615\u20137626 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"7","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1016\/j.enconman.2010.01.014","volume":"51","author":"C Lucas","year":"2010","unstructured":"Lucas, C., Nasiri-Gheidari, Z., Tootoonchian, F.: Application of an imperialist competitive algorithm to the design of a linear induction motor. Energy Convers. Manag. 51(7), 1407\u20131411 (2010)","journal-title":"Energy Convers. Manag."},{"issue":"21\u201322","key":"19_CR13","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1016\/j.compstruc.2010.06.011","volume":"88","author":"A Kaveh","year":"2010","unstructured":"Kaveh, A., Talatahari, S.: Optimum design of skeletal structures using imperialist competitive algorithm. Comput. Struct. 88(21\u201322), 1220\u20131229 (2010)","journal-title":"Comput. Struct."},{"issue":"11","key":"19_CR14","doi-asserted-by":"publisher","first-page":"3087","DOI":"10.1080\/00207540903536155","volume":"49","author":"E Shokrollahpour","year":"2011","unstructured":"Shokrollahpour, E., Zandieh, M., Dorri, B.: A novel\u00a0imperialist competitive algorithm for bi-criteria scheduling of the assembly flow shop problem. Int. J. Prod. Res. 49(11), 3087\u20133103 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"10","key":"19_CR15","first-page":"27","volume":"28","author":"SF Attar","year":"2011","unstructured":"Attar, S.F., Mohammadi, M., Tavakkoli-moghaddam, R.: A novel imperialist competitive algorithm to solve flexible flow shop scheduling problem in order to minimize maximum completion time. Int. J. Comput. Appl. 28(10), 27\u201332 (2011)","journal-title":"Int. J. Comput. Appl."},{"issue":"10","key":"19_CR16","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s00500-008-0367-z","volume":"13","author":"R Tavakkoli-Moghaddam","year":"2009","unstructured":"Tavakkoli-Moghaddam, R., Khalili, M., Naderi, B.: A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft. Comput. 13(10), 995\u20131006 (2009)","journal-title":"Soft. Comput."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.knosys.2009.06.002","volume":"23","author":"B Naderi","year":"2010","unstructured":"Naderi, B., Tavakkoli-Moghaddam, R., Khalili, M.: Electromagnetism-like mechanism and simulated annealing algorithms for flow shop scheduling problems minimizing the total weighted tardiness and makespan. Knowl. Based Syst. 23(2), 77\u201385 (2010)","journal-title":"Knowl. Based Syst."},{"issue":"5","key":"19_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.engappai.2005.12.003","volume":"19","author":"A Soke","year":"2006","unstructured":"Soke, A., Bingul, Z.: Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems. Eng. Appl. Artif. Intel. 19(5), 557\u2013567 (2006)","journal-title":"Eng. Appl. Artif. Intel."},{"issue":"8","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1080\/00207540110119991","volume":"40","author":"WD Li","year":"2002","unstructured":"Li, W.D., Ong, S.K., Nee, A.Y.C.: Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int. J. Prod. Res. 40(8), 1899\u20131922 (2002)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"19_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"IH Osman","year":"1994","unstructured":"Osman, I.H., Christofides, N.: Capacitated clustering problems by hybrid simulated annealing and tabu search. Int. Trans. Oper. Res. 1(3), 317\u2013336 (1994)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.rcim.2003.09.001","volume":"20","author":"R Swarnkar","year":"2004","unstructured":"Swarnkar, R., Tiwari, M.K.: Modeling machine loading problem of FMSs and its solution methodology using a\u00a0hybrid tabu search and simulated annealing-based heuristic approach. Robot. Comput. Integr. Manuf. 20(3), 199\u2013209 (2004)","journal-title":"Robot. Comput. Integr. Manuf."},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian, J., Zandieh, M., Fatemi Ghomi, S.M.T.: Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert. Syst. Appl. 36(6), 9637\u20139644 (2009)","journal-title":"Expert. Syst. Appl."},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/j.jmsy.2013.04.015","volume":"32","author":"N Shahsavari-pour","year":"2013","unstructured":"Shahsavari-pour, N., Ghasemishabankareh, B.: A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling. J. Manuf. syst. 32(4), 771\u2013780 (2013)","journal-title":"J. Manuf. syst."},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"GH Zhang","year":"2009","unstructured":"Zhang, G.H., Shao, X.Y., Li, P.G., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job shop scheduling problem. Comput. Ind. Eng. 56(4), 1309\u20131318 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR25","volume-title":"Adaptation in Natural and Artificial Systems","author":"J Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"issue":"3\u20135","key":"19_CR26","doi-asserted-by":"publisher","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.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3\u20135), 245\u2013276 (2002)","journal-title":"Math. Comput. Simul."},{"key":"19_CR27","volume-title":"Introduction to Quality Engineering","author":"G Taguchi","year":"1986","unstructured":"Taguchi, G.: Introduction to Quality Engineering. Asian Productivity Organization\/UNIPUB, White Plains (1986)"},{"key":"19_CR28","volume-title":"Quality Engineering Using Robust Design","author":"MS Phadke","year":"1986","unstructured":"Phadke, M.S.: Quality Engineering Using Robust Design. Prentice-Hall, New Jersey (1986)"},{"issue":"8","key":"19_CR29","doi-asserted-by":"publisher","first-page":"10462","DOI":"10.1016\/j.eswa.2011.02.093","volume":"38","author":"S Molla-Alizadeh-Zavardehi","year":"2011","unstructured":"Molla-Alizadeh-Zavardehi, S., Hajiaghaei-Keshteli, M., Tavakoli-Moghaddam, R.: Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Pr\u00fcfer number representation. Expert Syst. Appl. 38(8), 10462\u201310474 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.cie.2010.04.007","volume":"59","author":"M Hajiaghaei-Keshteli","year":"2010","unstructured":"Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., Tavakoli-Mogaddam, R.: Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput. Ind. Eng. 59(2), 259\u2013271 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"13","key":"19_CR31","doi-asserted-by":"publisher","first-page":"14490","DOI":"10.1016\/j.eswa.2011.04.241","volume":"38","author":"J Behnamian","year":"2011","unstructured":"Behnamian, J., Zandieh, M.: A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst. Appl. 38(13), 14490\u201314498 (2011)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Artificial Life and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28270-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T06:15:11Z","timestamp":1748758511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28270-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319282695","9783319282701"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28270-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}