Evolutionary algorithms for flowshop sequencing with non unique jobs
Sequencing problems are difficult combinatorial problems because of the extremely large search space of possible solutions and the large number of “local” optimum that arise. Unlike other NP-hard combinatorial problems, the search space in general for sequencing problems (under the makespan objective) consist of sequences with objective function values that lie within only a relatively small amount of each other. This means that when a change is made to the sequence, an improvement or non-improvement is not easily recognised. This makes the problem much more difficult to solve. A number of constructive heuristic’s exist that obtain good solutions in a short period of time, however the output of such algorithms is generally a single sequence which may not be feasible or preferred with respect to industry constraints. Other heuristic algorithms such as Simulated Annealing (SA) and Tabu Search (TS) have also been applied and successes have been reported. The performance however is dependent upon a number of finely tuned parameters and the output is again only a single solution. For these reasons, Evolutionary Algorithms may be a suitable solution strategy and for which limited research has been performed. In this research a number of new evolutionary algorithms have been proposed and a number of modifications have been made to several constructive algorithms to cope with non-unique jobs or jobs with multiple demand. A numerical comparison of a number of benchmark problems and real data of a truck assembly line has also been presented.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||For more information or for a copy of the item contact the author at firstname.lastname@example.org or see the publisher URL above.|
|Keywords:||sequencing, scheduling, meta, heuristics, flowshop|
|Subjects:||Australian and New Zealand Standard Research Classification > MATHEMATICAL SCIENCES (010000) > APPLIED MATHEMATICS (010200) > Operations Research (010206)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2000 Blackwell Publishing|
|Copyright Statement:||The definitive version is available at www.blackwell-synergy.com|
|Deposited On:||12 Nov 2007|
|Last Modified:||15 Jan 2009 17:53|
Repository Staff Only: item control page