Loading...
Loading...

Go to the content (press return)

A bounded dynamic programming algorithm for the blocking flow shop problem

Author
Bautista, J.; Cano, A.; Companys, R.; Ribas, I.
Type of activity
Book chapter
Book
2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings
First page
8
Last page
15
Publisher
IEEE Computer Society Conference Publishing Services (CPS)
Date of publication
2011-04-11
ISBN
978-1-61284-332-2 Open in new window
Repository
http://hdl.handle.net/2117/90832 Open in new window
http://hdl.handle.net/2117/90833 Open in new window
URL
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060 Open in new window
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 wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances
Citation
Bautista, J., Cano, A., Companys , R., Ribas, I. A bounded dynamic programming algorithm for the blocking flow shop problem. A: "2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings". Los Alamitos (California): IEEE Computer Society Conference Publishing Services (CPS), 2011, p. 8-15.
Keywords
BDP algorithms, Scheduling, blocking flow shop
Group of research
OPE-PROTHIUS -
SCOM - Supply Chain and Operations Management

Participants