• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Exact and heuristic algorithms for the job shop scheduling problem with earliness and tardiness over a common due date.
【24h】

Exact and heuristic algorithms for the job shop scheduling problem with earliness and tardiness over a common due date.

机译：精确且启发式的解决方案，用于在常见到期日之前出现提前和拖延的车间调度问题。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the JIT approach in job shops. A dynamic programming procedure is developed to solve smaller instances of the problem, and a Multi-Agent Systems approach is developed and implemented to solve the problem for larger instances since this problem is known to be NP-Hard in a strong sense. A combinational auction-based approach using a Mixed-Integer Linear Programming (MILP) model to construct and evaluate the bids is proposed. The results showed that the proposed combinational auction-based algorithm is able to find optimal solutions for problems that are balanced in processing times across machines. A price discrimination process is successfully implemented to deal with unbalanced problems. The exact and heuristic procedures developed in this research are the first steps to create a structured approach to handle this problem and as a result, a set of benchmark problems will be available to the scheduling research community.
机译：调度对于生产和服务组织都是一项基本活动。随着竞争市场的兴起，及时生产（JIT）变得越来越重要，这是一种快速响应不断变化的市场力量的方法。由于他们的现实假设，车间生产环境在调度研究人员中获得了很多研究成果。这项研究开发了精确而启发式的方法和算法来解决车间作业调度问题，目的是在共同的到期日内将早期和拖延成本减至最低。最小化提前和拖延成本的目标功能抓住了JIT方法在车间的本质。开发了动态编程程序来解决问题的较小实例，并且开发并实施了多代理系统方法来解决较大实例的问题，因为从强烈的意义上来说，此问题被称为NP-Hard。提出了一种基于拍卖的组合方法，使用混合整数线性规划（MILP）模型来构建和评估出价。结果表明，所提出的基于拍卖的组合算法能够找到最佳解决方案，以解决跨机器处理时间平衡的问题。价格歧视程序已成功实施，以解决不平衡的问题。本研究中开发的精确而启发式的程序是创建用于处理此问题的结构化方法的第一步，因此，调度研究界可以使用一组基准问题。

著录项

  • 作者

    Bedoya-Valencia, Leonardo.;

  • 作者单位

    Old Dominion University.;

  • 授予单位 Old Dominion University.;
  • 学科 Engineering Industrial.; Operations Research.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 100 p.
  • 总页数 100
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 一般工业技术;运筹学;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号