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

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

{"title":"阻塞流车间问题的有界动态规划算法","authors":"J. Bautista, Alberto Cano, R. Companys, Imma Ribas","doi":"10.1109/CIPLS.2011.5953353","DOIUrl":null,"url":null,"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.","PeriodicalId":103768,"journal":{"name":"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A bounded dynamic programming algorithm for the blocking flow shop problem\",\"authors\":\"J. Bautista, Alberto Cano, R. Companys, Imma Ribas\",\"doi\":\"10.1109/CIPLS.2011.5953353\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":103768,\"journal\":{\"name\":\"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIPLS.2011.5953353\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIPLS.2011.5953353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

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

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

查看原文本刊更多论文

A bounded dynamic programming algorithm for the blocking flow shop problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量