Heuristics for generalized shop scheduling problems based on decomposition

DOI10.1080/002075498192265zbMATH Open0939.90007OpenAlexW2152454894WikidataQ57633973 ScholiaQ57633973MaRDI QIDQ4245699FDOQ4245699

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

Publication date: 9 September 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075498192265

Recommendations

• A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
• scientific article; zbMATH DE number 805284
• scientific article; zbMATH DE number 890241

zbMATH Keywords

precedence constraintsgeneral shopgeneralized shop schedulingsequence-dependent changeover times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• An effective heuristic algorithm for the partial shop scheduling problem
• A neural network algorithm for servicing jobs with sequential and parallel machines
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Vyacheslav Tanaev: contributions to scheduling and related areas

This page was built for publication: Heuristics for generalized shop scheduling problems based on decomposition

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