首页> 外文学位 >Lot size scheduling problem with two level setup cost/time structure.
【24h】

Lot size scheduling problem with two level setup cost/time structure.

机译:具有两级设置成本/时间结构的批量计划问题。

获取原文
获取原文并翻译 | 示例

摘要

We address the problem of scheduling production on a single capacitated processor when there are multiple product families with two level setup cost/time structure. The setup of the Family Lot Scheduling Problem (FLSP) has nonzero costs and times for both major setups between families and minor setups between products within a family. Families are defined by collecting products according to setup characteristics of the manufacturing process and products. Efficiency and savings can be achieved by coordinating the production on a family-by-family basis in order to reduce the number of major setup costs and times incurred.; In this dissertation, family lot size scheduling as an application of the Group Technology (GT) concept to production planning and scheduling has been proposed in order to get benefits from GT in the area of production and operations management.; To understand fundamental concepts in lot size scheduling, the literature of the Economic Lot Scheduling Problem (ELSP) is reviewed and solution methods identified and classified. We give a complete formal description of the generalized basic period algorithm for solving the ELSP. A heuristic method for solving the FLSP in a deterministic and stationary demand pattern is then developed and tested. First, a family schedule is created using aggregated data, and then schedules for products within families are obtained.; We next treat the FLSP when demand varies over time in a deterministic manner. Depending upon assumptions about the sequence dependent nature of family setup, FLSP is classified and formulated as a mixed-integer programming model. For a particular setup structure, a heuristic algorithm is developed and its performance evaluated using a set of test problems.; Finally, the FLSP under stochastic demand is considered. The limited literature of the stochastic ELSP is reviewed and extension to the stochastic FLSP discussed.
机译:当存在具有两级设置成本/时间结构的多个产品系列时,我们解决了在单个电容器处理器上安排生产的问题。家族批次计划问题(FLSP)的设置对于族之间的主要设置和族内产品之间的次要设置的成本和时间都是非零的。通过根据制造过程和产品的设置特性收集产品来定义家庭。通过逐个家庭协调生产,以减少主要安装成本的数量和时间,可以实现效率和节约。本文提出了将批量技术作为组群技术概念应用于生产计划和调度的一种方法,以期从生产和运营管理领域中受益。为了理解批量计划中的基本概念,回顾了经济批量计划问题(ELSP)的文献,并对解决方法进行了识别和分类。我们对解决ELSP的广义基本周期算法给出了完整的形式化描述。然后开发并测试了一种确定性和固定需求模式下求解FLSP的启发式方法。首先,使用汇总数据创建家庭计划表,然后获取家庭产品清单。接下来,当需求随时间以确定性方式变化时,我们对待FLSP。根据有关家庭设置的序列依赖性的假设,将FLSP分类并表述为混合整数编程模型。对于特定的设置结构,开发了一种启发式算法,并使用一系列测试问题来评估其性能。最后,考虑了随机需求下的FLSP。回顾了随机ELSP的有限文献,并讨论了对随机FLSP的扩展。

著录项

  • 作者

    Chung, Jae Hyun.;

  • 作者单位

    Georgia Institute of Technology.;

  • 授予单位 Georgia Institute of Technology.;
  • 学科 Engineering Industrial.
  • 学位 Ph.D.
  • 年度 1991
  • 页码 128 p.
  • 总页数 128
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 一般工业技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号