Offline Non-preemptive Scheduling

Offline Non-Preemptive Scheduling is a deterministic scheduling paradigm within real-time and batch processing systems wherein all job characteristics, including arrival times, execution requirements, and deadlines, are known a priori, and once initiated, each job executes to completion without interruption.

13

Publications

347

Citations

38

Authors

28

Institutions

Publications per year

2017–2026

4

Authors

38

  1. GF
    Gerhard Fohler

    University of Kaiserslautern, Germany

    2 publications · 39 citations

    2

    h-index

  2. PU
    Patchrawat Uthaisombut

    Michigan State University, United States

    1 publications · 11 citations

    1

    h-index

  3. WW
    Weili Wu

    Nanjing University, China

    1 publications · 49 citations

    1

    h-index

  4. VC
    Victor Cionca

    Munster Technological University, Ireland

    1 publications · 31 citations

    1

    h-index

  5. YZ
    Yuqing Zhu

    California State University Los Angeles, United States

    1 publications · 49 citations

    1

    h-index

1–5 of 38

Venues

  1. Real-Time Systems

    2 publications · 39 citations

    2

    h-index

  2. Journal of Building Engineering

    1 publications · 15 citations

    1

    h-index

  3. 1

    h-index

  4. Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204)

    Conference · 1 publications · 59 citations

    1

    h-index

1–4