On the reformulation of vehicle routing problems and scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2371, Issue , 2002, Pages 282-289

  Beck, J Christopher ^a   Prosser, Patrick ^b   Selensky, Evgeny ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SCHEDULING; VEHICLE ROUTING; VEHICLES;

FACTORY FLOORS; OPEN SHOP; OPEN SHOP SCHEDULING PROBLEM; PRE-PROCESSING; SCHEDULING PROBLEM; SETUP COSTS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

INVERSE PROBLEMS;

EID: 84956864744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45622-8_21     Document Type: Conference Paper

References (6)

1. 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 http://www.dcs.stand.ac.uk/apes/apesreports.html.
2. 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.
3. Evgeny Selensky. On mutual reformulation of shop scheduling and vehicle routing. In Proceedings of the 20th UKPLANSIG, pages 282–291, 2001.
4. M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254–365, 1987.
5. Jssp benchmarks, 15 by 15. http://www.dcs.gla.ac.uk/pras/resources.html.
6. Jssp benchmarks, 6 by 6. http://www.ms.ic.ac.uk/jeb/pub/jobshop1.txt.