.png){kind=icon}
返回
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2023.120191.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we address the Integrated Planning and Scheduling Problem (IPSP) on parallel and identical machines. Planning and scheduling are essential for the efficient management of supply chains. Although both pursue the same general objective, they are usually performed independently mostly because they relate to different timescales. As a consequence, the generated plans and schedules are typically sub-optimal from a global standpoint. The approaches followed in this paper explicitly consider the interdependence between the planning and scheduling activities by solving them simultaneously in an integrated way. We explore different heuristics based on variable neighborhood search procedures with new and specifically designed neighborhood structures relying on the properties of the IPSP. The quality of these approaches is evaluated through extensive computational experiments performed on a large set of benchmark instances. The results show that the proposed methods achieve high-quality solutions, with a substantially low computation time, outperforming other state-of-the-art results reported in the literature.
Keyword:
Production planning and scheduling
Variable neighborhood search
Identical parallel machines scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
A Two-Stage Cooperative Evolutionary Algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem具有特定问题知识的两阶段合作进化算法，用于无等待流水车间问题的节能调度
PREAI
分享收藏Simultaneous production and logistics operations planning in semicontinuous food industries半连续食品工业中的同时生产和物流运营计划
PREAI
分享收藏
查看更多内容