.png){kind=icon}
Return
Single-machine group scheduling with resource allocation and learning effect
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2010.10.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Group technology
Resource allocation
Learning effect
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveScheduling problems with deteriorating jobs and learning effects including proportional setup times
PREAI
ShareSaveShareSaveConvex resource allocation for minimizing the makespan in a single machine with job release dates
PREAI
ShareSaveShareSave View more