http://www.upv.es/deioac/Investigacion/revision.pdf

The hybrid flow shop scheduling problem

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carlier and Neron's (2000) benchmark problem from the literature. The computational results indicate that the proposed efficient genetic algorithm approach is effective in terms of reduced total completion time or makespan (Cmax) for HFS problems.

/pdf/an-application-of-effective-genetic-algorithms-for-solving-z06xdxw7c9.pdf

An application of effective genetic algorithms for solving hybrid flow shop scheduling problems

A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

Metaheuristic algorithms for the hybrid flowshop scheduling problem

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow shop problem (FFSP). Flexible flow shops are thus generalization of simple flow shops. Flexible flow shop scheduling problems have a special structure combining some elements of both the flow shop and the parallel machine scheduling problems. FFSP can be stated as finding a schedule for a general task graph to execute on a multiprocessor system so that the schedule length can be minimized. FFSP is known to be NP-hard. In this study, we present a particle swarm optimization (PSO) algorithm to solve FFSP. PSO is an effective algorithm which gives quality solutions in a reasonable computational time and consists of less numbers parameters as compared to the other evolutionary metaheuristics. Mutation, a commonly used operator in genetic algorithm, has been introduced in PSO so that trapping of solutions at local minima or premature convergence can be avoided. Logistic mapping is used to generate chaotic numbers in this paper. Use of chaotic numbers makes the algorithm converge fast towards near-optimal solution and hence reduce computational efforts further. The performance of schedules is evaluated in terms of total completion time or makespan (Cmax). The results are presented in terms of percentage deviation (PD) of the solution from the lower bound. The results are compared with different versions of genetic algorithm (GA) used for the purpose from open literature. The results indicate that the proposed PSO algorithm is quite effective in reducing makespan because average PD is observed as 2.961, whereas GA results in average percentage deviation of 3.559. Finally, influence of various PSO parameters on solution quality has been investigated.

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

We investigate the genetic algorithm approach for scheduling hybrid flow shops with minimum makespan as performance measure The hybrid flow shop problem is characterized as the scheduling of jobs in a flow shop environment where, at any stage, there may exist multiple machines The algorithm is based on the list scheduling principle by developing job sequences for the first stage and queuing the remaining stages in a FIFO manner Experiments show that the proposed algorithm outperforms existing heuristic procedures and random search methods

Peifeng Hao

Papers

Hybrid flow shop scheduling using genetic algorithms