Constraint Propagation Based Scheduling of Job Shops

DOI10.1287/IJOC.8.2.144MaRDI QIDQ5284222zbMATH OpenOpenAlexFDO

Authors Erwin Pesch, Ulrich A. W. Tetzlaff

Publication date 22 January 1997

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.8.2.144

zbMATH Keywords

artificial intelligencejob shopminimum makespanpropagation and decomposition techniquesspecial purpose heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• Applying constraint satisfaction techniques to job shop scheduling
• Constraint propagation in flexible manufacturing
• Constraint-based job shop scheduling with Ilog Scheduler

Cited in

(18)

• Temporal constraint satisfaction techniques in job shop scheduling problem solving
• Job-shop scheduling with convex models of operations
• Applying constraint satisfaction techniques to job shop scheduling
• Constraint propagation in flexible manufacturing
• Constraint propagation techniques for the disjunctive scheduling problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Deterministic job-shop scheduling: Past, present and future
• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• A scatter search approach to sequence-dependent setup times job shop scheduling
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
• A Position-Based Propagator for the Open-Shop Problem
• scientific article; zbMATH DE number 5175842 (Why is no real title available?)
• scientific article; zbMATH DE number 2209652 (Why is no real title available?)
• Improving branch and bound for jobshop scheduling with constraint propagation
• A filter-and-fan approach to the job shop scheduling problem

This page was built for publication: Constraint Propagation Based Scheduling of Job Shops

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