An iterative algorithm for scheduling UET tasks with due dates and release times.

DOI10.1016/S0377-2217(02)00770-1zbMath1059.90078MaRDI QIDQ1399585

Yakov Zinder

Publication date: 30 July 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Schedulingprecedence constraintsworst-case analysisparallel processorsmaximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors ⋮ Scheduling preparation of doses for a chemotherapy service ⋮ Scheduling UET-UCT tasks: Branch-and-bound search in the priority space ⋮ Performance of Garey-Johnson algorithm for pipelined typed tasks systems ⋮ The worst-case analysis of the Garey-Johnson algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• NP-complete scheduling problems
• An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Two-Processor Scheduling with Start-Times and Deadlines
• Worst Case Analysis of Two Scheduling Algorithms
• A New Insight into the Coffman–Graham Algorithm
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES

This page was built for publication: An iterative algorithm for scheduling UET tasks with due dates and release times.