Nonpreemptive Scheduling
Nonpreemptive Scheduling is a scheduling strategy within scheduling theory whereby each job, once initiated, must be executed to completion without interruption or rescheduling of the job’s processing on any machine or resource.
103
Publications
6.9K
Citations
237
Authors
148
Institutions
Publications per year
2017–2026
7
Variants
Non-preemptive Scheduling
103
Open Shop Scheduling to Minimize Finish Time
Teofilo F. Gonzalez, Sartaj Sahni · Journal of the ACM · 1976 · 669 citations · Full text
Scheduling fixed-priority tasks with preemption threshold
Yun Wang, M. Saksena · 2003 · 270 citations
1–5 of 103
237
IBM Research - Thomas J. Watson Research Center, United States
4 publications · 248 citations
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 237
148
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
5 publications
92 citations
The Ohio State University
Columbus, United States
5 h-index
5 publications
274 citations
The University of Texas at Dallas
Richardson, United States
3 h-index
3 publications
160 citations
The University of Texas at Austin
Austin, United States
3 h-index
3 publications
166 citations
AT&T (United States)
Bedminster, United States
3 h-index
3 publications
221 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
288 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
66 citations

Newcastle University
Newcastle upon Tyne, United Kingdom
3 h-index
3 publications
50 citations
1–8 of 148
12 publications · 976 citations
12
h-index
4 publications · 297 citations
4
h-index
TALG · 4 publications · 68 citations
4
h-index
4 publications · 98 citations
4
h-index
4 publications · 343 citations
4
h-index
1–5