Correction to: An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading (Journal of Intelligent Manufacturing, (2021), 32, 3, (707-728), 10.1007/s10845-020-01697-5)

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to a slip, which mixed up two folds storing data on two sets of different algorithms, the original version of this article unfortunately contained some mistakes. The original experiment results (Table 7) in Case Study were uploaded incorrectly. Algorithm C in Table 5 is obtained from the first instance in Table 7, so Table 5 needs to be revised. Figures 10, 13 and 14 are to show the Pareto solutions and the Gantt Charts of the best solution and need to be revised. Figure 17 is to show the Pareto solutions of each instance (Table 7) obtained with MODE and the improved NSGA-II, respectively and needs to be revised. The corrected version is given below. For each item, the original and the corrected are given in the following table, respectively. From these comparisons, we can see that the corrected results support the conclusion much more. Original article has been corrected.

Cite

CITATION STYLE

APA

Wu, X., Peng, J., Xiao, X., & Wu, S. (2022, April 1). Correction to: An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading (Journal of Intelligent Manufacturing, (2021), 32, 3, (707-728), 10.1007/s10845-020-01697-5). Journal of Intelligent Manufacturing. Springer. https://doi.org/10.1007/s10845-021-01859-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free