An efficient algorithm for finding ideal schedules
From MaRDI portal
Publication:766186
DOI10.1007/S00236-011-0146-7zbMATH Open1262.68022OpenAlexW2095614028MaRDI QIDQ766186FDOQ766186
Authors: Dariusz Dereniowski, E. G. jun. Coffman, Wieslaw Kubiak 
Publication date: 23 March 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-011-0146-7
Recommendations
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- scientific article; zbMATH DE number 3883931
- Ideal preemptive schedules on two processors
- scientific article; zbMATH DE number 2221458
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
- scientific article; zbMATH DE number 1156619
- Nearly on line scheduling of preemptive independent tasks
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Normal-form preemption sequences for an open problem in scheduling theory
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Theorem on Boolean Matrices
- Optimal scheduling for two-processor systems
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Two-Processor Scheduling with Start-Times and Deadlines
- Optimal Sequencing of Two Equivalent Processors
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Ideal preemptive schedules on two processors
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
Cited In (10)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
- Ideal schedules in parallel machine settings
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Ideal preemptive schedules on two processors
- An algorithm for constructing an optimal structural schedule
- Efficient algorithms for periodic scheduling
- Normal-form preemption sequences for an open problem in scheduling theory
Uses Software
This page was built for publication: An efficient algorithm for finding ideal schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766186)
