Learn More
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect(More)
— We propose a hybrid approach for multi-objective assignment problem which combines genetic algorithm and mathematical programming techniques. This method is based on the dominance cost variant of the multi-objective genetic algorithm hybridized with exact method. The initial population is generated by solving a series of mono-objective assignment problems(More)
This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance(More)
This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total completion time with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results on this criterion have shown the efficiency of the proposed algorithm both in terms of(More)
The paper presents an exact approach for a permutation flowshop scheduling problem with blocking constraint. The objective is to minimize the total completion time of jobs. The solution method is a branch and bound procedure where lower bounds based on problem characteristics are derived. Whithin an experimental performance analysis, this approach is(More)
Production distribution planning is the most important part in supply chain management. In this paper, An NP-hard production-distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize the sum of three costs: production setups, inventories and distribution. The objective is to determine, for each period, the(More)