Flowshop scheduling of deteriorating jobs on dominating machines |
| |
| Authors: | CT Ng J-B Wang TCE Cheng SS Lam |
| |
| Affiliation: | aDepartment of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong SAR;bSchool of Science, Shenyang Aerospace University, Shenyang 110136, People’s Republic of China;cLee Shau Kee School of Business & Administration, The Open University of Hong Kong, Homantin, Kowloon, Hong Kong SAR |
| |
| Abstract: | In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e., jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration. |
| |
| Keywords: | Scheduling Flowshop Deteriorating jobs Dominating machines No-wait No-idle |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
