Single-machine group scheduling with resource allocation and learning effect

✍ Scribed by Zhanguo Zhu; Linyan Sun; Feng Chu; Ming Liu

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 299 KB
• Volume: 60
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/j.cie.2010.10.012

✦ Synopsis

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.