Loading...
Please wait, while we are loading the content...
Similar Documents
The No-wait Flowshop Problem with Sequence Dependent Setup times and Release Dates
| Content Provider | Semantic Scholar |
|---|---|
| Author | Aulo |
| Copyright Year | 2001 |
| Abstract | Population based metaheuristics, such as hybrid genetic algorithms or memetic algorithms, play an important role in the solution of combinatorial optimization problems. The memetic algorithm presented here for the no-wait flowshop scheduling problem addresses a hierarchically organized complete ternary tree to represent the population that putted together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. We propose a novel recursive local search scheme Recursive Arc Insertion (RAI) which is responsible for about 90% of the total processing time of the algorithm. Randomly generated instances are used to test the algorithm against other proposed methods. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.inf.ufrgs.br/~buriol/papers/flowshop_enegep.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |