Hybrid estimation of distribution algorithm for permutation flowshop scheduling problem with sequence dependent family setup times

This paper addresses to the scheduling in manufacturing cell environment with sequence dependent family setup times in a flow shop with respect to the makespan criterion. Since this is a NP-hard problem, we present an estimation of distribution algorithm as an evolutionary algorithm for solving it....

Full description

Saved in:
Bibliographic Details
Main Authors: Eddaly, M., Jarboui, B., Bouabda, R., Rebai, A.
Format: Conference Proceeding
Language:English
Subjects:
Cellular manufacturing
estimation of distribution algorithm
Evolutionary computation
flowshop
Group technology
iterated local search
Job shop scheduling
Machinery production industries
manufacturing cell
Manufacturing industries
Metals industry
Processor scheduling
Scheduling algorithm
sequence dependant family
Textile industry
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses to the scheduling in manufacturing cell environment with sequence dependent family setup times in a flow shop with respect to the makespan criterion. Since this is a NP-hard problem, we present an estimation of distribution algorithm as an evolutionary algorithm for solving it. In order to improve the quality of solution of our algorithm, we propose a hybridization with an iterated local search algorithm. The computational experiments show that our algorithm is better than the evolutionary algorithms proposed in the literature. Moreover, it seems able to provide good results in short computational time.
DOI:10.1109/ICCIE.2009.5223755