Complexity and Mathematical Model for Flowshop Problem Subject to Different Types of Blocking Constraint

Abstract

AbstractStorage or buffer capacities between successive machines in flowshop problems may be unlimited, limited or null. Two last cases can lead to blocking situations. In flowshop scheduling literature, many studies and research were realized about classical flowshop problem and also about some problems with only one blocking situation. This paper deals with makespan minimization in flowshop scheduling problems where mixed blocking constraints are considered. After a problem description and different blocking constraints definitions, complexity results for flowshop scheduling problems with mixed blocking constraints and a new type of blocking constraint (RCb*), are considered. A mathematical model is then proposed and numerical results are presented and discussed.