Title :
A dynamic programming based heuristic in Max-algebra for solving a blocking flow-shop problem
Author :
Yanping Li ; Lin Ding ; Shuai Wang ; Xie Xie
Author_Institution :
Key Lab. of Manuf. Ind. & Integrated Autom., Shenyang Univ., Shenyang, China
Abstract :
An effective heuristic by using Max-algebra model for solving a blocking flow-shop problem based on dynamic programming is proposed. We establish a Max-algebra model through combining job sequence function and timed D-subsets, and further propose a heuristic based on dynamic programming algorithm. The performance of the heuristic is verified effectively.
Keywords :
dynamic programming; flow shop scheduling; Max-algebra model; blocking flow-shop problem; dynamic programming based heuristic; job sequence function; timed D-subsets; Algorithm design and analysis; Dynamic programming; Dynamic scheduling; Educational institutions; Heuristic algorithms; Job shop scheduling; Manufacturing; dynamic programming; flow-shop; heuristic; max-algebra; scheduling;
Conference_Titel :
Measurement, Information and Control (ICMIC), 2013 International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4799-1390-9
DOI :
10.1109/MIC.2013.6757986
