The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage

DOI10.1080/02522667.1991.10699080zbMath0825.90544OpenAlexW2042193016MaRDI QIDQ4009156

D. E. Deal, John L. Hunsucker

Publication date: 27 September 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Scheduling a two-stage hybrid flowshop with separable setup and removal times, Global lower bounds for flow shops with multiple processors, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Two-Stage, Hybrid Flowshop Scheduling Problem