首页> 外文期刊>Computers & mathematics with applications >Module-based architecture for a periodic job-shop scheduling problem
【24h】

Module-based architecture for a periodic job-shop scheduling problem

机译:基于模块的体系结构,用于解决周期性的车间调度问题

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

摘要

This paper addresses the Petri net (PN) based design and modeling approach for a periodic job-shop scheduling problem. Asynchronous synthesis for net-modules of the jobs is suggested in this paper for optimal allocation of shared resources to different operations. To make sure the completion of all the jobs in a single iteration of a production cycle and the correct calculation of a makespan, the synchronization problem among jobs is tackled by introducing the special synchronizing transition in the model. A timed-place PN is adopted for the purpose of finding the feasible schedule in terms of the firing sequence of the transitions of the PN model by using the heuristic search method. Further, the characterization of the PN model is performed and it is shown that the PN model for a periodic job-shop scheduling problem is equivalent to a class of PN known as parallel process net with resources (PPNRs). The modeling approach is demonstrated with a practical example and a makespan is calculated for the example.
机译:本文讨论了基于Petri网(PN)的周期性作业车间调度问题的设计和建模方法。本文建议对作业的网络模块进行异步综合,以优化共享资源对不同操作的分配。为了确保在生产周期的一次迭代中完成所有作业并正确计算工期,可通过在模型中引入特殊的同步过渡来解决作业之间的同步问题。为了通过使用启发式搜索方法根据PN模型的转变的触发顺序来找到可行的时间表,采用了时间安排的PN。此外,执行了PN模型的表征,并且表明用于周期性作业车间调度问题的PN模型等效于一类称为PN的资源并行处理网(PPNR)。通过一个实际示例演示了建模方法,并为该示例计算了制造期。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号