Zhaoxu He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhaoxu He has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Binghai Zhou
Institute of Industrial Engineering, School of Mechanical Engineering, Tongji University, Shanghai City, People’s Republic of China
1 shared publication - Lyujiangnan Ye
The State University of New Jersey, Rutgers, New Brunswick, USA
1 shared publication - Qiong Wu
School of Mechanical Engineering, Tongji University, Shanghai, China
1 shared publication - Wenfei Zha
School of Mechanical Engineering, Tongji University, Shanghai, People’s Republic of China
1 shared publication - Wenrui Jin
School of Mechanical Engineering, Tongji University, Shanghai, China
1 shared publication
Latest Publications
- 28 October 2021
- Published by Springer Nature in Soft Computing
- Vol. 26 (2) , 763-785
A dynamic material handling scheduling method based on elite opposition learning self-adaptive differential evolution-based extreme learning machine (EOADE-ELM) and knowledge base (KB) for line-integrated supermarkets
- 28 October 2021
- Published by Springer Nature in Soft Computing
- Vol. 26 (2) , 763-785
A dynamic material handling scheduling method based on elite opposition learning self-adaptive differential evolution-based extreme learning machine (EOADE-ELM) and knowledge base (KB) for line-integrated supermarkets
- 20 July 2021
- Published by Emerald Publishing in Engineering Computations
- Vol. 39 (3) , 813-836
Robust optimization of resource-constrained assembly line balancing problems with uncertain operation times
Purpose: Due to the market trend of low-volume and high-variety, the manufacturing industry is paying close attention to improve the ability to hedge against variability. Therefore, in this paper the assembly line with limited resources is balanced in a robust way that has good performance under all possible scenarios. The proposed model allows decision makers to minimize a posteriori regret of the selected choice and hedge against the high cost caused by variability.Design/methodology/approach: A generalized resource-constrained assembly line balancing problem (GRCALBP) with an interval data of task times is modeled and the objective is to find an assignment of tasks and resources to the workstations such that the maximum regret among all the possible scenarios is minimized. To properly solve the problem, the regret evaluation, an exact solution method and an enhanced meta-heuristic algorithm, Whale Optimization Algorithm, are proposed and analyzed. A problem-specific coding scheme and search mechanisms are incorporated.Findings: Theory analysis and computational experiments are conducted to evaluated the proposed methods and their superiority. Satisfactory results show that the constraint generation technique-based exact method can efficiently solve instances of moderate size to optimality, and the performance of WOA is enhanced due to the modified searching strategy.Originality/value: For the first time a minmax regret model is considered in a resource-constrained assembly line balancing problem. The traditional Whale Optimization Algorithm is modified to overcome the inferior capability and applied in discrete and constrained assembly line balancing problems.
- 20 July 2021
- Published by Emerald Publishing in Engineering Computations
- Vol. 39 (3) , 813-836
Robust optimization of resource-constrained assembly line balancing problems with uncertain operation times
Purpose: Due to the market trend of low-volume and high-variety, the manufacturing industry is paying close attention to improve the ability to hedge against variability. Therefore, in this paper the assembly line with limited resources is balanced in a robust way that has good performance under all possible scenarios. The proposed model allows decision makers to minimize a posteriori regret of the selected choice and hedge against the high cost caused by variability.Design/methodology/approach: A generalized resource-constrained assembly line balancing problem (GRCALBP) with an interval data of task times is modeled and the objective is to find an assignment of tasks and resources to the workstations such that the maximum regret among all the possible scenarios is minimized. To properly solve the problem, the regret evaluation, an exact solution method and an enhanced meta-heuristic algorithm, Whale Optimization Algorithm, are proposed and analyzed. A problem-specific coding scheme and search mechanisms are incorporated.Findings: Theory analysis and computational experiments are conducted to evaluated the proposed methods and their superiority. Satisfactory results show that the constraint generation technique-based exact method can efficiently solve instances of moderate size to optimality, and the performance of WOA is enhanced due to the modified searching strategy.Originality/value: For the first time a minmax regret model is considered in a resource-constrained assembly line balancing problem. The traditional Whale Optimization Algorithm is modified to overcome the inferior capability and applied in discrete and constrained assembly line balancing problems.