期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 158, 期 2, 页码 470-487出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(03)00364-3
关键词
scheduling; heuristics; supply chain management
This paper considers together machine scheduling and finished product delivery. In particular, it addresses the situation in which jobs require different amounts of storage space during delivery. Three scenarios of the problem are discussed. For the problem in which jobs are processed on a single machine and delivered by a single vehicle to one customer area, we provide a proof of NP-hardness and a heuristic with worst-case analysis. The worst-case performance ratio for our heuristic is proven to be 5/3, and the bound is tight. For the problem in which jobs are processed by either one of two parallel machines and delivered by a single vehicle to one customer area, our heuristic could cause at most 100% error under the worst-case with the bound being tight. For the problem that considers jobs to be processed by a single machine and delivered by a single vehicle to two customer areas, we provide another heuristic that is 100% error bound. (C) 2003 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据