A Linear Time Exact Algorithm for Scheduling Unit-processing-time-jobs with Sizes 1 or k

被引：0
|
作者：
Xin, Xiao [1 ]
Mu, Guohua [1 ]
Mou, Min [1 ]
机构：
[1] Shandong Inst Business & Technol, Coll Foreign Studies, Yantai 264005, Peoples R China
来源：
PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017) | 2017年 / 123卷
关键词：
Scheduling; Batch machines; Job sizes; Makespan; Linear time exact algorithm; MACHINE;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The problem of scheduling jobs with sizes on batch machines is considered. Each machine can process several jobs as a batch simultaneously as long as the total size of these jobs does not exceed the capacity of the machine. The processing time of a batch is defined to be the longest processing time of the jobs in the batch. The goal is to minimize makespan, i.e., the maximum job completion time. It has been known to be strongly NP-hard. A linear time exact algorithm is presented for a special case where all the jobs have processing times 1 and sizes 1 or k (k is not fixed).
引用
收藏
页码：1760 / 1763
页数：4
相关论文
共 50 条
12345