.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Scheduling
Single-machine
Learning effect
Resource allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times具有到期日分配和依赖资源的处理时间的单机提前-迟到调度问题
PREAI
分享收藏Single-machine scheduling time-dependent jobs with resource-dependent ready times具有依赖于资源的就绪时间的单机调度依赖于时间的作业
PREAI
分享收藏
分享收藏
查看更多内容