期刊
COMPUTERS & OPERATIONS RESEARCH
卷 66, 期 -, 页码 160-169出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2015.08.001
关键词
Scheduling; Metaheuristics; Flow shop; Non-permutation schedules
类别
资金
- FAPERGS [12/2046-6]
- Petrobras
- CNPq [478847/2013-0]
- National Center for Supercomputing at UFRGS
We propose a constructive and an iterated local search heuristic for minimizing the makespan in the non-permutation flow shop scheduling problem. Both heuristics are based on the observation that optimal non-permutation schedules often exhibit a permutation structure with a few local job inversions. In computational experiments we compare our heuristics to the best heuristics for finding non-permutation and permutation flow shop schedules, and evaluate the reduction in makespan and buffer size that can be achieved by non-permutation schedules. (c) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据