期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 247, 期 2, 页码 421-440出版社
ELSEVIER
DOI: 10.1016/j.ejor.2015.06.023
关键词
Scheduling; Flexible job shop; Makespan; List scheduling; Beam search
资金
- PRONEX-CNPq/FAPERJ [E-26/111.449/2010-APQ1]
- FAPESP [2010/10133-0, 2013/03447-6, 2013/05475-7, 2013/07375-0]
- CNPq
An extended version of the flexible job shop problem is tackled in this work. The considered extension to the classical flexible job shop problem allows the precedences between the operations to be given by an arbitrary directed acyclic graph instead of a linear order. Therefore, the problem consists of allocating the operations to the machines and sequencing them in compliance with the given precedences. The goal in the present work is the minimization of the makespan. A list scheduling algorithm is introduced and its natural extension to a beam search method is proposed. Numerical experiments assess the efficiency of the proposed approaches. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据