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

Authors

237

  1. BS
    Baruch Schieber

    IBM Research - Thomas J. Watson Research Center, United States

    4 publications · 248 citations

    4

    h-index

  2. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    4 publications · 242 citations

    4

    h-index

  3. JY
    Joseph Y.‐T. Leung

    New Jersey Institute of Technology, United States

    3 publications · 388 citations

    3

    h-index

  4. KD
    K. D. Glazebrook

    Newcastle University, United Kingdom

    3 publications · 50 citations

    3

    h-index

  5. UB
    Uttarayan Bagchi

    The University of Texas at Austin, United States

    3 publications · 166 citations

    3

    h-index

1–5 of 237

Venues

  1. SIAM Journal on Computing

    12 publications · 976 citations

    12

    h-index

  2. 4

    h-index

  3. ACM Transactions on Algorithms

    TALG · 4 publications · 68 citations

    4

    h-index

  4. Operations Research

    4 publications · 98 citations

    4

    h-index

  5. IEEE Transactions on Computers

    4 publications · 343 citations

    4

    h-index

1–5