{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:06:36Z","timestamp":1762430796408},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037523"},{"type":"electronic","value":"9783319037530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03753-0_3","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T19:16:54Z","timestamp":1386875814000},"page":"24-34","source":"Crossref","is-referenced-by-count":11,"title":["A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"M. Fatih","family":"Tasgetiren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozge","family":"Buyukdagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ponnuthurai Nagaratnam","family":"Suganthan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I. Adiri","year":"1982","unstructured":"Adiri, I., Pohoryles, D.: Flow-shop\/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly\u00a029(3), 495\u2013504 (1982)","journal-title":"Naval Research Logistics Quarterly"},{"key":"3_CR2","unstructured":"Baptiste, P., Lee, K.H.: A branch and bound algorithm for the F|no-idle|Cmax. In: Lyon\u00a0: Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM), vol.\u00a01, pp. 429\u2013438 (1997)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/S0360-8352(02)00217-6","volume":"44","author":"H. Saadani","year":"2003","unstructured":"Saadani, H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers and Industrial Engineering\u00a044, 425\u2013434 (2003)","journal-title":"Computers and Industrial Engineering"},{"key":"3_CR4","first-page":"321","volume-title":"Handbook of Metaheuristics, International Series in Operations Research & Management Science","author":"H.R. Lourenc","year":"2002","unstructured":"Lourenc, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. G. K. F. Glover i\u00e7inde. In: Handbook of Metaheuristics, International Series in Operations Research & Management Science, Cilt 57, pp. s. 321\u2013s. 353. Kluwer Academic Publishers, Norwell (2002)"},{"issue":"10","key":"3_CR5","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P. Hansen","year":"2006","unstructured":"Hansen, P., Mladenovic, N., Urosevic, D.: Variable neighborhood search and the local search and local branching. Computers & Operations Research\u00a033(10), 3034\u20133045 (2006)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ejor.2006.01.036","volume":"178","author":"P.J. Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research\u00a0178(3), 677\u2013685 (2007)","journal-title":"European Journal of Operational Research"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","volume":"39","author":"G. Kirlik","year":"2012","unstructured":"Kirlik, G., Oguz, C.: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers & Operations Research\u00a039, 1506\u20131520 (2012)","journal-title":"Computers & Operations Research"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, njob flow-shop sequencing problem. OMEGA, The International Journal of Management Science\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA, The International Journal of Management Science"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1504\/EJIE.2008.017687","volume":"2","author":"Q.-K. Pan","year":"2008","unstructured":"Pan, Q.-K., Wang, L.: A novel differential evolution algorithm for no-idle permutation flowshop scheduling problems. European Journal of Industrial Engineering\u00a02(3), 279\u2013297 (2008)","journal-title":"European Journal of Industrial Engineering"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-02836-6_2","volume":"230","author":"R. Ruiz","year":"2009","unstructured":"Ruiz, R., Vallada, E., Fern\u00e1ndez-Mart\u00ednez, C.: Scheduling in Flowshops with No-Idle Machines. Computational Intelligence in Flow Shop and Job Shop Scheduling Studies in Computational Intelligence\u00a0230, 21\u201351 (2009)","journal-title":"Computational Intelligence in Flow Shop and Job Shop Scheduling Studies in Computational Intelligence"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Tasgetiren, M.F., Pan, Q., Suganthan, P.N., Oner, A.: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling (2013)","DOI":"10.1016\/j.apm.2013.02.011"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0360-8352(82)90004-3","volume":"6","author":"P.. Vachajitpan","year":"1982","unstructured":"Vachajitpan, P.: Job sequencing with continuous machine operation. Computers and Industrial Engineering\u00a06(3), 255\u2013259 (1982)","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0360-8352(86)90028-8","volume":"10","author":"C.R.. Woollam","year":"1986","unstructured":"Woollam, C.R.: Flowshop with no idle machine time allowed. Computers and Industrial Engineering\u00a010(1), 69\u201376 (1986)","journal-title":"Computers and Industrial Engineering"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"M.F. Tasgetiren","year":"2013","unstructured":"Tasgetiren, M.F., Pan, Q., Suganthan, P.N., Buyukdagli, O.: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Computers & Operations Research\u00a040, 1729\u20131743 (2013)","journal-title":"Computers & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03753-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T11:51:36Z","timestamp":1558785096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03753-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037523","9783319037530"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03753-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}