PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES

DOI10.1142/S0217595905000662zbMath1080.90047MaRDI QIDQ5716131

Gaurav Singh, Yakov Zinder

Publication date: 9 January 2006

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

precedence constraintsmaximum latenesspreemptionsparallel identical processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

An iterative algorithm for scheduling UET tasks with due dates and release times. ⋮ Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness ⋮ The worst-case analysis of the Garey-Johnson algorithm ⋮ Scheduling with precedence constraints: Worst-case analysis of priority algorithms

Cites Work

• NP-complete scheduling problems
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• Ideal preemptive schedules on two processors
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Optimal scheduling for two-processor systems
• Scheduling with Deadlines and Loss Functions
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Worst Case Analysis of Two Scheduling Algorithms
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• A New Insight into the Coffman–Graham Algorithm
• Optimal Preemptive Scheduling on Two-Processor Systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES