.png){kind=icon}
Return
Single-machine scheduling with learning effect and resource-dependent processing times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2010.06.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. We analyse the problem with two different processing time functions. For each combination of these, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Single-machine
Learning effect
Resource allocation
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
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
ShareSaveShareSave
View more