Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

Recommendations

A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
On-line scheduling on partial batch parallel machines with chains precedence constraints
Online scheduling of equal-processing-time task systems
On-line scheduling with precedence constraints
Online scheduling of parallel jobs with preemption on two identical machines

Cites work

A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
An optimal online algorithm for scheduling two machines with release times
Online Scheduling of Precedence Constrained Tasks
Online scheduling of equal-processing-time task systems
Optimal scheduling for two-processor systems
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
Scheduling chain-structured tasks to minimize makespan and mean flow time
Scheduling identical jobs with chain precedence constraints on two uniform machines
Scheduling on identical machines: How good is LPT in an on-line setting?
Scheduling three chains on two parallel machines

Cited in

(5)

On-line scheduling on partial batch parallel machines with chains precedence constraints
Online Scheduling of Precedence Constrained Tasks
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
On-line scheduling with precedence constraints

This page was built for publication: Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721932)