.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Scheduling
Group technology
Resource allocation
Learning effect
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times具有到期日分配和依赖资源的处理时间的单机提前-迟到调度问题
.png){kind=icon}
PREAI
分享收藏
分享收藏Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect具有DeJong学习效果的并行机调度的精确启发式算法
PREAI
分享收藏Scheduling problems with deteriorating jobs and learning effects including proportional setup times
PREAI
分享收藏Convex resource allocation for minimizing the makespan in a single machine with job release dates
PREAI
分享收藏
查看更多内容