CP Methods for Scheduling and Routing with Time-Dependent Task Costs
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 111-127
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- The Traveling Salesman Problem with Draft LimitsComputers & Operations Research, 2012
- The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristicsTransportation Research Part E: Logistics and Transportation Review, 2012
- Earth Observation Satellites Scheduling Based on Decomposition Optimization AlgorithmInternational Journal of Image, Graphics and Signal Processing, 2010
- Reducing fuel emissions by optimizing speed on shipping routesJournal of the Operational Research Society, 2010
- An exact solution approach for vehicle routing and scheduling problems with soft time windowsTransportation Research Part E: Logistics and Transportation Review, 2009
- Propagation via lazy clause generationConstraints, 2009
- Daily Imaging Scheduling of an Earth Observation SatelliteIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2005
- A computer-based decision support system for vessel fleet scheduling—experience and future researchDecision Support Systems, 2004
- Robust ship scheduling with multiple time windowsNaval Research Logistics (NRL), 2002
- Ship scheduling with soft time windows: An optimisation based approachEuropean Journal of Operational Research, 2001