{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:46Z","timestamp":1725484306509},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439417"},{"type":"electronic","value":"9783540456223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45622-8_21","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:45:20Z","timestamp":1179945920000},"page":"282-289","source":"Crossref","is-referenced-by-count":9,"title":["On the Reformulation of Vehicle Routing Problems and Scheduling Problems"],"prefix":"10.1007","author":[{"given":"J. Christopher","family":"Beck","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[]},{"given":"Evgeny","family":"Selensky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"21_CR1","unstructured":"J. Christopher Beck, Patrick Prosser, and Evgeny Selensky. On the reformulation of vehicle routing problems and scheduling problems. Technical Report APES-44-2002, APES Research Group, February 2002. Available from \n                    http:\/\/www.dcs.st-and.ac.uk\/apes\/apesreports.html\n                    \n                  ."},{"key":"21_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"key":"21_CR3","unstructured":"Evgeny Selensky. On mutual reformulation of shop scheduling and vehicle routing. In Proceedings of the 20th UK PLANSIG, pages 282\u2013291, 2001."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254\u2013365, 1987.","journal-title":"Operations Research"},{"key":"21_CR5","unstructured":"Jssp benchmarks, 15 by 15. \n                    http:\/\/www.dcs.gla.ac.uk\/pras\/resources.html\n                    \n                  ."},{"key":"21_CR6","unstructured":"Jssp benchmarks, 6 by 6. \n                    http:\/\/www.ms.ic.ac.uk\/jeb\/pub\/jobshop1.txt\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45622-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:55:12Z","timestamp":1550354112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45622-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439417","9783540456223"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45622-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}