scientific article
From MaRDI portal
Publication:3840371
zbMath0911.90208MaRDI QIDQ3840371
Hoogeveen, J. A., Gerhard J. Woeginger, Petra Schuurman
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
weightsdeadlinesunrelated machinesflow shopsopen shopsjob release datesnon-approximability resultstotal job completion time
Related Items (18)
Scheduling Bidirectional Traffic on a Path ⋮ General scheduling non-approximability results in presence of hierarchical communications ⋮ Complexity and approximation for precedence constrained scheduling problems with large communication delays ⋮ On a local protocol for concurrent file transfers ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ Flow shops with WIP and value added costs ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Order Scheduling Models: Hardness and Algorithms ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ On the approximability of an interval scheduling problem ⋮ Combinatorial algorithms for data migration to minimize average completion time ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ A PTAS for the average weighted completion time problem on unrelated machines. ⋮ Approximation algorithms for shop scheduling problems with minsum objective
This page was built for publication:
