A Precedence Graph Algorithm for the Shop Scheduling Problem

DOI10.1057/JORS.1971.34MaRDI QIDQ5618270zbMATH OpenOpenAlexFDO

Authors Said Ashour, R. G. Parker

Publication date 1971

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1971.34

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Shop scheduling problems under precedence constraints
• Review of properties of different precedence graphs for scheduling problems
• An optimal method for the preemptive job shop scheduling problem
• An algorithm for minimizing setups in precedence constrained scheduling
• scientific article; zbMATH DE number 744095
• scientific article; zbMATH DE number 962288
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• scientific article; zbMATH DE number 1264301
• Flow shop scheduling problems under machine-dependent precedence constraints

Cited in

(2)

• Certain exact and approximate algorithms for solving precedence problems with constraints
• scientific article; zbMATH DE number 1226310 (Why is no real title available?)

This page was built for publication: A Precedence Graph Algorithm for the Shop Scheduling Problem

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