Improved bounds on relaxations of a parallel machine scheduling problem
From MaRDI portal
Recommendations
- Lower bounds for parallel machine scheduling problems
- Tight bounds for the identical parallel machine scheduling problem
- Improved approximation schemes for scheduling unrelated parallel machines
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- scientific article; zbMATH DE number 1187165
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- An approximation algorithm for a parallel machine scheduling problem with constraints
- On the exact solution of a large class of parallel machine scheduling problems
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- An improved algorithm for parallel machine scheduling under additional resource constraints
Cited in
(5)- Measuring the slack between lower bounds for scheduling on parallel machines
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
This page was built for publication: Improved bounds on relaxations of a parallel machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383802)
