Three-machine Scheduling
Three-Machine Scheduling is a deterministic scheduling model in the class of parallel machine scheduling problems, distinguished by the allocation of a set of jobs to exactly three identical machines to minimize the makespan, which is the completion time of the last job processed.
46
Publications
2.2K
Citations
101
Authors
62
Institutions
Publications per year
2017–2026
9
Parents
46
Batching and Scheduling Jobs on Batch and Discrete Processors
Javad Ahmadi, Reza Ahmadi, Sriram Dasu et al. · Operations Research · 1992 · 211 citations
1–5 of 46
101
4
h-index
3
h-index
3
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 389 citations
3
h-index
2
h-index
1–5 of 101
62
Kuwait University
Kuwait City, Kuwait
4 h-index
6 publications
177 citations
Feng Chia University
Taichung, Taiwan
3 h-index
10 publications
163 citations
University of Gdańsk
Gdansk, Poland
3 h-index
4 publications
53 citations
United Institute of Informatics Problems
Minsk, Belarus
2 h-index
3 publications
271 citations
Cheng Shiu University
Kaohsiung City, Taiwan
2 h-index
2 publications
32 citations

Dalian Maritime University
Dalian, China
2 h-index
3 publications
42 citations
Gdańsk University of Technology
Gdansk, Poland
2 h-index
2 publications
33 citations
Texas A&M University
College Station, United States
2 h-index
4 publications
190 citations
1–8 of 62
5 publications · 267 citations
5
h-index
4 publications · 156 citations
4
h-index
4 publications · 312 citations
4
h-index
3 publications · 160 citations
3
h-index
2 publications · 51 citations
2
h-index
1–5