Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan

Authors:
Fawaz S. Al-Anzi;Ali Allahverdi
Affiliations:
Department of Computer Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait;Department of Industrial and Management Systems Engineering, Kuwait University, P.O. Box 5969, Safat, Kuwait
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 1

Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops

Computers and Operations Research
A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Self-adaptive differential evolution

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I

Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a two-stage assembly flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and maximum lateness. The problem is known to be NP-hard, and therefore, we propose heuristics to solve the problem. The proposed heuristics are Tabu search (Tabu), particle swarm optimization (PSO), and self-adaptive differential evolution (SDE). An extensive computational experiment is conducted to compare performances of the proposed heuristics. The computational experiment reveals that both PSO and SDE are much superior to Tabu. Moreover, it is statistically shown that PSO performs better than SDE. The computation times of both PSO and SDE are close to each other and they are less than 40 and 45s, respectively, for the largest size problem considered.