An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness

DOI10.1023/A:1018917426360zbMath0908.90178OpenAlexW265685072MaRDI QIDQ1265894

Publication date: 18 March 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018917426360

zbMATH Keywords

scheduling theory makespan approximate solution precedence constraints worst-case analysis maximum lateness parallel identical processors unit execution times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors ⋮ The resource-constrained modulo scheduling problem: an experimental study ⋮ Scheduling UET-UCT tasks: Branch-and-bound search in the priority space ⋮ An iterative algorithm for scheduling UET tasks with due dates and release times. ⋮ Performance of Garey-Johnson algorithm for pipelined typed tasks systems ⋮ Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness ⋮ PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES ⋮ Scheduling UET-UCT outforests to minimize maximum lateness ⋮ The worst-case analysis of the Garey-Johnson algorithm ⋮ Scheduling with precedence constraints: Worst-case analysis of priority algorithms

This page was built for publication: An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness