Answers are grounded in this paper and cite their sources.
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditional approaches or optimization tools is extremely difficult. Thus, this paper proposes a meta-heuristic method based on simulated annealing (SA) in order to solve the given problem. Finally, the computational results are shown and compared in order to show the efficiency of our proposed SA.
No takes yet. Share an insight, caveat, or question.
Maleki-Darounkolaei et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: