A particle swarm-based genetic algorithm for scheduling in an agile environment

Authors:
Lotfi K. Gaafar;Sherif A. Masoud;Ashraf O. Nassef
Affiliations:
Department of Mechanical Engineering, The American University in Cairo, 113 Kasr el Aini Street, P.O. Box 2511, Cairo 11511, Egypt;Department of Mechanical Engineering, The American University in Cairo, 113 Kasr el Aini Street, P.O. Box 2511, Cairo 11511, Egypt;Department of Mechanical Engineering, The American University in Cairo, 113 Kasr el Aini Street, P.O. Box 2511, Cairo 11511, Egypt
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 9
Cited 1

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure

Computers and Operations Research
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation

Computers and Industrial Engineering
A genetic algorithm for job shop scheduling—a case study

Computers in Industry
A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
An effective hybrid optimization strategy for job-shop scheduling problems

Computers and Operations Research
Scheduling rules for dynamic shops that manufacture multi-level jobs

Computers and Industrial Engineering
Design and Analysis of Experiments

Design and Analysis of Experiments
Genetic algorithms, path relinking, and the flowshop sequencing problem

Evolutionary Computation

A resource-constrained assembly job shop scheduling problem with Lot Streaming technique

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, genetic algorithms are applied to the scheduling of a manufacturing system that is designed to support an assembly-driven differentiation strategy in the context of agile manufacturing. The system consists of a single flexible machine followed by multiple identical assembly stations. The objective of the scheduling problem is to minimize the makespan. A modified version of the genetic algorithm, inspired by the particle swarm optimization approach, is applied to the problem in addition to the general application of genetic algorithms. The objective is to investigate the potential that the particle swarm optimization concepts may have in improving the performance of genetic algorithms when applied to the chosen problem. The performance of these algorithms is compared to existing heuristics in the literature. A 2^3 factorial experiment, replicated twice, is used to compare the performance of the various approaches and identify the significant factors that affect the average percentage deviation from a lower bound. The results show that both versions of genetic algorithms applications outperform the existing heuristics in many instances and provide schedules that are shorter by as much as 15.5% in the cases considered. In addition, the modified application of genetic algorithms outperforms the regular application with shorter schedules by as much as 3.6% in many instances.