Study on Hybrid Flow Shop Scheduling Problem with Blocking Based on GASA

ABSTRACT

A new hybrid flow shop scheduling problem with blocking is studied. The problem is characterized by multistage unrelated parallel machines and no intermediate buffer. Firstly, the math model of the hybrid scheduling problem is constructed. And then the computation method of production period is given. Due to there is no intermediate buffer, and there are unrelated parallel machines in multi-stages, the production period is obtained through pushing from the operational time of each machine. Function objective of the proposed method is to minimize the production period. Finally the scheduling results are obtained based on genetic algorithm and simulated annealing algorithm(GASA). Scheduling results based on two cases and comparisons with some existing algorithms show that the method proposed in this paper is effective and feasible.

Keywords: