How small are shifts required in optimal preemptive schedules?
From MaRDI portal
Publication:2341389
DOI10.1007/s10951-013-0355-8zbMath1312.65235OpenAlexW1977961697MaRDI QIDQ2341389
Publication date: 24 April 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0355-8
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of optimal schedules in preemptive shop scheduling
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Minimizing makespan and preemption costs on a system of uniform machines
- Rational preemptive scheduling
- How useful are preemptive schedules?
- Ideal preemptive schedules on two processors
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling with Deadlines and Loss Functions
- Integrality Property in Preemptive Parallel Machine Scheduling
- Combinatorial Matrices with Small Determinants
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Preemptive Scheduling on Two-Processor Systems
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
