A bounded dynamic programming algorithm for the blocking flow shop problem

2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS) Pub Date : 2011-04-11 DOI:10.1109/CIPLS.2011.5953353

J. Bautista, Alberto Cano, R. Companys, Imma Ribas

引用次数: 1

Abstract

We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the well-known Taillard instances. We have improved the best-known solutions for four of the Taillard's instances.

查看原文本刊更多论文

阻塞流车间问题的有界动态规划算法

本文以著名的tailard实例为实验数据，给出了用两种有界动态规划算法求解Fm|块|Cmax问题的结果。我们改进了四个Taillard实例中最著名的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)

自引率

0.00%

发文量