Permutation flow-shop theory revisited

DOI10.1002/nav.3800250315zbMath0413.90030OpenAlexW2025588823MaRDI QIDQ3048554

Wlodzimierz Szwarc

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250315

zbMATH Keywords

schedulingflow-shop problempermutation flow-shop theory

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Deterministic scheduling theory in operations research (90B35) Discrete mathematics in relation to computer science (68R99)

Related Items

Applications of max-plus algebra to flow shop scheduling problems, Minimizing Mean Completion Time for Special Flowshop Problems, The clustered flow-shop problem, Generating improved dominance conditions for the flowshop problem, Clustered flow shop models

Cites Work

• Technical Note—Precedence Relations of the Flow-Shop Problem