Resource constraints for preemptive job-shop scheduling

DOI10.1023/A:1009723704757zbMath0915.90152OpenAlexW1822524951MaRDI QIDQ1277297

Philippe Baptiste, Claude le Pape

Publication date: 2 February 1999

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009723704757

zbMATH Keywords

branch-and-boundjob-shop schedulingpreemptive schedulingexperimental studyconstraint propagation algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Linear programming based algorithms for preemptive and non-preemptive RCPSP, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

Uses Software

• CLAIRE