生產(chǎn)計(jì)劃調(diào)度管理制度-資料下載頁
2024-11-03 01:03本頁面
【正文】 uling problem to minimize the 3 section, we describe the proposed hybrid genetic algorithm in the 4 section, the proposed algorithm is evaluated on benchmark , we conclude the paper with a summary in 5th section.《Hybrid Genetic Algorithm for Solving JobShop Scheduling Problem》 作者： HasanThe JobShop Scheduling Problem(JSSP)is a wellknown difficult binatorial optimization algorithms have been proposed for solving JSSP in the last few decades, including algorithms based on evolutionary , there is room for improvement in solving medium to large scale problems this paper, we present a Hybrid Genetic Algorithm(HGA)that includes a heuristic job ordering with a Genetic apply HGA to a number of benchmark is found that the algorithm is able to improve the solution the solution obtained by traditional genetic algorithm.《Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm》Most flexible job shop scheduling models assume that the machines are available all of the , in most realistic situations, machines may be unavailable due to maintenances, preschedules and so this paper, we study the flexible job shop scheduling problem with availability availability constraints are nonfixed in that the pletion time of the maintenance tasks is not fixed and has to be determined during the scheduling then propose a hybrid genetic alogorithm to solve the flexible job shop scheduling problem with nonfixed availability genetic algorithm uses an innovative representation method thrdand applies genetic operations in phenotype space in order to enhance the also define two kinds of neighbourhood for the problem based on the concept of critical local search procedure is then integrated under the framework of the genetic flexible job shop scheduling benchmark problems and fJSPnfa problems are solved in order to test the the effectiveness and efficiency of the suggested methodology.《A Hybrid genetic algorithm for nowait job shop scheduling problems》 作者：Jason ChaoHsien Pan, HanChiang HuangA nowait job shop describes a situation where every job has its own processing sequence with the constraint that no waiting time is allowed between operations within any NWJS problem with the objective of minimizing total pletion time is a NPhard problem and this paper proposes a hybrid genetic algorithm(HGA)to solve this plex genetic operation is defined by cutting out a section of genes from a chromosome and treated as a subproblem is then transformed into an asymeetric traveling salesman problem(ATSP)and solved with a heuristic , this section with new sequence is put back to replace the original section of incorporation of this problemspecific genetic operator is responsible for the hybrid doing so, the course of the search of the proposed genetic algorithm is set to more profitable regions in the solution experiemental results show that this hybrid genetic algorithm can accelerate the convergence and improve solution quality as well.
研究報(bào)告相關(guān)推薦
鄂ICP備17016276號(hào)-1