期刊
COMPUTERS & OPERATIONS RESEARCH
卷 36, 期 10, 页码 2866-2876出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2008.12.018
关键词
Scheduling; Flowshop; Makespan; Machine availability
类别
资金
- CICYT [DP12007-61345]
In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem. (C) 2009 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据