Comparison of three classical lower bounds for the parallel machines scheduling problem

Cites work

A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
Adjustment of heads and tails for the job-shop problem
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
An O(n^2) algorithm for time-bound adjustments for the cumulative scheduling problem
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
Constraint-based scheduling: Applying constraint programming to scheduling problems.
Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
Energetic reasoning revisited: Application to parallel machine scheduling
scientific article; zbMATH DE number 3883931 (Why is no real title available?)
scientific article; zbMATH DE number 3174052 (Why is no real title available?)
scientific article; zbMATH DE number 3531181 (Why is no real title available?)
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Minimizing makespan on parallel machines subject to release dates and delivery times
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
Optimal Scheduling of Tasks on Identical Parallel Processors
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Satisfiability tests and time-bound adjustments for cumulative scheduling problems
Some simple scheduling algorithms
The one-machine sequencing problem

This page was built for publication: Comparison of three classical lower bounds for the parallel machines scheduling problem

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