scholarly journals High-Speed Railway Passenger Station Based on Contingency Theory Promotes the Construction of Flexible Organization for the Integration of Industry and Service Industry

CONVERTER ◽  
2021 ◽  
pp. 326-336
Author(s):  
Chao Yin, Zejian Zhang

Firstly, the paper discusses the theoretical progress of contingency theory in organization construction, which lays a theoretical foundation for the research of flexible organization construction of high-speed railway passenger stations. Then, based on the contingency conceptual framework proposed by Lucence, the conceptual framework of flexible organization construction of high-speed railway passenger station is constructed in combination with the operational characteristics and operating environment of high-speed railway passenger station. This paper explains the connotation of flexible organization construction of high-speed railway station. On this basis, the paper puts forward the idea of flexible organization construction of high-speed railway passenger station. Finally, five supporting measures for the construction of flexible organization of high-speed railway station are put forward. These studies provide theoretical guidance and construction ideas for flexible organization construction of high-speed railway stations in response to passenger flow fluctuation; the main strategy is to give priority to the introduction and cultivation of producer services in developed cities.

Author(s):  
Yixiang Yue ◽  
Leishan Zhou

Regarding the railway station tracks and train running routes as machines, all trains in this railway station as jobs, dispatching trains in high-speed railway passenger stations can be considered as a special type of Job-Shop Problem (JSP). In this paper, we proposed a multi-machines, multi-jobs JSP model with special constraints for Operation Plan Scheduling Problem (OPSP) in high-speed railway passenger stations, and presented a fast heuristic algorithm based on greedy heuristic. This algorithm first divided all operations into several layers according to the yards attributes and the operation’s urgency level. Then every operation was allotted a feasible time window, each operation was assigned to a specified “machine” sequenced or backward sequenced within the time slot, layer by layer according to its priority. As we recorded and modified the time slots dynamically, the searching space was decreased dramatically. And we take the South Beijing High-speed Railway Station as example and give extensive numerical experiment. Computational results based on real-life instance show that the algorithm has significant merits for large scale problems; can both reduce tardiness and shorten cycle times. The empirical evidence also proved that this algorithm is industrial practicable.


Sign in / Sign up

Export Citation Format

Share Document