Heuristics for generalized shop scheduling problems based on decomposition

DOI10.1080/002075498192265zbMath0939.90007OpenAlexW2152454894WikidataQ57633973 ScholiaQ57633973MaRDI QIDQ4245699

Yuri N. Sotskov, Karin Krüger, 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

zbMATH Keywords

precedence constraintsgeneral shopgeneralized shop schedulingsequence-dependent changeover times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A neural network algorithm for servicing jobs with sequential and parallel machines ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas

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