.png){kind=icon}
返回
Simultaneous lotsizing and scheduling on parallel machines
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00373-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the simultaneous lotsizing and scheduling of several products on non-identical parallel production lines (heterogeneous machines). The limited capacity of the production lines may be further reduced by sequence dependent setup times. Deterministic, dynamic demand of standard products has to be met without back-logging with the objective of minimizing sequence dependent setup, holding and production costs. The problem is heuristically solved by combining the local search metastrategies threshold accepting (TA) and simulated annealing (SA), respectively, with dual reoptimization. Such a solution approach has already proved to be successful for the single machine case. The solution quality and computational performance of the new heuristics are tested by means of real-world problems gathered from industry. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
metaheuristics
integer programming
simultaneous lotsizing and scheduling
network flows
production
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Simultaneous lotsizing and scheduling by combining local search with dual reoptimization通过将局部搜索与双重重新优化相结合来同时进行lotsizing和调度
PREAI
分享收藏分享收藏分享收藏
分享收藏
查看更多内容