{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T06:03:35Z","timestamp":1773122615608,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,6,13]],"date-time":"2008-06-13T00:00:00Z","timestamp":1213315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10100-008-0066-y","type":"journal-article","created":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T17:25:11Z","timestamp":1213291511000},"page":"379-390","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic algorithms for a complex parallel machine scheduling problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Zolt\u00e1n","family":"Bl\u00e1zsik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csan\u00e1d","family":"Imreh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,13]]},"reference":[{"issue":"3","key":"66_CR1","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"178","author":"N Azi","year":"2007","unstructured":"Azi N, Gendreau M, Potvin JV (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3): 755\u2013766","journal-title":"Eur J Oper Res"},{"issue":"3","key":"66_CR2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0377-2217(03)00378-3","volume":"158","author":"P Baptiste","year":"2004","unstructured":"Baptiste P, Carlier J, Jouglet A (2004) A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur J Oper Res 158(3): 595\u2013608","journal-title":"Eur J Oper Res"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Burkard RE, Cela E (1999) Linear assignment problems and extensions. Handbook of combinatorial optimization, Supplement vol A. Kluwer, Dordrecht, pp 75\u2013149","DOI":"10.1007\/978-1-4757-3023-4_2"},{"issue":"3","key":"66_CR4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"HC Lau","year":"2003","unstructured":"Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148(3): 559\u2013569","journal-title":"Eur J Oper Res"},{"key":"66_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M Drozdowski","year":"1996","unstructured":"Drozdowski M (1996) Scheduling multiprocessor tasks\u2014an overview. Eur J Oper Res 94: 215\u2013230","journal-title":"Eur J Oper Res"},{"key":"66_CR6","volume-title":"The traveling salesman problem and its variations","year":"2002","unstructured":"Gutin G, Punnen PA (eds) (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht"},{"issue":"16","key":"66_CR7","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.dam.2006.04.009","volume":"154","author":"H Hashimoto","year":"2006","unstructured":"Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl Math 154(16): 2271\u20132290","journal-title":"Discrete Appl Math"},{"issue":"1","key":"66_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.ejor.2005.09.038","volume":"177","author":"SO Shim","year":"2007","unstructured":"Shim SO, Kim YD (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177(1): 135\u2013146","journal-title":"Eur J Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0066-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-008-0066-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-008-0066-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:26Z","timestamp":1559123366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-008-0066-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,13]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["66"],"URL":"https:\/\/doi.org\/10.1007\/s10100-008-0066-y","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,13]]}}}