.png){kind=icon}
返回
Modeling lotsizing and scheduling problems with sequence dependent setups
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.05.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several production environments require simultaneous planing of sizing and scheduling of sequences of production lots. Integration of sequencing decisions in lotsizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to real world problems. A two-dimensional classification framework is proposed to survey and classify the main modeling approaches to integrate sequencing decisions in discrete time lotsizing and scheduling models. The Asymmetric Traveling Salesman Problem can be an important source of ideas to develop more efficient models and methods to this problem. Following this research line, we also present a new formulation for the problem using commodity flow based subtour elimination constraints. Computational experiments are conducted to assess the performance of the various models, in terms of running times and upper bounds, when solving real-word size instances. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Production planning
Lotsizing and scheduling
Mixed-integer programming
Sequence-dependent setups
Computational benchmark
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Single machine multi-product capacitated lot sizing with sequence-dependent setups具有序列相关设置的单机多产品容量批量
OAAI
OAAI分享收藏Simultaneous lotsizing and scheduling by combining local search with dual reoptimization通过将局部搜索与双重重新优化相结合来同时进行lotsizing和调度
PREAI
分享收藏
查看更多内容