期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 168, 期 3, 页码 985-997出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2004.05.017
关键词
scheduling; makespan; flexible flow shop; uniform machines; absolute performance guarantee; approximation algorithms
We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class by building on similar absolute performance guarantees for the corresponding serial flow shop heuristics. Our approach is quite robust, since it can extend any heuristic for the serial flow shop problem (with an absolute performance guarantee) to a similar one for the flexible flow shop problem with uniform parallel machines. (c) 2004 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据