The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
From MaRDI portal
Publication:1302720
DOI10.1016/S0305-0548(98)00080-XzbMath0957.90062OpenAlexW2099974888WikidataQ126654305 ScholiaQ126654305MaRDI QIDQ1302720
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00080-x
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items
A two-stage hybrid flow shop with dedicated machines at the first stage, Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, On the two-stage hybrid flow shop with dedicated machines, A note on the two-stage hybrid flow shop problem with dedicated machines, The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Batch scheduling in a two-stage flexible flow shop problem, A two-stage flow shop scheduling problem with transportation considerations, New complexity results on scheduling problem in a robotic cell, Exact resolution of the two-stage hybrid flow shop with dedicated machines, Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times, Méthode heuristique pour le problème de flow shop hybride avec machines dédiées, Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine, A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
