.png){kind=icon}
返回
Parallel machine scheduling problems with common flow-allowance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2012.06.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In due-date assignment problems with a common flow-allowance, the job-dependent due-dates are determined as linear functions of the job processing times. This paper studies due-date and due-window assignment problems based on flow-allowance with a minmax objective function. We consider a setting of parallel identical machines. The problems are proved to be NP-hard, and efficient heuristic procedures and simple lower bounds are introduced. Worst case analysis is provided in both cases. Our numerical tests indicate that the heuristics produce extremely close-to-optimal schedules. Our procedures (heuristics and bounds) are extended to parallel uniform machines, and based on our numerical tests, the average optimality gaps remain very small. (c) 2012 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Parallel identical machines
Uniform machines
Flow-allowance
Due-date assignment
Due-window assignment
Minmax
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Scheduling a maintenance activity and due-window assignment based on common flow allowance根据公共流量津贴安排维护活动和到期窗口分配
PREAI
分享收藏Due-date assignment and single machine scheduling with compressible processing times具有可压缩处理时间的到期日分配和单机调度
PREAI
分享收藏Single machine common flow allowance scheduling with a rate-modifying activity具有速率修改活动的单机通用流量余量计划
PREAI
分享收藏Diverse regulatory activity of human heat shock proteins 60 and 70 on endotoxin-induced inflammation
PREAI
分享收藏OPTIMAL DUE DATE DETERMINATION AND SEQUENCING OF N-JOBS ON A SINGLE-MACHINE USING THE SLK METHOD
PREAI
分享收藏
查看更多内容