Blocking Flow Shop Scheduling is a variant of the flow shop scheduling problem in which jobs must progress through a series of machines in the same order, with the distinguishing constraint that a job cannot leave a machine until the next machine in the sequence is available, thereby causing blocking when intermediate buffers are absent or limited.
134
Publications
8.8K
Citations
240
Authors
131
Institutions
Publications per year
2017–2026
79
Variants
Blocking Flow Shop
Parents
Publications
134
1–5 of 134
Authors
240
- QP
15
h-index
- YH
12
h-index
- LW
11
h-index
- FZ
10
h-index
- IR
10
h-index
1–5 of 240
Institutions
131
Liaocheng University
Liaocheng, China
21 h-index
51 publications
4.5K citations
Tsinghua University
Beijing, China
16 h-index
22 publications
1.8K citations
Lanzhou University of Technology
Lanzhou, China
13 h-index
39 publications
2.3K citations
Huazhong University of Science and Technology
Wuhan, China
11 h-index
15 publications
1.1K citations
Nanjing University of Aeronautics and Astronautics
Nanjing, China
10 h-index
21 publications
1.2K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
10 h-index
27 publications
1.9K citations
Universidade de São Paulo
São Paulo, Brazil
9 h-index
16 publications
663 citations
Shanghai University
Shanghai, China
9 h-index
18 publications
910 citations
1–8 of 131
Venues
- Expert Systems with Applications
19 publications · 1.3K citations
19
h-index
- Computers & Operations Research
11 publications · 844 citations
11
h-index
- Applied Soft Computing
9 publications · 491 citations
9
h-index
- Computers & Industrial Engineering
8 publications · 425 citations
8
h-index
- Engineering Applications of Artificial Intelligence
7 publications · 363 citations
7
h-index
1–5