Key points are not available for this paper at this time.
This paper deals with the two-stage assembly flowshop scheduling problem with minimisation of weighted sum of makespan and mean completion time as the objective. The problem is NP-hard, hence we proposed a meta-heuristic named imperialist competitive algorithm (ICA) to solve it. Since appropriate design of the parameters has a significant impact on the algorithm efficiency, we calibrate the parameters of this algorithm using the Taguchi method. In comparison with the best algorithm proposed previously, the ICA indicates an improvement. The results have been confirmed statistically.
Shokrollahpour et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: