Machine scheduling with deliveries to multiple customer locations
Machine scheduling with deliveries to multiple customer locations
复制标题
DOI：
10.1016/j.ejor.2003.11.022
复制
发表时间：
2005-07
期刊：
影响因子：
--
通讯作者：
Chung-Lun Li;G. Vairaktarakis;Chung-Yee Lee
中科院分区：
文献类型：
--
作者：
Chung-Lun Li;G. Vairaktarakis;Chung-Yee Lee
生产和物流管理中的一个重要问题是生产和交付之间的活动协调。在本文中，我们建立了一个单机调度模型，该模型包含了服务于不同地点的客户的送货车辆的路径决策。目标是最小化工作到达时间的总和。这个问题通常是强意义上的NP难问题。对于顾客数量固定的情况，我们给出了一个多项式时间算法。对于该问题的几种特殊情况，提出了更有效的算法。特别地，针对单客户情况，给出了一种比已有算法复杂度更低的算法。
One important issue in production and logistics management is the coordination of activities between production and delivery. In this paper, we develop a single-machine scheduling model that incorporates routing decisions of a delivery vehicle which serves customers at different locations. The objective is to minimize the sum of job arrival times. The problem is NP-hard in the strong sense in general. We develop a polynomial time algorithm for the case when the number of customers is fixed. More efficient algorithms are developed for several special cases of the problem. In particular, an algorithm is developed for the single-customer case with a complexity lower than the existing ones.