A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

DOI10.1057/JORS.1995.208MaRDI QIDQ4868791zbMATH OpenOpenAlexWikidataFDO

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

Publication date 29 April 1996

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.1995.208

zbMATH Keywords

decomposition algorithmheuristic algorithmsmixed graph modelprecedence constraints

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for generalized shop scheduling problems based on decomposition
• Mixed multigraph approach to scheduling jobs on machines of different types^∗
• scientific article; zbMATH DE number 962288
• scientific article; zbMATH DE number 4057270
• scientific article; zbMATH DE number 4023002

Cited in

(5)

• Deterministic job-shop scheduling: Past, present and future
• Heuristics for generalized shop scheduling problems based on decomposition
• Mixed multigraph approach to scheduling jobs on machines of different types^∗
• scientific article; zbMATH DE number 1512197 (Why is no real title available?)
• Adaptive scheduling algorithm based on mixed graph model

This page was built for publication: A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

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