首页> 外文学位 >Modeling and analysis of the batch production scheduling problem for perishable products with setup times.
【24h】

Modeling and analysis of the batch production scheduling problem for perishable products with setup times.

机译:具有设置时间的易腐产品的批量生产计划问题的建模和分析。

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

摘要

The focus of this dissertation is problem of batch production scheduling for perishable products with setup times, with the main applications in answering production planning problems faced by manufacturers of perishable products, such as beers, vaccines and yoghurts. The benefits of effective production plans can help companies reduce their total costs substantially to gain competitive advantages without reduction of service level in a globalize economy.; We develop concepts and methodologies that are applied to two fundamental problems: (i) the batch production scheduling problem for perishable products with sequence-independent setup times (BPP-SI) and (ii) the batch production scheduling problem for perishable products with sequence-dependent setup times (BPP-SD).; The problem is that given a set of forecast demand for perishable products to be produced by a set of parallel machines in single stage batch production, with each product having fixed shelf-life times and each machine requiring setup times before producing a batch of product, find the master production schedule which minimizes total cost over a specified time horizon. We present the new models for both problems by formulating them as a Mixed Integer Program (MIP) in discrete time. Computational studies on BPP-SI and BPP-SD for industrial problems are presented. In order to efficiently solve the large BPP-SI problems in practice, we develop five efficient heuristics. The extensive computational results show that the developed heuristics can obtain good solutions for very large problem sizes and require a very short amount of computational time.
机译:本文的重点是具有设置时间的易腐产品的批量生产计划问题,主要应用于解决易腐产品(如啤酒,疫苗和酸奶)制造商面临的生产计划问题。有效的生产计划所带来的好处可以帮助企业在不降低全球化经济中服务水平的前提下,大幅降低总成本以获取竞争优势。我们开发了适用于两个基本问题的概念和方法:(i)具有序列独立设置时间(BPP-SI)的易腐产品的批量生产计划问题,以及(ii)具有序列-相关的建立时间(BPP-SD)。问题是,鉴于对一组预测的需求,这些预测需求是由一组并行机器在单阶段批量生产中生产的,每个产品具有固定的保质期,并且每台机器在生产一批产品之前都需要准备时间,查找主生产计划,以在指定的时间范围内将总成本降至最低。通过在离散时间内将它们表示为混合整数程序(MIP),我们提出了针对这两个问题的新模型。提出了针对工业问题的BPP-SI和BPP-SD的计算研究。为了在实践中有效解决大型BPP-SI问题,我们开发了五种有效的启发式方法。大量的计算结果表明,开发的启发式方法可以针对非常大的问题大小获得良好的解决方案,并且需要非常短的计算时间。

著录项

  • 作者

    Charnprasitphon, Aphiwat.;

  • 作者单位

    Georgia Institute of Technology.;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号