Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time |
| |
Authors: | Li-Yan Wang Xue Huang Ping Ji En-Min Feng |
| |
Affiliation: | 1. School of Mathematical Sciences, Dalian University of Technology, Dalian, 116024, China 2. School of Science, Shenyang Aerospace University, Shenyang, Liaoning, 110136, China 3. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
|
| |
Abstract: | Wang et al. (J Operat Res Soc 62: 1898–1902, 2011) studied the m identical parallel-machine and unrelated parallel-machine scheduling with a deteriorating maintenance activity to minimize the total completion time. They showed that each problem can be solved in O(n 2m+3) time, where n is the number of jobs. In this note, we discuss the unrelated parallel-machine setting and show that the problem can be optimally solved by a lower order algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|