Lower bounds for parallel machine scheduling problems
From MaRDI portal
Recommendations
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Tight bounds for the identical parallel machine scheduling problem
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Lower bounds for scheduling on identical parallel machines with heads and tails
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
Cited in
(25)- Measuring the slack between lower bounds for scheduling on parallel machines
- Range of lower bounds
- Lower bounds on precedence-constrained scheduling for parallel processors.
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Bounds for naive multiple machine scheduling with release times and deadlines
- Improved bounds on relaxations of a parallel machine scheduling problem
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
- Dynamic scheduling of patients in emergency departments
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Tight bounds for the identical parallel machine scheduling problem
- Multi-machine scheduling lower bounds using decision diagrams
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
- On lower bounds on the minimum maximum lateness on one machine subject to release date
- scientific article; zbMATH DE number 4191384 (Why is no real title available?)
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Lower bounds for scheduling on identical parallel machines with heads and tails
- On lower and upper bounds for single machine parallel batch scheduling
This page was built for publication: Lower bounds for parallel machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947338)
