Song Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Song Zhang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Liang Shen
School of Management, Xuzhou Medical University, Xuzhou, China
2 shared publications Bainan Yang
1 shared publicationFeiran Wang
1 shared publication- Li-Chun Xu
School of Public Health, Xuzhou Medical University, Xuzhou, Jiangsu, China
1 shared publication Xiang Xu
1 shared publicationXiaokang Song
1 shared publication
Latest Publications
- 27 July 2023
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 183
Design of urban medical waste recycling network considering loading reliability under uncertain conditions
- 27 July 2023
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 183
Design of urban medical waste recycling network considering loading reliability under uncertain conditions
- Open Access
Complicated Time-Constrained Project Scheduling Problems in Water Conservancy Construction
Water conservancy project scheduling is an extension to the classic resource-constrained project scheduling problem (RCPSP). It is limited by special time constraints called “forbidden time windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model is proposed, and an approach is designated for it which incorporates both a priority rule-based heuristic algorithm to obtain an acceptable solution, and a hybrid genetic algorithm to further improve the quality of the solution. In the genetic algorithm, we introduce a new crossover operator for the forbidden time window and adopt double justification and elitism strategies. Finally, we conduct simulated experiments on a project scheduling problem library to compare the proposed algorithm with other priority-rule based heuristics, and the results demonstrate the superiority of our algorithm.
Open AccessComplicated Time-Constrained Project Scheduling Problems in Water Conservancy Construction
Water conservancy project scheduling is an extension to the classic resource-constrained project scheduling problem (RCPSP). It is limited by special time constraints called “forbidden time windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model is proposed, and an approach is designated for it which incorporates both a priority rule-based heuristic algorithm to obtain an acceptable solution, and a hybrid genetic algorithm to further improve the quality of the solution. In the genetic algorithm, we introduce a new crossover operator for the forbidden time window and adopt double justification and elitism strategies. Finally, we conduct simulated experiments on a project scheduling problem library to compare the proposed algorithm with other priority-rule based heuristics, and the results demonstrate the superiority of our algorithm.
- Open Access
- 28 August 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-7
Selection of Multimode Resource-Constrained Project Scheduling Scheme Based on DEA Method
A multimode resource-constrained project scheduling problem (MRCPSP) may have multifeasible solutions, due to its nature of targeting multiobjectives. Given the NP-hard MRCPSP and intricate multiobjective algorithms, finding the optimized result among those solutions seems impossible. This paper adopts data envelopment analysis (DEA) to evaluate a series of solutions of an MRCPSP and to find an appropriate choice in an objective way. Our approach is applied to a typical MRCPSP in practice, and the results validate that DEA is an effective and objective method for MRCPSP solution selection.
- 28 August 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-7
Open AccessSelection of Multimode Resource-Constrained Project Scheduling Scheme Based on DEA Method
A multimode resource-constrained project scheduling problem (MRCPSP) may have multifeasible solutions, due to its nature of targeting multiobjectives. Given the NP-hard MRCPSP and intricate multiobjective algorithms, finding the optimized result among those solutions seems impossible. This paper adopts data envelopment analysis (DEA) to evaluate a series of solutions of an MRCPSP and to find an appropriate choice in an objective way. Our approach is applied to a typical MRCPSP in practice, and the results validate that DEA is an effective and objective method for MRCPSP solution selection.