文章基本信息

标题：Constructive and Simulated Annealing Algorithms for Hybrid Flow Shop Problems with Unrelated Parallel Machines
本地全文：下载
作者：Jitti Jungwattanakit ; Manop Reodecha ; Paveena Chaovalitwongse,Frank,Werner 等
期刊名称：Thammasat International Journal of Science and Technology
印刷版ISSN：0859-4074
出版年度：2007
卷号：12
期号：01
页码：31-41
出版社：Printing House of Thammasat University
摘要：Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and henceh euristicsa re usedt o obtain good solutionsi n a reasonableti me. The specificg oal of this paperi s to investigates chedulingh euristics,t o seekt he minimum of a positively weighted convex sum of makespan, and the number of tardy jobs, in a static hybrid flow shop environment, where at least one production stage is made up of unrelated parallel machines. In addition,s equence-anmd achine-dependenset tupt imes are consideredS. omes impled ispatchingr ules and flow shop makespan heuristics are adapted for the sequencing problem under consideration. Then, this solution may be improved by a fast polynomial reinsertion algorithm. Moreover, a simulated annealing algorithm is presented in this paper. Three basic parameters (i.e., cooling schedulesn, eighborhoods tructuresa, nd initial temperatureso) f a simulateda nnealinga lgorithm are briefly discussedin this paper.T he performanceo f the heuristicsi s comparedr elativet o eacho thero n a set of test problems with up to 50 jobs and 20 stages.
关键词：Hybrid flow shop scheduling; Constructive algorithms; Improvement heuristics; Simulated Annealing algorithms.