While searching for suboptimal solutions for large-scale problems, it is critical to force search algorithms on promising regions. This paper presents genetic algorithms with search space reductions (RGAs) and their application to solving large-scale permutation flowshop problems. The reduced search spaces are defined by adding precedence constraints generated by heuristic rules. To balance bet...

This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flows...

The flexible flowshop problem is a well known and common challenge. Extended with unrelated parallel machines and especially with the dynamic aspect of distributed release times, the problem gets very ‘close to reality’. Triggered by the growing complexity of logistic systems, the paradigm of central planning is being shifted to decentralised control. As part of this, an autonomous control conc...

This paper contains a complete and updated review of the literature for multiobjective flowshop problems which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting and Pareto approaches have been reviewed. Exact, heuristic and metaheuristic methods h...

Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop happen a number of jobs have sequentially processed by machines. This paper addressees, for first time, Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S). In this problem, addition standard permu...

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...