Storage 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 schedulin...

In this paper, an integrated multilevel, control-theoretic framework has been proposed for effectively handling integration of planning, scheduling, and rescheduling. A general resourceconstrained, multistage, multiproduct plant operating as a hybrid flowshop facility has been considered. The proposed approach is based on the inherent hierarchical decomposition of the overall decision-making pr...

In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...

The most general flowshop scheduling problem is also addressed in the literature as nonpermutation flowshop (NPFS). Current processors are able to cope with the (n!) m combinatorial complexity of non-permutation flowshop scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (...

This paper examines how the search ability of evolutionary multi-objective optimization (EMO) algorithms can be improved by the hybridization with local search through computational experiments on multi-objective permutation flowshop scheduling problems. The task of EMO algorithms is to find a variety of nondominated solutions of multi-objective optimization problems. First we describe our mult...

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...