Variants of the two machine flow shop problem connected with factorization of matrix functions

DOI10.1016/0377-2217(94)00340-8zbMath0947.90576OpenAlexW2108011564MaRDI QIDQ1278197

Harm Bart, Leo G. Kroon

Publication date: 22 February 1999

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

Full work available at URL: http://hdl.handle.net/1765/6682

zbMATH Keywords

job schedulingJohnson's ruletwo machine flow shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Quasicomplete factorizations of rational matrix functions, Minimizing functions of infeasibilities in a two-machine flow shop, Companion based matrix functions: Description and minimal factorization, Factorization and job scheduling: A connection via companion based matrix functions, Quasicomplete factorization and the two machine flow shop problem

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal factorization of matrix and operator functions
• Companion based matrix functions: Description and minimal factorization
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• The Lessons of Flowshop Scheduling Research