A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

DOI10.1057/jors.1995.208zbMath0845.90073OpenAlexW2103336472WikidataQ57634007 ScholiaQ57634007MaRDI QIDQ4868791

Yuri N. Sotskov, Karin Krüger, Natalia V. Shakhlevich, Frank Werner

Publication date: 29 April 1996

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

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

zbMATH Keywords

heuristic algorithmsprecedence constraintsdecomposition algorithmmixed graph model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items

Deterministic job-shop scheduling: Past, present and future