A case study of mutual routing-scheduling reformulation

DOI10.1007/s10951-006-8596-4zbMath1154.90412OpenAlexW2010898123MaRDI QIDQ880564

Patrick Prosser, Evgeny Selensky, J. Christopher Beck

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-8596-4

zbMATH Keywords

vehicle routingjob shop schedulingproblem reformulationempirical analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems

Uses Software

• CPLEX
• ILOG SCHEDULE

Cites Work

• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
• A hybrid approach to scheduling with earliness and tardiness costs
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Solving vehicle routing problems using constraint programming and metaheuristics
• A constraint-based method for project scheduling with time windows
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A case study of mutual routing-scheduling reformulation