Measuring the slack between lower bounds for scheduling on parallel machines

Cites Work

A preemptive bound for the resource constrained project scheduling problem
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
A theorem on flows in networks
Energetic reasoning revisited: Application to parallel machine scheduling
Scheduling jobs with release dates and tails on identical machines to minimize the makespan
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
Nearly on line scheduling of preemptive independent tasks
Constraint-based scheduling: Applying constraint programming to scheduling problems.
A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Satisfiability tests and time-bound adjustments for cumulative scheduling problems
Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
An updated survey of variants and extensions of the resource-constrained project scheduling problem
Scheduling with deadlines and loss functions
Preemptive Scheduling with Release Times, Deadlines, and Due Times
Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem

This page was built for publication: Measuring the slack between lower bounds for scheduling on parallel machines

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