.png){kind=icon}
返回
Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2020.106799.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents two well-known meta-heuristics which are Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) to solve the dynamic integrated process planning, scheduling and due date assignment problem (DIPPSDDA) in which jobs arrive to the shop floor randomly. In this study, it is aimed to find the best combination of dispatching rule, due date assignment rule and route of all job with the objective of minimizing earliness, tardiness and due-dates of each jobs. 8 different size shop floors for the comparison of the GA and ACO algorithms performances have been developed. As a result of the experimental study, it was concluded that ACO algorithm outperformed GA algorithm. In addition, it has been suggested that integrated approaches can provide more global manufacturing efficiency than individual approaches.
Keyword:
Integrated process planning and scheduling
Scheduling with due date assignment
Weighted Dynamic Scheduling
Integrated process planning
Dynamic scheduling and due date assignment
Ant Colony Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem求解模糊柔性作业车间调度问题的混合人工蜂群算法
PREAI
分享收藏分享收藏
查看更多内容