期刊
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
卷 25, 期 6, 页码 1235-1245出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2011.09.001
关键词
Blocking flow shop; Scheduling; Production; Logistics; Dynamic programming; Meta-heuristics
类别
资金
- Nissan Spanish Industrial Operations (NSIO)
- Nissan Chair UPC
- project PROTHIUS-III [DPI2010-16759]
- Spanish government
We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm vertical bar block vertical bar C-max problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard's instances, including the 10 instances from set 12. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
