CP methods for scheduling and routing with~time-dependent task costs
From MaRDI portal
Recommendations
- CP methods for scheduling and routing with time-dependent task costs
- Constraint programming for LNG ship scheduling and inventory management
- Ship scheduling with soft time windows: An optimisation based approach
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- Principles and Practice of Constraint Programming – CP 2004
Cites work
- A maritime inventory routing problem: practical approach
- A mathematical model of inter-terminal transportation
- Cash Flows in Networks
- COLIN: planning with continuous linear numeric change
- CP methods for scheduling and routing with time-dependent task costs
- Handbook of constraint programming.
- Handbooks in operations Research \& management science: Transportation
- scientific article; zbMATH DE number 2038893 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 2221454 (Why is no real title available?)
- On maximizing the net present value of a project under renewable resource constraints
- Optimizing liner shipping fleet repositioning plans
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Propagation via lazy clause generation
- Reducing fuel emissions by optimizing speed on shipping routes
- Robust ship scheduling with multiple time windows
- SCIP: solving constraint integer programs
- Ship routing and scheduling in the new millennium
- Ship scheduling with soft time windows: An optimisation based approach
- STRIPS: A new approach to the application of theorem proving to problem solving
- Symmetries, almost symmetries, and lazy clause generation
- The design of the zinc modelling language
- The payment scheduling problem
- The traveling salesman problem with draft limits
- Three scheduling algorithms applied to the Earth observing systems domain
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
This page was built for publication: CP methods for scheduling and routing with~time-dependent task costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513747)
