期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 10, 页码 2740-2747出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.12.001
关键词
Scheduling; Assembly flowshop; Total completion time; Heuristic; Dominance relation
类别
资金
- Kuwait University Research Administration [EO 06106]
We address the two-stage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the available n jobs so that total completion time of all n jobs is minimized. Setup times are treated as separate from processing times. This problem is NP-hard, and therefore we present a dominance relation and propose three heuristics. The heuristics are evaluated based on randomly generated data. One of the proposed heuristics is known to be the best heuristic for the case of zero setup times while another heuristic is known to perform well for such problems. A new version of the latter heuristic, which utilizes the dominance relation, is proposed and shown to perform much better than the other two heuristics. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据