...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
【24h】

Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

机译：在不同的准备时间和任意的作业大小下，使并行批处理机器上的制造跨度最小化

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

摘要

This paper considers the parallel batch processing machine scheduling problem which involves the constraints of unequal ready times, non-identical job sizes, and batch dependent processing times in order to sequence batches on identical parallel batch processing machines with capacity restrictions. This scheduling problem is a practical generalisation of the classical parallel batch processing machine scheduling problem, which has many real-world applications, particularly, in the aging test operation of the module assembly stage in the manufacture of thin film transistor liquid crystal displays (TFT-LCD). The objective of this paper is to seek a schedule with a minimum total completion time for the parallel batch processing machine scheduling problem. A mixed integer linear programming (MILP) model is proposed to optimise the scheduling problem. In addition, to solve the MILP model more efficiently, an effective compound algorithm is proposed to determine the number of batches and to apply this number as one parameter in the MILP model in order to reduce the complexity of the problem. Finally, three efficient heuristic algorithms for solving the large-scale parallel batch processing machine scheduling problem are also provided.
机译：本文考虑并行批处理机的调度问题，该问题涉及准备时间不相等，作业大小不相同以及与批处理有关的处理时间的限制，以便在具有容量限制的相同并行批处理机上对批进行排序。此调度问题是经典并行批处理机器调度问题的实际概括，它具有许多实际应用，尤其是在制造薄膜晶体管液晶显示器（TFT- LCD）。本文的目的是为并行批处理机器的调度问题寻找具有最短总完成时间的调度。提出了一种混合整数线性规划（MILP）模型来优化调度问题。此外，为了更有效地求解MILP模型，提出了一种有效的复合算法来确定批次数，并将该数量作为MILP模型中的一个参数应用，以降低问题的复杂性。最后，还提供了三种有效的启发式算法来解决大规模并行批处理机的调度问题。

著录项

  • 来源
    《International Journal of Production Research》 |2009年第18期|5109-5128|共20页
  • 作者

    S.H. Chung; Y.T. Tai; W.L. Pearn;

  • 作者单位

    Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC;

    Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC;

    Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, ROC;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    parallel batch; scheduling; unequal ready time;

    机译：并行批处理排程准备时间不平等;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号