{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:21:40Z","timestamp":1761708100965},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_7","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:13:34Z","timestamp":1188299614000},"page":"60-74","source":"Crossref","is-referenced-by-count":6,"title":["Graph Transformations for the Vehicle Routing and Job Shop 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,10,24]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J. C. Beck","year":"2000","unstructured":"J. C. Beck and M. S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117(1):31\u201381, 2000.","journal-title":"Artificial Intelligence"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"J.C. Beck, P. Prosser, and E. Selensky. On the reformulation of vehicle routing probelms and scheduling problems. In Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA), 2002.","DOI":"10.1007\/3-540-45622-8_21"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2000","unstructured":"A. Cesta, A. Oddi, and S.F. Smith. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1):109\u2013136, Jan 2000.","journal-title":"Journal of Heuristics"},{"key":"7_CR4","unstructured":"A.J. Davenport and J.C. Beck. An investigation into two approaches for constraint directed resource allocation and scheduling. In INFORMS, 1999."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"5001","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. DeBacker","year":"2000","unstructured":"B. DeBacker, V. Furnon, P. Shaw, P. Kilby, and P. Prosser. Solving vehicle routing problems using constraint programming and metaheuritics. Journal of Heuristics, 6:5001\u2013523, 2000.","journal-title":"Journal of Heuristics"},{"key":"7_CR6","unstructured":"F. Focacci, P. Laborie, and W. Nuijten. Solving scheduling problems with setup times and alternative resources. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, 2000."},{"key":"7_CR7","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":"7_CR8","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"7_CR9","unstructured":"W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proceedings of the Fourteenth International Joint Conference onf Artificial Intelligence (IJCAI-95), pages 607\u2013613, 1995."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"7_CR11","unstructured":"P. Laborie. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. In Proceedings of the 6th European Conference on Planning (ECP01), 2001."},{"key":"7_CR12","unstructured":"W. P. M. Nuijten. Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape La","year":"1994","unstructured":"C. La Pape. Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering, 3(2):55\u201366, 1994.","journal-title":"Intelligent Systems Engineering"},{"key":"7_CR14","unstructured":"E. Selensky. On mutual reformulation of shop scheduling and vehicle routing. In Proceedings of the 20th UK PLANSIG, 2001."},{"key":"7_CR15","unstructured":"S. Smith and C. Cheng. Slack based heuristics for constraint satisfaction scheduling. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 139\u2013144, 1993."},{"key":"7_CR16","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"},{"issue":"2","key":"7_CR17","first-page":"80","volume":"113","author":"C. Voudouris","year":"1998","unstructured":"C. Voudouris and E.P.K. Tsang. Guided Local Search. European Journal of Operational Research, 113(2):80\u2013110, 1998.","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T00:16:16Z","timestamp":1550880976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}