Machine scheduling with transportation considerations
Machine scheduling with transportation considerations
复制标题
DOI：
10.1002/1099-1425(200101/02)4:1
复制
发表时间：
2001
影响因子：
2
通讯作者：
Chung-Yee Lee;Zhi-Long Chen
中科院分区：
文献类型：
--
作者：
Chung-Yee Lee;Zhi-Long Chen
在大多数制造和配送系统中，半成品作业通过自动导引车（AGV）和输送机等运输工具从一个加工设施转移到另一个加工设施，而成品作业通过卡车等车辆交付给客户或仓库。大多数机器调度模型假设要么有无限多的运输工具来运送作业，要么作业从一个地点瞬间运送到另一个地点，而不需要运输时间。在本文中，我们研究机器排序问题与显式运输的考虑。模型被认为是两种类型的运输情况。第一种情况涉及将半成品从一台机器运输到另一台机器进行进一步加工。第二种情况出现在向客户或仓库交付成品作业的环境中。在我们的模型中明确考虑了运输能力和运输时间。我们研究这类排序问题，通过分析其复杂性。我们发现，许多问题是计算困难的，并提出多项式或伪多项式算法的一些问题。版权所有© 2001约翰威利父子有限公司。
In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles (AGVs) and conveyors, and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are an infinite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this paper, we study machine scheduling problems with explicit transportation considerations. Models are considered for two types of transportation situations. The first situation involves transporting a semi-finished job from one machine to another for further processing. The second appears in the environment of delivering a finished job to the customer or warehouse. Both transportation capacity and transportation times are explicitly taken into account in our models. We study this class of scheduling problems by analysing their complexity. We show that many problems are computationally difficult and propose polynomial or pseudo-polynomial algorithms for some problems. Copyright © 2001 John Wiley & Sons, Ltd.