A heuristic for the no-wait flow shop scheduling optimization
This paper proposed a new heuristic, named SDH heuristic, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. The SDH heuristic is based on the well-known NEH heuristic Firstly, the total flowtime is shown. Secondly, the SDH heuristic is presented. Thirdly, Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results and comparison show the effectiveness of the DHS heuristic in solving the no-wait flow shop scheduling with total flowtime criterion.
no-wait flow shop scheduling total flowtime SDH heuristic
Sun QQ Gao KZ Li HQ
Department of computer science and technology Binzhou University Binzhou, China College of computer science Liaocheng University Liaocheng, China
国际会议
武汉
英文
192-195
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）