Assembly flowshop scheduling problem to minimize total tardiness

Authors:
Ali Allahverdi;Harun Aydilek
Affiliations:
Department of Industrial and Management System Engineering, Kuwait University, Safat, Kuwait;Department of Mathematics and Natural Sciences, Gulf University for Science and Technology, Hawally, Kuwait
Venue:
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Year:
2012

Citing 3
Cited 0

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

Management Science
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two-stage assembly flowshop scheduling problem is addressed with the objective of minimizing total tardiness. An insertion algorithm, a genetic algorithm, and a hybrid of the insertion and genetic algorithms, are developed for the problem. Conducted computational experiments reveal that the hybrid algorithm significantly outperforms the genetic algorithm while the best performing algorithm is the insertion algorithm. Moreover, the performance of the insertion algorithm remains as the best regardless of the tightness of due dates of the jobs.