{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:53:48Z","timestamp":1770969228691,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319534794","type":"print"},{"value":"9783319534800","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53480-0_94","type":"book-chapter","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T05:12:19Z","timestamp":1487740339000},"page":"955-964","source":"Crossref","is-referenced-by-count":5,"title":["A General VNS Heuristic for a Three-Stage Assembly Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Saulo C.","family":"Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Elas C.","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo G.","family":"Tavares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"issue":"3","key":"94_CR1","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz, R., St\u00fctzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3), 1143\u20131159 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"94_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15(3), 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"issue":"9\u201312","key":"94_CR3","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1007\/s00170-010-2579-5","volume":"50","author":"S Hatami","year":"2010","unstructured":"Hatami, S., Ebrahimnejad, S., Tavakkoli-Moghaddam, R., Maboudian, Y.: Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. Int. J. Adv. Manuf. Technol. 50(9\u201312), 1153\u20131164 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"94_CR4","unstructured":"Andr\u00e9s, C., Hatami, S.: The three stage assembly permutation flow shop scheduling problem. In: V International Conference on Industrial Engineering and Industrial Management, pp. 867\u2013875 (2011)"},{"issue":"1","key":"94_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2251-712X-8-26","volume":"8","author":"A Maleki-Darounkolaei","year":"2012","unstructured":"Maleki-Darounkolaei, A., Modiri, M., Tavakkoli-Moghaddam, R., Seyyedi, I.: A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times. J. Indust. Eng. Int. 8(1), 1\u20137 (2012)","journal-title":"J. Indust. Eng. Int."},{"key":"94_CR6","first-page":"1","volume":"26","author":"A Allahverdi","year":"2013","unstructured":"Allahverdi, A., Aydilek, H.: The two stage assembly flow shop scheduling problem to minimize total tardiness. J. Intell. Manuf. 26, 1\u201313 (2013)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"94_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008)","journal-title":"4OR"},{"issue":"3","key":"94_CR8","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"94_CR9","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.D.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53480-0_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:07:07Z","timestamp":1498374427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53480-0_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319534794","9783319534800"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53480-0_94","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}