The following publications are possibly variants of this publication:
- Heuristics for permutation flow shops to minimize total flowtimeXiaoping Li, Qian Wang. cscwd 2006: 107-111 [doi]
- Estimation of distribution algorithm for permutation flow shops with total flowtime minimizationYi Zhang 0009, Xiaoping Li. candie, 60(4):706-718, 2011. [doi]
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time incrementsXiaoping Li, Cheng Wu. chinaf, 51(7):896-909, 2008. [doi]
- Iterative Heuristics for Permutation Flow Shops with Total Flowtime MinimizationXiaoping Li, Qian Wang. ifip5-3 2006: 349-356 [doi]
- An effective and efficient heuristic for no-wait flow shop production to minimize total completion timeHonghan Ye, Wei Li, Amin Abedini, Barrie R. Nault. candie, 108:57-69, 2017. [doi]
- A self-learning hyper-heuristic for the distributed assembly blocking flow shop scheduling problem with total flowtime criterionFuqing Zhao, Shilu Di, Ling Wang 0001, Tianpeng Xu, Ningning Zhu, Jonrinaldi. eaai, 116:105418, 2022. [doi]
- Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion TimeXia Zhu, Xiaoping Li, Qian Wang. cscwd 2008: 192-203 [doi]