Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms

DOI10.1080/03155986.1991.11732168zbMath0778.90032OpenAlexW2398863411MaRDI QIDQ3142307

Edouard Wagneur, Chelliah Skriskandarajah

Publication date: 15 November 1993

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

NP-hard heuristic algorithms minimum makespan variable processing time flowshop-scheduling two processors in series

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

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 ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Optimal control of a class of DEDS: Flow-shops with state-dependent processing times

This page was built for publication: Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms