Abstract
<abstract><p>We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algorithms for minimizing makespan.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference45 articles.
1. 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
2. P. Brucker, Scheduling Algorithms, 5th edition, Springer, 2007.
3. M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness (michael r. garey and david s. johnson), SIAM Rev., 24 (1982), 90. https://doi.org/10.1137/1024022
4. E. L. Lawler, J. K. Lenstra, A. R. Kan, D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handb. Oper. Res. Manage. Sci., 4 (1993), 445–522. https://doi.org/10.1016/S0927-0507(05)80189-6
5. J. Y. T. Leung, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, 2004.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献