A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
From MaRDI portal
Publication:1046715
DOI10.1016/j.cor.2009.08.001zbMath1177.90159OpenAlexW1971258248MaRDI QIDQ1046715
Lixin Tang, Hua Gong, Cees W. Duin
Publication date: 22 December 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.08.001
Related Items
Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals
Cites Work
- Unnamed Item
- Unnamed Item
- Makespan minimization in a no-wait flow shop problem with two batching machines
- A two-machine permutation flow shop scheduling problem with buffers
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- Two-machine flowshop batching and scheduling
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
