Kwei-Long Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kwei-Long Huang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
Chia-Wei Kuo
National Taiwan University
4 shared publications- Ching-Chin Chern
Department of Information Management, National Taiwan University, Taipei, Taiwan
3 shared publications Ching-Chin Chern
2 shared publicationsBang-Woei Hung
Department of Information Management, National Taiwan University, Taipei, Taiwan
1 shared publication- Chao-Lung Yang
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan
1 shared publication Chen Hao-Huai
National Taiwan University
1 shared publication
Latest Publications
- 5 November 2026
- Published by Springer Nature in Annals of Operations Research
- p. 1-34
Railway track maintenance tasks generation and assignment with considering predictive maintenance
- 5 November 2026
- Published by Springer Nature in Annals of Operations Research
- p. 1-34
Railway track maintenance tasks generation and assignment with considering predictive maintenance
- 3 September 2026
- Published by Taylor & Francis in Journal of the Operational Research Society
- p. 1-39
Optimal selling strategies for multiple products: probabilistic selling or product bundling
1. Firms in many industries adopt various selling strategies to improve their profits. In particular, when selling multiple products, probabilistic and bundle selling are widely used for firms to p...
- 3 September 2026
- Published by Taylor & Francis in Journal of the Operational Research Society
- p. 1-39
Optimal selling strategies for multiple products: probabilistic selling or product bundling
1. Firms in many industries adopt various selling strategies to improve their profits. In particular, when selling multiple products, probabilistic and bundle selling are widely used for firms to p...
- Open Access
- 21 November 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 332 (1) , 322-335
Minimizing total travel time in the flexible job-shop scheduling problem with transportation resources
- 21 November 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 332 (1) , 322-335
Open AccessMinimizing total travel time in the flexible job-shop scheduling problem with transportation resources
- 2 February 2021
- Published by Springer Nature in Information Systems and e-Business Management
- Vol. 19 (1) , 363-386
A decision tree classifier for credit assessment problems in big data environments
- 2 February 2021
- Published by Springer Nature in Information Systems and e-Business Management
- Vol. 19 (1) , 363-386
A decision tree classifier for credit assessment problems in big data environments
- 27 October 2020
- Published by Taylor & Francis in Journal of Industrial and Production Engineering
- Vol. 37 (8) , 440-450
The study of guarding and cruising modes of ambulances for emergency medical service
Typically, an ambulance standbys at a fire station for a task dispatch call when an emergency medical service is requested. In order to enhance the response time to the service, we propose a resource reallocation policy that dispatching ambulances to stay at some hotspots (Guarding mode) or even cruise on specific routes (Cruising mode) during certain time periods instead of residing at fire stations. By analyzing the historical data collected from New Taipei City in Taiwan, areas with high frequency of emergency medical events and peak time periods are determined. A simulation model is constructed to evaluate the proposed rule and the results show that the response time of completing an emergency medical service can be significantly reduced.
- 27 October 2020
- Published by Taylor & Francis in Journal of Industrial and Production Engineering
- Vol. 37 (8) , 440-450
The study of guarding and cruising modes of ambulances for emergency medical service
Typically, an ambulance standbys at a fire station for a task dispatch call when an emergency medical service is requested. In order to enhance the response time to the service, we propose a resource reallocation policy that dispatching ambulances to stay at some hotspots (Guarding mode) or even cruise on specific routes (Cruising mode) during certain time periods instead of residing at fire stations. By analyzing the historical data collected from New Taipei City in Taiwan, areas with high frequency of emergency medical events and peak time periods are determined. A simulation model is constructed to evaluate the proposed rule and the results show that the response time of completing an emergency medical service can be significantly reduced.
- 1 September 2017
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 68 (9) , 1030-1044
Optimal contract design for cloud computing service with resource service guarantee
The optimal contract design for cloud computing service with resource guarantee under the consideration of resource redundancy and network externality is studied in this research. A model in which a service provider determines joint pricing and resource allocation decisions is constructed by proposing two types of contracts with different service-level agreements (SLAs). The SLA of each contract describes the price and associated penalty if the provider cannot provide the resource requested by the customers. Optimal pricing and resource allocation decisions as well as the equilibrium contracts of the service provider are analyzed based on the dynamics of the model characteristics. We found that optimal contract design is sensitive to both service levels and customers’ beliefs of compensation ratio when the requested resource is unfulfilled. Furthermore, service providers should evaluate the trade-off between benefit of price discrimination and effect of network externality when determining the optimal contract design.
- 1 September 2017
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 68 (9) , 1030-1044
Optimal contract design for cloud computing service with resource service guarantee
The optimal contract design for cloud computing service with resource guarantee under the consideration of resource redundancy and network externality is studied in this research. A model in which a service provider determines joint pricing and resource allocation decisions is constructed by proposing two types of contracts with different service-level agreements (SLAs). The SLA of each contract describes the price and associated penalty if the provider cannot provide the resource requested by the customers. Optimal pricing and resource allocation decisions as well as the equilibrium contracts of the service provider are analyzed based on the dynamics of the model characteristics. We found that optimal contract design is sensitive to both service levels and customers’ beliefs of compensation ratio when the requested resource is unfulfilled. Furthermore, service providers should evaluate the trade-off between benefit of price discrimination and effect of network externality when determining the optimal contract design.
- 18 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 14 (1) , 286-298
Optimized Train-Set Rostering Plan for Taiwan High-Speed Rail
Railway rolling stock is one of the most expensive assets of railway operators. Efficient utilization of rolling stock is one of the most important objectives pursued in practice. This research focuses on the improvement in rolling stock rostering efficiency for high-speed rail system. According to the circulation schedule and long-term maintenance plan, the rostering planner decides the assignment between rolling stock and duties subject to a set of practical constraints. Owing to its complexity, this task remains a manual process at the Taiwan High Speed Rail Corporation. Experienced railway practitioners can generally create a good and feasible plan, but they cannot guarantee optimality of the solution considering only short-term process. In this research, we developed an exact optimization model and a heuristic method to automate this process and improve the efficiency of rolling stock utilization. Results from the case studies demonstrate that the efficiency of the rolling stock usage can be increased by 3% ~ 4%, and that the process time can be significantly reduced from hours to seconds.
- 18 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 14 (1) , 286-298
Optimized Train-Set Rostering Plan for Taiwan High-Speed Rail
Railway rolling stock is one of the most expensive assets of railway operators. Efficient utilization of rolling stock is one of the most important objectives pursued in practice. This research focuses on the improvement in rolling stock rostering efficiency for high-speed rail system. According to the circulation schedule and long-term maintenance plan, the rostering planner decides the assignment between rolling stock and duties subject to a set of practical constraints. Owing to its complexity, this task remains a manual process at the Taiwan High Speed Rail Corporation. Experienced railway practitioners can generally create a good and feasible plan, but they cannot guarantee optimality of the solution considering only short-term process. In this research, we developed an exact optimization model and a heuristic method to automate this process and improve the efficiency of rolling stock utilization. Results from the case studies demonstrate that the efficiency of the rolling stock usage can be increased by 3% ~ 4%, and that the process time can be significantly reduced from hours to seconds.
- 1 July 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 85, 284-295
Optimizing rolling stock assignment and maintenance plan for passenger railway operations
- 1 July 2015
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 85, 284-295
Optimizing rolling stock assignment and maintenance plan for passenger railway operations
- 31 January 2015
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 28 (4) , 985-1003
A heuristic master planning algorithm for recycling supply chain management
- 31 January 2015
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 28 (4) , 985-1003
A heuristic master planning algorithm for recycling supply chain management