Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 69, Issue 9-12, Pages 2215-2226Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00170-013-5187-3
Keywords
Two-stage assembly flow-shop problem; Multiple non-identical machines; Mathematical model; Mixed-integer linear programming
Ask authors/readers for more resources
This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.
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