Approximate algorithms for unrelated machine scheduling to minimize makespan

DOI10.3934/jimo.2016.12.771zbMath1327.90273OpenAlexW2551805793MaRDI QIDQ747046

Cuixia Miao, Xianzhao Zhang, Dong-lei Du, Da-Chuan Xu

Publication date: 22 October 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2016.12.771

zbMATH Keywords

linear programmingschedulingapproximation algorithmroundingunrelated parallel machine

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Machine scheduling with resource dependent processing times
• An approximation algorithm for the generalized assignment problem
• Graph balancing: a special case of scheduling unrelated parallel machines
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
• The Design of Approximation Algorithms
• Parallel-Machine Scheduling Problem under the Job Rejection Constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Santa Claus Schedules Jobs on Unrelated Machines
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines

This page was built for publication: Approximate algorithms for unrelated machine scheduling to minimize makespan