The three-machine flow-shop problem with arbitrary precedence relations

DOI10.1016/0377-2217(94)90384-0zbMath0816.90085OpenAlexW4254043169MaRDI QIDQ1342006

Graham B. McMahon, Chong John Lim

Publication date: 13 July 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90384-0

zbMATH Keywords

branch and boundflowshopprecedence constraintsseries-parallel

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The hot strip mill production scheduling problem: A tabu search approach

Cites Work

• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• The two-machine flow shop problem with arbitrary precedence relations
• Optimal two- and three-stage production schedules with setup times included
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
• Sequencing with Series-Parallel Precedence Constraints
• The Recognition of Series Parallel Digraphs
• Complexity of Scheduling under Precedence Constraints

This page was built for publication: The three-machine flow-shop problem with arbitrary precedence relations