Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times

DOI10.1016/S0167-6377(97)00053-9zbMath0912.90175OpenAlexW2046677007MaRDI QIDQ1271384

Enyu Yao, Guo-Hui Lin, Yong He

Publication date: 18 February 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00053-9

zbMATH Keywords

matchingmultiprocessor schedulingapproximationLPTweighting functionworst-case performance ratiogeneralized versionclassical parallel machine schedulingminimum machine completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Parallel-machine scheduling with non-simultaneous machine available time ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Multi-machine scheduling with deteriorating jobs and scheduled maintenance ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• The exact LPT-bound for maximizing the minimum completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Bounds on Multiprocessing Timing Anomalies