The two-machine permutation flow shop with state-dependent processing times

DOI<697::AID-NAV3220400511>3.0.CO;2-V 10.1002/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-VzbMath0781.90057OpenAlexW2010094739MaRDI QIDQ4201454

Edouard Wagneur, Chelliah Skriskandarajah

Publication date: 25 August 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199308)40:5<697::aid-nav3220400511>3.0.co;2-v

zbMATH Keywords

flow shopNP-hardtwo machinespermutation schedulesminimum makespan schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A variant of the permutation flow shop model with variable processing times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Optimal control of a class of DEDS: Flow-shops with state-dependent processing times