Two-machine Scheduling
Two-Machine Scheduling is a deterministic scheduling model in the class of finite capacity scheduling problems that specifically involves sequencing a set of jobs on two distinct machines in a prescribed order to minimize the makespan.
569
Publications
24.1K
Citations
842
Authors
434
Institutions
Publications per year
2017–2026
61
569
Scheduling Problems with Two Competing Agents
Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli et al. · Operations Research · 2004 · 462 citations · Full text
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 569
842
23
h-index
17
h-index
17
h-index
14
h-index
12
h-index
1–5 of 842
434

Hong Kong Polytechnic University
Hong Kong, Hong Kong
24 h-index
65 publications
2.1K citations
Feng Chia University
Taichung, Taiwan
19 h-index
53 publications
1.8K citations

University of Greenwich
London, United Kingdom
16 h-index
23 publications
1.1K citations
United Institute of Informatics Problems
Minsk, Belarus
15 h-index
27 publications
585 citations

Zhejiang University
Hangzhou, China
14 h-index
29 publications
959 citations

University of Toronto
Toronto, Canada
13 h-index
16 publications
528 citations
Kuwait University
Kuwait City, Kuwait
13 h-index
15 publications
425 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
26 publications
511 citations
1–8 of 434
60 publications · 2.5K citations
31
h-index
49 publications · 1.6K citations
28
h-index
34 publications · 1K citations
23
h-index
28 publications · 2.2K citations
20
h-index
JOS · 20 publications · 761 citations
18
h-index
1–5