.png){kind=icon}
返回
Parallel-Batch Scheduling With Deterioration and Group Technology
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2936004.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Parallel-batch scheduling with deterioration and group technology is a modern scheduling model, in which the jobs are classified into groups by the similar production requirements, and setup time, which may be fixed or deterioration function of the starting time, is required between jobs of different groups. We consider this scheduling to minimize the makespan in this paper. Based on Fully Batching Longest Deteriorating Rate, we show that our two single-machine scheduling problems are solved in polynomial time. Procedure Partition (A, F, rho) is useful for designing algorithm in combinational optimization. We use this procedure to present fully polynomial time approximation schemes for our two parallel-machine scheduling problems, which is the best algorithm as its' objective value can be fully close to the optimal value.
Keyword:
Parallel-batch scheduling
deterioration
group technology
fully polynomial time approximation scheme
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏分享收藏Parallel-machine scheduling with simple linear deterioration to minimize total completion time具有简单线性恶化的并行机调度，以最大程度地减少总完成时间OAAI
OAAI分享收藏Artificial-Molecule-Based Chemical Reaction Optimization for Flow shop Scheduling Problem With Deteriorating and Learning Effects.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容