A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
From MaRDI portal
Publication:342416
DOI10.1016/j.cor.2016.03.008zbMath1349.90395OpenAlexW2339787033MaRDI QIDQ342416
Stefan Schwerdfeger, Rico Walter
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.03.008
Related Items (3)
Improved algorithms to minimize workload balancing criteria on identical parallel machines ⋮ Exact and meta-heuristic approaches for the production leveling problem ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
Cites Work
- Unnamed Item
- Comparing the minimum completion times of two longest-first scheduling-heuristics
- A greedy heuristic for 3-partitioning with similar elements
- A performance guarantee for the greedy set-partitioning algorithm
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
- Maximizing the minimum completion time on parallel machines
- Approximation schemes for scheduling on parallel machines
- A tight upper bound for the \(k\)-partition problem on ideal sets
- Tighter bounds on a heuristic for a partition problem
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Partitioning under the \(L_p\) norm
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Comparing the effectiveness of workload balancing objectives in FMS loading
This page was built for publication: A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
