Applying constraint satisfaction techniques to job shop scheduling
From MaRDI portal
Publication:1374445
DOI10.1023/A:1018934507395zbMath0890.90093MaRDI QIDQ1374445
Stephen F. Smith, Cheng-Chung Cheng
Publication date: 4 December 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
makespan minimizationconstraint satisfaction problemdeadline schedulingmulti-product hoist scheduling
Related Items
An integrated search heuristic for large-scale flexible job shop scheduling problems, On Singleton Arc Consistency for CSPs Defined by Monotone Patterns, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, On singleton arc consistency for CSPs defined by monotone patterns, Continuous management of airlift and tanker resources: a constraint-based approach, Deterministic job-shop scheduling: Past, present and future, Constraint satisfaction problems: Algorithms and applications, Constraint-directed techniques for scheduling alternative activities, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Efficient solution techniques for disjunctive temporal reasoning problems
Uses Software
