Single-machine group scheduling with resource allocation and learning effect |
| |
| Authors: | Zhanguo Zhu Linyan Sun Feng Chu Ming Liu |
| |
| Affiliation: | 1. 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;2. Laboratoire d’informatique, biologie intégrative et systèmes complexes (IBISC), FRE CNRS 3190, Université d’Evry Val d’Essonne, 40 Rue du Pelvoux, CE1455 Courcouronnes, 91020 Evry Cedex, France;3. School of Economics & Management, Tongji University, Shanghai 200092, PR China;4. 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 single-machine scheduling problems under the consideration of learning effect and resource allocation in a group technology environment. In the proposed model of this paper the actual processing times of jobs depend on the job position, the group position, and the amount of resource allocated to them concurrently. Learning effect and two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost, and the weighted sum of total completion time and total resource cost. We show that the problems for minimizing the weighted sum of makespan and total resource cost remain polynomially solvable. We also prove that the problems for minimizing the weighted sum of total completion time and total resource cost have polynomial solutions under certain conditions. |
| |
| Keywords: | Scheduling Group technology Resource allocation Learning effect |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
