An optimal method for the preemptive job shop scheduling problem

DOI10.1016/J.COR.2012.12.004zbMath1352.90036OpenAlexW1985032712MaRDI QIDQ502444

Abbas Ebadi, Ghasem Moslehi

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.12.004

zbMATH Keywords

schedulingbranch and boundjob shopdisjunctive graphpreemption

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

This page was built for publication: An optimal method for the preemptive job shop scheduling problem