A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times

Authors:
Radhouan Bouabda;Bassem Jarboui;Mansour Eddaly;Abdelwaheb Rebaï
Affiliations:
FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie;FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie and Institut Supérieur de Commerce et de Comptabilité de Bizerte, Zarzouna, 7021 Bizerte, Tunisie;FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie;FSEGS, route de l'aéroport km 4, Sfax 3018, Tunisie
Venue:
Computers and Operations Research
Year:
2011

Citing 9
Cited 0

A design methodology for configuration of manufacturing cells

Computers and Industrial Engineering - Cellular manufacturing systems: design, analysis and implementation
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering
Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times

Computers and Operations Research
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research
Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report

Computers and Operations Research
Guest Editorial: Hybrid Metaheuristics

Computers and Operations Research
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Forming part families by using genetic algorithm and designing machine cells under demand changes

Computers and Operations Research
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We develop 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 the current solution. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems.