CP methods for scheduling and routing with time-dependent task costs

DOI10.1007/978-3-642-38171-3_8zbMATH Open1382.90036OpenAlexW2207219133WikidataQ60145767 ScholiaQ60145767MaRDI QIDQ4922907FDOQ4922907

Authors: Elena Kelareva, Kevin Tierney, Philip Kilby 

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_8

Recommendations

• CP methods for scheduling and routing with~time-dependent task costs
• Scheduling with a constraint based cooperative solver
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Hybrid optimization methods for time-dependent sequencing problems
• A hybrid method for the planning and scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Rescheduling railway traffic on real time situations using time-interval variables
• CP methods for scheduling and routing with~time-dependent task costs

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 Q4922907)