Two-stage hybrid flow shop scheduling with dynamic job arrivals
DOI10.1016/j.cor.2011.10.006zbMath1251.90203OpenAlexW1996628037MaRDI QIDQ1762160
Mei Zhao, Frank S. Yao, Hui Zhang
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.006
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Cites Work
- Unnamed Item
- Makespan minimization in a no-wait flow shop problem with two batching machines
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- The hybrid flow shop scheduling problem
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
This page was built for publication: Two-stage hybrid flow shop scheduling with dynamic job arrivals
