{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:01Z","timestamp":1759847521496},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386091"},{"type":"electronic","value":"9783642386107"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38610-7_54","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:25:06Z","timestamp":1370309106000},"page":"593-602","source":"Crossref","is-referenced-by-count":7,"title":["A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing"],"prefix":"10.1007","author":[{"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":"T. J.","family":"Chua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The Complexity of Flow Shop and Job-shop Scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"54_CR2","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\u00a045, 369\u2013375 (1990)","journal-title":"Computing"},{"key":"54_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. Annals of Operations Research\u00a041, 157\u2013183 (1993)","journal-title":"Annals of Operations Research"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M. Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective Neighborhood Functions for the Flexible Job Shop Problem. Journal of Scheduling\u00a03, 3\u201320 (2000)","journal-title":"Journal of Scheduling"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A Hybrid Genetic and Variable Neighborhood Descent Algorithm for Flexible Job Shop Scheduling Problems. Computers & Operations Research\u00a035, 2892\u20132907 (2008)","journal-title":"Computers & Operations Research"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics\u00a01, 343\u2013362 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/moor.4.4.448","volume":"4","author":"S. Sahni","year":"1979","unstructured":"Sahni, S., Cho, Y.: Complexity of Scheduling Shops with No Wait in Process. Mathematics of Operations Research\u00a04, 448\u2013457 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/0377-2217(93)90247-K","volume":"70","author":"H. Kamoun","year":"1993","unstructured":"Kamoun, H., Sriskandarajah, C.: The Complexity of Scheduling Jobs in Repetitive Manufacturing Systems. European Journal of Operational Research\u00a070, 350\u2013364 (1993)","journal-title":"European Journal of Operational Research"},{"key":"54_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.J. Hall","year":"1996","unstructured":"Hall, N.J., Sriskandarajah, C.: A Survey on Machine Scheduling Problems with Blocking and No-wait in Process. Operations Research\u00a044, 510\u2013525 (1996)","journal-title":"Operations Research"},{"key":"54_CR10","first-page":"189","volume":"9","author":"J. Zhu","year":"2012","unstructured":"Zhu, J., Li, X.: An Effective Meta-heuristic for No-wait Job Shops to Minimize Makespan. IEEE Transactions on Automation Science and Engineering\u00a09, 189\u2013198 (2012)","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"54_CR11","unstructured":"Karaboga, D.: An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report - TR06, Computer Engineering Department, Erciyes University, Turkey (2005)"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A. Singh","year":"2009","unstructured":"Singh, A.: An Artificial Bee Colony Algorithm for the Leaf-Constrained Minimum Spanning Tree Problem. Applied Soft Computing\u00a09, 625\u2013631 (2009)","journal-title":"Applied Soft Computing"},{"key":"54_CR13","doi-asserted-by":"publisher","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.F., Suganthan, P.N., Chua, T.J.: A Discrete Artificial Bee Colony Algorithm for the Lot-Streaming Flow Shop Scheduling Problem. Information Sciences\u00a0181, 2455\u20132468 (2011)","journal-title":"Information Sciences"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"3182","DOI":"10.1016\/j.ins.2010.05.001","volume":"180","author":"S. Sundar","year":"2010","unstructured":"Sundar, S., Singh, A.: A Swarm Intelligence Approach to the Quadratic Minimum Spanning Tree Problem. Information Sciences\u00a0180, 3182\u20133191 (2010)","journal-title":"Information Sciences"},{"key":"54_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-17537-4_76","volume-title":"Neural Information Processing. Theory and Algorithms","author":"S. Sundar","year":"2010","unstructured":"Sundar, S., Singh, A.: A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds.) ICONIP 2010, Part I. LNCS, vol.\u00a06443, pp. 626\u2013633. Springer, Heidelberg (2010)"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A Comprehensive Survey: Artificial Bee Colony (ABC) Algorithm and Applications. Artificial Intelligence Review (2012), doi:10.1007\/s10462-012-9328-0","DOI":"10.1007\/s10462-012-9328-0"},{"key":"54_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.swevo.2011.12.002","volume":"4","author":"S. Sundar","year":"2012","unstructured":"Sundar, S., Singh, A.: A Swarm Intelligence Approach to the Early\/Tardy Scheduling Problem. Swarm and Evolutionary Computation\u00a04, 25\u201332 (2012)","journal-title":"Swarm and Evolutionary Computation"},{"key":"54_CR18","unstructured":"Brizuela, C.A., Zhao, Y., Sannomiya, N.: No-wait and Blocking Job-shops: Challenging Problems for GA\u2019s. In: Proceeding of IEEE International Conference on Systems, Man, and Cybernetics, pp. 2349\u20132354 (2001)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38610-7_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:11:17Z","timestamp":1557767477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38610-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386091","9783642386107"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38610-7_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}