|
|||||
|
|
Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity |
|
| Authors: | Zhanguo Zhu Feng Chu Linyan Sun Ming Liu |
| Institution: | 1. College of Economics & Management, Nanjing Agricultural University, Nanjing 210095, PR China;2. School of Management, State Key Laboratory for Mechanical Manufacturing Systems Engineering, The Key Lab of the Ministry of Education for Process Control and Efficiency Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi Province 710049, PR China;3. Laboratoire d’informatique, Biologie Intégrative et Systèmes Complexes (IBISC), EA 4526, Université d’Evry Val d’Essonne, 91020 Evry Cedex, France;4. School of Economics & Management, Tongji University, Shanghai 200092, PR China;5. Université de technologie de Troyes, Institut Charles Delaunay, FRE CNRS 2848, Laboratoire d’optimisation des systèmes industriels (LOSI), 12 rue Marie Curie – BP 2060, 10010 Troyes Cedex, France |
| Abstract: | This paper addresses a single machine scheduling problem in which the actual job processing times are determined by resource allocation function, its position in a sequence and a rate-modifying activity simultaneously. We discuss two objective functions with two resource allocation functions under the consideration of a rate-modifying activity. We show that the problems are solvable in O(n4) time for a linear resource allocation function and are solvable in O(n2logn) time for a convex resource allocation function. |
| Keywords: | Scheduling Rate-modifying activity Resource allocation Learning effect |
| 本文献已被 ScienceDirect 等数据库收录！ | |