Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines

作     者：Li, Shuguang 

作者机构：Shandong Technol & Business Univ Sch Comp Sci & Technol Yantai 264005 Peoples R China 

出 版 物：《MATHEMATICAL BIOSCIENCES AND ENGINEERING》 (Math. Biosci. Eng.)

年 卷 期：2022年第19卷第11期

页      面：10731-10740页

核心收录：

学科分类：0710[理学-生物学] 07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Natural Science Foundation of Shandong Province China [ZR2020MA030] 

主　　题：scheduling uniform parallel batch machines processing set restrictions equal job lengths exact algorithms 

摘      要：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.