Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 50, Issue 9-12, Pages 1153-1164Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-010-2579-5
Keywords
Assembly flowshop scheduling; Mean flow time; Maximum tardiness; Sequence-dependent setup times; Simulated annealing; Tabu search
Ask authors/readers for more resources
In this paper, we consider a three-stage assembly flowshop scheduling problem with bi-objectives, namely the mean flow time and maximum tardiness. This problem can be considered as a production system model consisting of three stages: (1) different production operations are done in parallel, concurrently and independently, (2) the manufactured parts are collected and transferred to the next stage, and (3) these parts are assembled into final products. In this paper, sequence-dependent setup times and transfer times are also considered as two important presumptions in order to make the problem more realistic. We present a novel mathematical model for a production system with a new lower bound for the given problem. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. Thus, we propose two meta-heuristics, namely simulated annealing and tabu search, to solve a number of test problems generated at random. Finally, the computational results are illustrated and compared in order to show the efficiency of the foregoing meta-heuristics.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available