Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
From MaRDI portal
Publication:2066685
DOI10.1007/s10951-021-00702-wzbMath1480.90145OpenAlexW3200276323MaRDI QIDQ2066685
Publication date: 14 January 2022
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-021-00702-w
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- An efficient algorithm for finding ideal schedules
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- How useful are preemptive schedules?
- Ideal preemptive schedules on two processors
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Normal-form preemption sequences for an open problem in scheduling theory
- Parameterized complexity of machine scheduling: 15 open problems
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
- Schedules with a single preemption on uniform parallel machines
- Minimizing mean flow time for UET tasks
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Scheduling precedence graphs of bounded height
- Profile Scheduling of Opposing Forests and Level Orders
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized Algorithms
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Scheduling
This page was built for publication: Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
