Single-machine group scheduling with resource allocation and learning effect - Université d'Évry Access content directly
Journal Articles Computers & Industrial Engineering Year : 2011

Single-machine group scheduling with resource allocation and learning effect

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.

Dates and versions

hal-00653643 , version 1 (19-12-2011)

Identifiers

Cite

Zhanguo Zhu, Linyan Sun, Feng Chu, Ming Liu. Single-machine group scheduling with resource allocation and learning effect. Computers & Industrial Engineering, 2011, 60 (1), pp.148-157. ⟨10.1016/j.cie.2010.10.012⟩. ⟨hal-00653643⟩
184 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More