An approximate solution of the flow-shop problem with sequence dependent setup times

DOI10.1007/BF01415942zbMath0692.90060OpenAlexW2055162959MaRDI QIDQ3035126

Wlodzimierz Szwarc, John J. Liu

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415942

zbMATH Keywords

approximate solutionssequence dependent setup timesComputational resultsm-machine flow shop

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• The two-machine sequence dependent flowshop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Flow Shop Problems with Time Lags
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
• Sequencing n jobs on two machines with setup, processing and removal times separated

This page was built for publication: An approximate solution of the flow-shop problem with sequence dependent setup times