Constraint Propagation Based Scheduling of Job Shops

DOI10.1287/ijoc.8.2.144zbMath0866.90075OpenAlexW1995296872MaRDI QIDQ5284222

Ulrich A. W. Tetzlaff, Erwin Pesch

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)

Related Items (6)

An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ A scatter search approach to sequence-dependent setup times job shop scheduling ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Constraint propagation techniques for the disjunctive scheduling problem

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