Abstract
<abstract><p>The problem of minimizing makespan (maximum completion time) on uniform machines with restricted assignment is considered. The machines differ in their speeds and functionalities. Each job has a set of machines to which it can be assigned, called its processing set. The goal is to finish the jobs as soon as possible. There exist 4/3-approximation algorithms for the cases of inclusive and tree-hierarchical assignment restrictions, under an assumption that machines with higher capabilities also run at higher speeds. We eliminate the assumption and present algorithms with approximation ratios 2 and 4/3 for both cases.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference25 articles.
1. B. Chen, C. N. Potts, G. J. Woeginger, A review of machine scheduling: Complexity, algorithms and approximability, in Handbook of combinatorial optimization, Springer, (1998), 1493–1641. https://doi.org/10.1007/978-1-4613-0303-9_25
2. J. Y. Leung, Handbook of scheduling: algorithms, models, and performance analysis, CRC Press, 2004.
3. M. Drozdowski, Classic scheduling theory, in Scheduling for Parallel Processing, Springer, (2009), 55–86.
4. R. L. Graham, E. L. Lawler, J. K. Lenstra, A. R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5 (1979), 287–326. https://doi.org/10.1016/S0167-5060(08)70356-X
5. P. Brucker, Scheduling Algorithms, fifth edition, Springer, 2007.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献