J. Bautista, Alberto Cano, R. Companys, Imma Ribas
{"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}
引用次数: 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
