Optimal Preemptive Scheduling on Two-Processor Systems
From MaRDI portal
Publication:5576025
DOI10.1109/T-C.1969.222573zbMath0184.20504OpenAlexW2052110143MaRDI QIDQ5576025
R. R. Munth, Edward G. jun. Coffman
Publication date: 1969
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1969.222573
Related Items
A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations ⋮ Towards Tight Lower Bounds for Scheduling Problems ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ Rational preemptive scheduling ⋮ Parallel machine scheduling problem with preemptive jobs and transportation delay ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ Open shop problems with unit time operations ⋮ Efficient scheduling of tasks without full use of processor resources ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Robust algorithms for preemptive scheduling ⋮ Online scheduling of equal-processing-time task systems ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines ⋮ Jackson's pseudo-preemptive schedule and cumulative scheduling problems ⋮ New applications of the Muntz and Coffman algorithm ⋮ A note on optimal preemptive scheduling for two-processor systems ⋮ Heuristic scheduling of parallel machines with sequence-dependent set-up times ⋮ Preemptive scheduling with variable profile, precedence constraints and due dates ⋮ Optimal scheduling for two-processor systems ⋮ TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS ⋮ How small are shifts required in optimal preemptive schedules?
