Performance ratios of the Karmarkar-Karp differencing method
From MaRDI portal
Publication:867023
DOI10.1007/S10878-006-9010-ZzbMath1112.90032OpenAlexW2083941921MaRDI QIDQ867023
Wil Michiels, Jan van Leeuwen, Jan H. M. Korst, Emile H. L. Aarts
Publication date: 14 February 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9010-z
Related Items (4)
The longest processing time rule for identical parallel machines revisited ⋮ Computer-assisted proof of performance ratios for the differencing method ⋮ A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber ⋮ Bicriteria robotic operation allocation in a flexible manufacturing cell
Cites Work
- Unnamed Item
- Unnamed Item
- On the exact upper bound for the Multifit processor scheduling algorithm
- The rate of convergence to optimality of the LPT rule
- A note on the average-case behavior of a simple differencing method for partitioning
- A complete anytime algorithm for number partitioning
- The modified differencing method for the set partitioning problem with cardinality constraints
- Easily searched encodings for number partitioning
- Problem space local search for number partitioning
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Worst-case analysis of the differencing method for the partition problem
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Performance ratios of the Karmarkar-Karp differencing method
