A note on scheduling jobs with missing operations in permutation flow shops

DOI10.1080/002075498192742zbMath0953.90525OpenAlexW2162760931MaRDI QIDQ4245674

Rainer Leisten, Matthias Kolbe

Publication date: 8 June 1999

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

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

zbMATH Keywords

computational complexityflowshop scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Cyclic flow-shop scheduling with no-wait constraints and missing operations

This page was built for publication: A note on scheduling jobs with missing operations in permutation flow shops