ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST
From MaRDI portal
Publication:3439890
DOI10.1142/S0217595907001231zbMath1121.90058MaRDI QIDQ3439890
Shuguang Han, Yiwei Jiang, Yong He
Publication date: 21 May 2007
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595907001231
90B35: Deterministic scheduling theory in operations research
Related Items
Online algorithms for scheduling with machine activation cost on two uniform machines, Scheduling games on uniform machines with activation cost
Cites Work
- On-line scheduling revisited
- Preemptive online algorithms for scheduling with machine cost
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Better Online Algorithms for Scheduling with Machine Cost
- Improved Bounds for the Online Scheduling Problem
- Bounds for Certain Multiprocessing Anomalies