{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:35:49Z","timestamp":1648852549582},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10951-006-8596-4","type":"journal-article","created":{"date-parts":[[2006,6,16]],"date-time":"2006-06-16T03:47:07Z","timestamp":1150429627000},"page":"469-491","source":"Crossref","is-referenced-by-count":3,"title":["A case study of mutual routing-scheduling reformulation"],"prefix":"10.1007","volume":"9","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","reference":[{"key":"8596_CR1","unstructured":"Baptiste, Ph. and C. Le Pape, \u201cEdge finding constraint propagation algorithms for disjunctive and cumulative scheduling,\u201d in Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group, 1996."},{"key":"8596_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, Ph., C. Le Pape, and W. Nuijten, Constraint-based scheduling: Applying constraint programming to scheduling problems, Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"1","key":"8596_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J. C. Beck","year":"2000","unstructured":"Beck, J. C. and M. S. Fox, \u201cDynamic problem structure analysis as a basis for constraint-directed scheduling heuristics,\u201d Artificial Intelligence, 117(1), 31\u201381 (2000).","journal-title":"Artificial Intelligence"},{"key":"8596_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J. C. Beck","year":"2003","unstructured":"Beck, J. C. and P. Refalo, \u201cA hybrid approach to scheduling with earliness and tardiness costs,\u201d Annals of Operations Research, 118, 49\u201371 (2003).","journal-title":"Annals of Operations Research"},{"key":"8596_CR5","doi-asserted-by":"crossref","unstructured":"Beck, J. C., A. J. Davenport, and M. S. Fox, \u201cFive pitfalls of empirical scheduling research,\u201d in 3rd Int. Conference on Principles and Practice of Constraint Programming (CP\u201997), 1997.","DOI":"10.1007\/BFb0017455"},{"key":"8596_CR6","unstructured":"Beck, J. C. and L. Perron, \u201cDiscrepancy-bounded depth first search,\u201d in Proceedings of the Second International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems (CPAIOR\u201900), 2000."},{"key":"8596_CR7","doi-asserted-by":"crossref","unstructured":"Beck, J. C., P. Prosser, and E. Selensky, \u201cOn the reformulation of vehicle routing problems and scheduling problems,\u201d in: LNAI 2371, Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA 2002), 2002, pp. 282\u2013289.","DOI":"10.1007\/3-540-45622-8_21"},{"key":"8596_CR8","unstructured":"Beck, J. C., P. Prosser, and E. Selensky, \u201cVehicle routing and job shop scheduling: What\u2019s the difference?\u201d in: Proceedings of the 13th International Conference on Artificial Intelligence Planning and Scheduling, 2003."},{"key":"8596_CR9","first-page":"55","volume":"13","author":"C. Brind","year":"1995","unstructured":"Brind, C., C. Muller, and P. Prosser, \u201cStochastic techniques for resource management,\u201d BT Technology Journal, 13, 55\u201365 (1995).","journal-title":"BT Technology Journal"},{"issue":"1","key":"8596_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2000","unstructured":"Cesta, A., A. Oddi, and S. F. Smith, \u201cA constraint-based method for project scheduling with time windows,\u201d Journal of Heuristics, 8(1), 109\u2013136 (2000).","journal-title":"Journal of Heuristics"},{"issue":"4","key":"8596_CR11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G. and J. W. Wright, \u201cScheduling of vehicles from a central depot to a number of delivery points,\u201d Operations Research, 12(4), 568\u2013581 (1964).","journal-title":"Operations Research"},{"key":"8596_CR12","unstructured":"Davenport, A. J. and J. C. Beck, \u201cAn investigation into two approaches for constraint directed resource allocation and scheduling,\u201d In INFORMS, 1999."},{"key":"8596_CR13","first-page":"5001","volume":"6","author":"B. DeBacker","year":"2000","unstructured":"DeBacker, B., V. Furnon, P. Shaw, P. Kilby, and P. Prosser, \u201cSolving vehicle routing problems using constraint programming and metaheuritics,\u201d Journal of Heuristics, 6, 5001\u20135523 (2000).","journal-title":"Journal of Heuristics"},{"key":"8596_CR14","unstructured":"Focacci, F., P. Laborie, and W. Nuijten, \u201cSolving scheduling problems with setup times and alternative resources,\u201d in Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling, 2000."},{"key":"8596_CR15","unstructured":"Fox, M. S., Constraint-Directed Search: A Case Study of Job Shop Scheduling. PhD thesis, Carnegy Mellon University, Intelligent Systems Laboratory. The Robotics Institute, Pittsburgh, PA, 1983."},{"key":"8596_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"issue":"4","key":"8596_CR17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1009808327381","volume":"5","author":"P. Kilby","year":"2000","unstructured":"Kilby, P., P. Prosser, and P. Shaw, \u201cA comparison of traditional and constraint-based heuristics methods for vehicle routing problems with side constraints,\u201d Constraints, 5(4), 389\u2013414 (2000).","journal-title":"Constraints"},{"key":"8596_CR18","unstructured":"Laborie, P., \u201cAlgorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results,\u201d in Proceedings of the 6th European Conference on Planning (ECP01), 2001."},{"key":"8596_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P., \u201cAlgorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results,\u201d Artificial Intelligence, 143, 151\u2013188 (2003).","journal-title":"Artificial Intelligence"},{"issue":"2","key":"8596_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Le Pape","year":"1994","unstructured":"Le Pape, C., \u201cImplementation of resource constraints in ILOG SCHEDULE: A library for the development of constraint-based scheduling systems,\u201d Intelligent Systems Engineering, 3(2), 55\u201366 (1994).","journal-title":"Intelligent Systems Engineering"},{"key":"8596_CR21","unstructured":"Nuijten, W. P. M., \u201cTime and resource constrained scheduling: a constraint satisfaction approach,\u201d PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994."},{"key":"8596_CR22","unstructured":"Prosser, P., P. Kilby, and P. Shaw, \u201cGuided local search for the vehicle routing problem,\u201d in Proceedings of the 2nd International Conference on Metaheuristics, 1997."},{"key":"8596_CR23","doi-asserted-by":"crossref","unstructured":"Puget, J. F., \u201cConstraint programming next challenge: Simplicity of use,\u201d in M. Wallace, (ed.), Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP\u201904), 2004 pp. 5\u20138.","DOI":"10.1007\/978-3-540-30201-8_2"},{"key":"8596_CR24","unstructured":"Smith, S. and C. Cheng, \u201cSlack based heuristics for constraint satisfaction scheduling,\u201d in Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI\u201393), 1993 pp. 139\u2013144."},{"key":"8596_CR25","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M., \u201cAlgorithms for the vehicle routing and scheduling problem with time window constraints,\u201d Operations Research, 35, 254\u2013365 (1987).","journal-title":"Operations Research"},{"issue":"2","key":"8596_CR26","first-page":"80","volume":"113","author":"C. Voudouris","year":"1998","unstructured":"Voudouris, C., and E. P. K. Tsang, \u201cGuided local search,\u201d European Journal of Operational Research, 113(2), 80\u2013110 (1998).","journal-title":"European Journal of Operational Research"},{"key":"8596_CR27","doi-asserted-by":"crossref","unstructured":"Walsh, T., \u201cReformulating propositional satisfiability as constraint satisfaction,\u201d in Symposium on Abstraction, Reformulation and Approximation (SARA), 2000.","DOI":"10.1007\/3-540-44914-0_14"},{"key":"8596_CR28","unstructured":"PRAS vehicle routing and shop scheduling problem instances. http:\/\/www.dcs.gla.ac.uk\/pras\/resources\/."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8596-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8596-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8596-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8596-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["8596"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8596-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}