{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:11:38Z","timestamp":1762866698334,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00500-015-1852-9","type":"journal-article","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T03:38:54Z","timestamp":1440992334000},"page":"1193-1202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0892","authenticated-orcid":false,"given":"Shyam","family":"Sundar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. N.","family":"Suganthan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chua Tay","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai Tian","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong Chin","family":"Soon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,1]]},"reference":[{"key":"1852_CR1","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library: distribution test problems by electronic mail. J Oper Res Soc 41:1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"1852_CR2","unstructured":"Birattari M (2005) Tuning metaheuristics: a machine learning perspective. Springer, Berlin"},{"key":"1852_CR3","doi-asserted-by":"crossref","unstructured":"Bo\u017cejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56:1502\u20131509","DOI":"10.1016\/j.cie.2008.09.023"},{"key":"1852_CR4","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s00170-011-3297-3","volume":"57","author":"W Bo\u017cejko","year":"2011","unstructured":"Bo\u017cejko W, Makuchowski M (2011) Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment. Int J Adv Manuf Technol 57:735\u2013752","journal-title":"Int J Adv Manuf Technol"},{"key":"1852_CR5","doi-asserted-by":"crossref","unstructured":"Brizuela CA, Zhao Y, Sannomiya N (2001) No-wait and blocking job-shops: Challenging problems for GA\u2019s. In: IEEE international conference on systems, man, and cybernetics. IEEE, New York, pp 2349\u20132354","DOI":"10.1109\/ICSMC.2001.972908"},{"key":"1852_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/64.482954","volume":"11","author":"J Dorn","year":"1996","unstructured":"Dorn J, Shams R (1996) Scheduling high-grade steelmaking. IEEE Exp 11:28\u201335","journal-title":"IEEE Exp"},{"key":"1852_CR7","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1016\/j.cor.2004.09.009","volume":"331","author":"JM Framinan","year":"2006","unstructured":"Framinan JM, Schuster CJ (2006) An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput Oper Res 331:1200\u20131213","journal-title":"Comput Oper Res"},{"key":"1852_CR8","doi-asserted-by":"crossref","unstructured":"Grabowski J, Pempera J, Smutnicki C (1997) Scheduling in production of concrete wares. In: Operations research proceedings 1996. Springer, Berlin, pp 192\u2013196","DOI":"10.1007\/978-3-642-60744-8_35"},{"key":"1852_CR9","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N Hall","year":"1996","unstructured":"Hall N, Sriskandarajah C (1996) A survey on machine scheduling problems with blocking and no-wait in process. Oper Res 44:510\u2013525","journal-title":"Oper Res"},{"key":"1852_CR10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/0377-2217(93)90247-K","volume":"70","author":"H Kamoun","year":"1993","unstructured":"Kamoun H, Sriskandarajah C (1993) The complexity of scheduling jobs in repetitive manufacturing systems. Eur J Oper Res 70:350\u2013364","journal-title":"Eur J Oper Res"},{"key":"1852_CR11","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, technical report\u2014tr06. Erciyes University, Turkey"},{"issue":"1","key":"1852_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"key":"1852_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(89)90225-7","volume":"43","author":"W Kubiak","year":"1989","unstructured":"Kubiak W (1989) A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem. Eur J Oper Res 43:267\u2013270","journal-title":"Eur J Oper Res"},{"key":"1852_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AHGR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343\u2013362","journal-title":"Ann Discrete Math"},{"key":"1852_CR15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(99)00041-7","volume":"120","author":"T Lixin","year":"2000","unstructured":"Lixin T, Liu J, Rong A, Yang Z (2000) A mathematical programming model for scheduling steelmaking-continuous casting production. Eur J Oper Res 120:423\u2013435","journal-title":"Eur J Oper Res"},{"key":"1852_CR16","unstructured":"Macchiaroli R, Mol\u00e8 S, Riemma S, Trifiletti L (1996) Design and implementation of a tabu search algorithm to solve the no-wait job-shop scheduling problem. In: Proceeding of the CESA96, pp 467\u2013472"},{"key":"1852_CR17","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. Eur J Oper Res 143:498\u2013517","journal-title":"Eur J Oper Res"},{"key":"1852_CR18","doi-asserted-by":"crossref","first-page":"5800","DOI":"10.1016\/j.eswa.2008.07.005","volume":"36","author":"JC-H Pan","year":"2009","unstructured":"Pan JC-H, Huang H-C (2009) A hybrid genetic algorithm for no-wait job shop scheduling problems. Exp Syst Appl 36:5800\u20135806","journal-title":"Exp Syst Appl"},{"key":"1852_CR19","first-page":"28072839","volume":"35","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren M, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:28072839","journal-title":"Comput Oper Res"},{"key":"1852_CR20","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Tasgetiren M, Suganthan P, Chua T (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455\u20132468","journal-title":"Inf Sci"},{"key":"1852_CR21","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice-Hall, NJ"},{"key":"1852_CR22","first-page":"119","volume":"78","author":"G Reklaitis","year":"1982","unstructured":"Reklaitis G (1982) Review of scheduling of process operations. AIChE Symp Ser 78:119\u2013133","journal-title":"AIChE Symp Ser"},{"key":"1852_CR23","doi-asserted-by":"crossref","unstructured":"Ridge E, Kudenko D (2010) Tuning an algorithm using design of experiments. In: Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M (ed) Experimental methods for the analysis of optimization algorithms. Springer, Berlin, pp 265\u2013286","DOI":"10.1007\/978-3-642-02538-9_11"},{"key":"1852_CR24","unstructured":"Roy B, Sussmann B (1964) Les probl\u00e8mes d\u2019ordonnancement avec constraintes disjonctives. SEMA, Note D.S., No. 9, Paris"},{"key":"1852_CR25","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/moor.4.4.448","volume":"4","author":"S Sahni","year":"1979","unstructured":"Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Math Oper Res 4:448\u2013457","journal-title":"Math Oper Res"},{"key":"1852_CR26","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s00186-005-0056-y","volume":"63","author":"CJ Schuster","year":"2006","unstructured":"Schuster CJ (2006) No-wait job shop scheduling: Tabu search and complexity of subproblems. Math Meth Oper Res 63:473\u2013491","journal-title":"Math Meth Oper Res"},{"key":"1852_CR27","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0167-6377(03)00005-1","volume":"31","author":"CJ Schuster","year":"2003","unstructured":"Schuster CJ, Framinan J (2003) Approximate procedures for no-wait job shop scheduling. Oper Res Lett 31:308\u2013318","journal-title":"Oper Res Lett"},{"key":"1852_CR28","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625\u2013631","journal-title":"Appl Soft Comput"},{"key":"1852_CR29","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1142\/S021759591000296X","volume":"27","author":"A Singh","year":"2010","unstructured":"Singh A (2010) A hybrid permutation-coded evolutionary algorithm for the early\/tardy scheduling problem. Asia-Pac J Oper Res 27:713\u2013725","journal-title":"Asia-Pac J Oper Res"},{"key":"1852_CR30","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C Sriskandarajah","year":"1986","unstructured":"Sriskandarajah C, Ladet P (1986) Some no-wait shops scheduling problems: complexity aspects. Eur J Oper Res 24:424\u2013438","journal-title":"Eur J Oper Res"},{"key":"1852_CR31","doi-asserted-by":"crossref","unstructured":"Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic multiple knapsack problem. In: ICONIP 2010. Lecture notes in computer science, vol 6443. Springer, Berlin, pp 626\u2013633","DOI":"10.1007\/978-3-642-17537-4_76"},{"key":"1852_CR32","doi-asserted-by":"crossref","unstructured":"Sundar S, Singh A (2012) A swarm intelligence approach to the early\/tardy scheduling problem. Swarm Evol Computat 4:25\u201332","DOI":"10.1016\/j.swevo.2011.12.002"},{"key":"1852_CR33","doi-asserted-by":"crossref","unstructured":"Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, New York","DOI":"10.1002\/9780470496916"},{"key":"1852_CR34","doi-asserted-by":"crossref","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"M Tasgetiren","year":"2011","unstructured":"Tasgetiren M, Pan Q-K, Suganthan P, Chen AH-L (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf Sci 181:3459\u20133475","journal-title":"Inf Sci"},{"key":"1852_CR35","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1142\/S0217595906000978","volume":"23","author":"J Valente","year":"2006","unstructured":"Valente J, Gon\u00e7alves J, Alves R (2006) A hybrid genetic algorithm for the early\/tardy scheduling problem. Asia-Pac J Oper Res 23:393\u2013405","journal-title":"Asia-Pac J Oper Res"},{"key":"1852_CR36","first-page":"189","volume":"9","author":"J Zhu","year":"2012","unstructured":"Zhu J, Li X (2012) An effective meta-heuristic for no-wait job shops to minimize makespan. IEEE Trans Autom Sci Eng 9:189\u2013198","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1852_CR37","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.ejor.2008.09.015","volume":"198","author":"J Zhu","year":"2009","unstructured":"Zhu J, Li X, Wang Q (2009) Complete local search with limited memory algorithm for no-wait job shops to minimize makespan. Eur J Oper Res 198:378\u2013386","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1852-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1852-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1852-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1852-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:51Z","timestamp":1559079831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1852-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1852"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1852-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}