首页> 外文OA文献 >Integrated capacitated lot sizing and scheduling problems in a flexible flow line
【2h】

Integrated capacitated lot sizing and scheduling problems in a flexible flow line

机译:灵活流水线中的集成容量批量调整和调度问题

摘要

The lot sizing and scheduling problem in a Flexible Flow Line (FFL) has extensive real-world applications in many industries. An FFL consists of several production stages in series with parallel machines at each stage. The decisions to be taken are the determination of production quantities (lots), machine assignments and production sequences (schedules) on each machine at each stage in an FFL. Lot sizing and scheduling problems are closely interrelated. Solving them separately and then coordinating their interdependencies is often ineffective. However due to their complexity, there is a lack of mathematical modelling and solution procedures in the literature to combine and jointly solve them. Up to now most research has been focused on combining lotsizing and scheduling for the single machine configuration, and research on other configurations like FFL is sparse. This thesis presents several mathematical models with practical assumptions and appropriate algorithms, along with experimental test problems, for simultaneously lotsizing and scheduling in FFL. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL). The objective is to satisfy varying demand over a finite planning horizon with minimal inventory, backorder and production setup costs. The problem is complex as any product can be processed on any machine, but these have different processing rates and sequence-dependent setup times & costs. As a result, even finding a feasible solution of large problems in reasonable time is impossible. Therefore the heuristic solution procedure named Adaptive Simulated Annealing (ASA), with four well-designed initial solutions, is designed to solve GLSP-FFL. A further original contribution of this study is to design linear mixed-integer programming (MILP) formulations for this problem, incorporating all necessary features of setup carryovers, setup overlapping, non-triangular setup while allowing multiple lot production per periods, lot splitting and sequencing through ATSP-adaption based on a variety of subtour elimination.
机译:柔性流水线(FFL)中的批量确定和计划问题在许多行业中都有广泛的实际应用。 FFL由几个生产阶段组成,每个生产阶段均与并行机器串联。要做出的决定是在FFL的每个阶段确定每台机器上的生产数量(批次),机器分配和生产顺序(时间表)。批量大小和调度问题紧密相关。分别解决它们,然后协调它们的相互依赖性通常是无效的。然而,由于它们的复杂性,文献中缺乏数学模型和求解程序来组合和共同求解它们。到目前为止,大多数研究都集中在为单个机器配置组合批量处理和调度方面,而对其他配置(如FFL)的研究很少。本文提出了一些带有实际假设和适当算法的数学模型,以及实验测试问题,用于同时进行FFL的批量和调度。这个问题称为“灵活流水线中的一般批量确定和计划问题”(GLSP-FFL)。目的是在有限的计划范围内以最小的库存,缺货和生产设置成本满足不断变化的需求。问题很复杂,因为任何产品都可以在任何机器上进行处理,但是它们具有不同的处理速率以及与序列有关的设置时间和成本。结果,即使在合理的时间内找到大问题的可行解决方案也是不可能的。因此,设计了具有四个精心设计的初始解决方案的启发式解决方案程序Adaptive Simulated Annealing(ASA),以解决GLSP-FFL。这项研究的另一个原始贡献是针对此问题设计线性混合整数编程(MILP)公式,其中包括设置结转,设置重叠,非三角设置的所有必需功能,同时允许每个时期进行多个批量生产,批量拆分和排序通过基于多种子行程消除的ATSP自适应。

著录项

  • 作者

    Mahdieh M;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 English
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号