Applying constraint satisfaction techniques to job shop scheduling

DOI10.1023/A:1018934507395MaRDI QIDQ1374445zbMATH OpenFDO

Authors Cheng-Chung Cheng, Stephen F. Smith

Publication date 4 December 1997

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1018934507395

zbMATH Keywords

constraint satisfaction problemdeadline schedulingmakespan minimizationmulti-product hoist scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 5175842
• Constraint Propagation Based Scheduling of Job Shops
• Temporal constraint satisfaction techniques in job shop scheduling problem solving
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Constraint-based job shop scheduling with Ilog Scheduler

Cited in

(24)

• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Temporal constraint satisfaction techniques in job shop scheduling problem solving
• Constraint-directed techniques for scheduling alternative activities
• On singleton arc consistency for CSPs defined by monotone patterns
• Continuous management of airlift and tanker resources: a constraint-based approach
• A mixed closure-CSP method for solving scheduling problems
• Deterministic job-shop scheduling: Past, present and future
• Constraint satisfaction problems: Algorithms and applications
• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• scientific article; zbMATH DE number 1708123 (Why is no real title available?)
• On singleton arc consistency for CSPs defined by monotone patterns
• An integrated search heuristic for large-scale flexible job shop scheduling problems
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• scientific article; zbMATH DE number 1487506 (Why is no real title available?)
• scientific article; zbMATH DE number 194622 (Why is no real title available?)
• scientific article; zbMATH DE number 802345 (Why is no real title available?)
• Constraint Propagation Based Scheduling of Job Shops
• scientific article; zbMATH DE number 5175842 (Why is no real title available?)
• An improved repair-based constraint satisfaction method for flow shop scheduling
• scientific article; zbMATH DE number 2209652 (Why is no real title available?)
• Scheduling robotic cells with fixed processing times or time windows: classification, solution approaches, polynomial algorithms and complexity
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Efficient solution techniques for disjunctive temporal reasoning problems

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication: Applying constraint satisfaction techniques to job shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374445)