Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem

From MaRDI portal

Publication:1854902

Jump to:navigation, search

DOI10.1023/A:1009613717770zbMath1064.90544MaRDI QIDQ1854902

Philippe Baptiste, Claude le Pape

Publication date: 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

constraint propagation constraint programming job-shop scheduling preemptive scheduling resource constraints timetables limited discrepancy search edge-finding depth-bounded discrepancy search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Exploring relaxation induced neighborhoods to improve MIP solutions

Uses Software

CLAIRE

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1854902&oldid=14238710"