Generating Feasible Schedules for a Pick-up and Delivery Problem

DOI10.1016/S1571-0653(04)00005-8zbMath0990.90541OpenAlexW1967206677MaRDI QIDQ2741264

Claude Kirchner, Jianyang Zhou, Eric Domenjoud

Publication date: 23 September 2001

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00005-8

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Cites Work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating Feasible Schedules for a Pick-up and Delivery Problem