A polynomial-time approximation scheme for maximizing the minimum machine completion time

1997/05/01 by Gerhard J. Woeginger · 1 citation
Engineering · #Advanced Manufacturing and Logistics Optimization #Optimization and Packing Problems #Scheduling and Optimization Algorithms

paper · doi:10.1016/s0167-6377(96)00055-7

crossref issued 1997/05/01 · crossref published 1997/05/01 · crossref published-print 1997/05/01 · openalex publication_date 1997/05/01 · crossref created 2002/07/25 · crossref deposited 2019/04/27 · openalex created_date 2025/10/10 · crossref indexed 2026/04/25 · openalex updated_date 2026/07/29

Citations

• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• The exact LPT-bound for maximizing the minimum completion time
• Using dual approximation algorithms for scheduling problems theoretical and practical results

Cited by

• Computing desirable partitions in additively separable hedonic games
• Identical-machines scheduling [wikipedia]