Complexity results for flow-shop problems with a single server
From MaRDI portal
Publication:1772843
DOI10.1016/j.ejor.2004.04.010zbMath1066.90024MaRDI QIDQ1772843
Guoqing Wang, Peter Brucker, Sigrid Knust
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.010
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling jobs with equal processing times and a single server on parallel identical machines, A job-shop problem with one additional resource type, Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Two-machine flow shop problems with a single server, Parallel machine scheduling with multiple unloading servers, Single-server parallel-machine scheduling with loading and unloading times, The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies, A survey of scheduling problems with setup times or costs, The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time, Two-machine open shop problem with a single server and set-up time considerations, Parallel Machine Scheduling with a Single Server: Loading and Unloading, Scheduling Bidirectional Traffic on a Path
Cites Work
- Unnamed Item
- Parallel machine scheduling problems with a single server
- One-operator-two-machine flowshop scheduling with setup and dismounting times
- Parallel machine scheduling with a common server
- Scheduling equal-length jobs on identical parallel machines
- Complexity results for parallel machine problems with a single server
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling for parallel dedicated machines with a single server
- An approximation algorithm for parallel machine scheduling with a common server