| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 473353 | Computers & Operations Research | 2012 | 8 Pages |
Storage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. The last two cases can lead to blocking situations. In flowshop scheduling literature, many studies have been performed about classical flowshop problems and also about some problems with only one blocking situation between all machines.This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem description and definitions of different blocking constraints, a mathematical model is presented and heuristics are developed to propose quick solutions to these kinds of problems. Then, metaheuristics are used to improve found solutions. A comparison between heuristics and metaheuristics is then performed.
► Detailed description of the various blocking constraints in flow shop problem. ► Mathematical model for a flowshop problem subject to different blocking constraints. ► Some heuristics (NEH method and a new heuristic) and improvement methods for both algorithms are presented. ► Genetic algorithm for this kind of problem is used.
