Scheduling jobs with simultaneous considerations of controllable processing times and learning effect

被引：6
|
作者：
Li, Lin [1 ]
Yan, Ping [2 ]
Ji, Ping [3 ]
Wang, Ji-Bo [1 ,3 ]
机构：
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Liaoning, Peoples R China
[2] Shenyang Aerosp Univ, Sch Econ & Management, Shenyang 110136, Liaoning, Peoples R China
[3] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Kowloon, Hong Kong, Peoples R China
来源：
NEURAL COMPUTING & APPLICATIONS | 2018年 / 29卷 / 11期
基金：
中国国家自然科学基金;
关键词：
Scheduling; Single machine; Controllable processing times; Job-dependent learning curves; SINGLE-MACHINE SYSTEMS; COMMON FLOW ALLOWANCE; DUE-DATES; ASSIGNMENT; MULTIPLE; MAINTENANCE;
D O I：
10.1007/s00521-016-2638-4
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given.
引用
收藏
页码：1155 / 1162
页数：8
相关论文
共 50 条
12345