一种并行机的生产运输协调调度的启发式算法

A Heuristic Algorithm on Parallel Machine of Production-Transportation Scheduling

研究了供应链的整合系统中机器调度与产品运输的协调调度问题,尤其是在同等并行机器生产下,运输资源有限时,考虑产品运输到客户的过程中工件占有不同的存储空间问题,证明了该问题是强NP-hard的,提出一种启发式算法,并对此进行了最坏情况的性能比分析,得到紧界是2.

The coordinate scheduling of the machine dispatching and the product transportation in the integrated system of supply chain is studied. The emphasis is the situation that the workpieces are located in the different storage space during delivery to the customers when the transportation resources are limited with parallel machines in the manufacturing system.We provide a proof of NP-hard and focus on developing heuristic algorithm with the guaranteed worst-case performance for some special cases of the problem.