Notes on a hierarchical scheduling problem on identical machines

DOI10.1016/J.IPL.2016.12.001zbMath1401.90075OpenAlexW2563150266MaRDI QIDQ506158

Hao Lin, Cheng He

Publication date: 31 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.12.001

zbMATH Keywords

approximation algorithmsworst-case ratioidentical machineshierarchical schedulingtotal flowtime

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Scheduling to minimize the maximum total completion time per machine
• How good are SPT schedules for fair optimality criteria
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Notes on a hierarchical scheduling problem on identical machines