Optimal Preemptive Scheduling on Two-Processor Systems
From MaRDI portal
Cited in
(22)- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Rational preemptive scheduling
- A note on optimal preemptive scheduling for two-processor systems
- How small are shifts required in optimal preemptive schedules?
- Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
- Online scheduling of equal-processing-time task systems
- Efficient scheduling of tasks without full use of processor resources
- A state-of-the-art review of parallel-machine scheduling research
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- Is a unit-job shop not easier than identical parallel machines?
- New applications of the Muntz and Coffman algorithm
- Robust algorithms for preemptive scheduling
- Parallel machine scheduling problem with preemptive jobs and transportation delay
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems
- Two coNP-complete schedule analysis problems
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Optimal scheduling for two-processor systems
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Scheduling on parallel machines with preemption and transportation delays
- Open shop problems with unit time operations
- Towards tight lower bounds for scheduling problems
- Optimal preemptive scheduling on a fixed number of identical parallel machines
This page was built for publication: Optimal Preemptive Scheduling on Two-Processor Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576025)
