Kan Fang

According to our database, Kan Fang authored at least 18 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

A value-at-risk based approach to the routing problem of multi-hazmat railcars.

Kan Fang, Enyuan Fu, Dian Huang, Ginger Y. Ke, Manish Verma

Eur. J. Oper. Res., 2025

2024

Rescheduling for new orders on a single machine with rejection.

Kan Fang, Wenchang Luo, Michael L. Pinedo, Miaomiao Jin, Lingfa Lu

J. Oper. Res. Soc., February, 2024

Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints.

Zhaofang Mao, Enyuan Fu, Dian Huang, Kan Fang, Lin Chen

Eur. J. Oper. Res., 2024

Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem.

Zhaofang Mao, Yiting Sun, Kan Fang, Dian Huang, Jiaxin Zhang

Comput. Oper. Res., 2024

An adaptive large neighborhood search algorithm for parallel assembly lines scheduling problem with complex fixture constraints.

Zhaofang Mao, Yida Xu, Kan Fang, Chengbo Wang, Dian Huang

Comput. Ind. Eng., 2024

2023

Balancing U-type assembly lines with human-robot collaboration.

Zhaofang Mao, Jiaxin Zhang, Kan Fang, Dian Huang, Yiting Sun

Comput. Oper. Res., November, 2023

Solving the shortest path interdiction problem via reinforcement learning.

Dian Huang, Zhaofang Mao, Kan Fang, Lin Chen

Int. J. Prod. Res., 2023

Simultaneous Production and Transportation Problem to Minimize the Total Cost of Waiting Time and Tardiness.

Shijin Wang, Hanyu Zhang, Feng Chu, Kan Fang

Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2023

2022

Combinatorial Benders decomposition for mixed-model two-sided assembly line balancing problem.

Dian Huang, Zhaofang Mao, Kan Fang, Biao Yuan

Int. J. Prod. Res., 2022

2021

Speed scaling in two-machine lot-streaming flow shops with consistent sublots.

Kan Fang, Wenchang Luo, Ada Che

J. Oper. Res. Soc., 2021

A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions.

Kan Fang, Shijin Wang, Michael L. Pinedo, Lin Chen, Feng Chu

Eur. J. Oper. Res., 2021

2020

Milk-run routing problem with progress-lane in the collection of automobile parts.

Zhaofang Mao, Dian Huang, Kan Fang, Chengbo Wang, Dandan Lu

Ann. Oper. Res., 2020

2019

A matheuristic approach to the orienteering problem with service time dependent profits.

Qinxiao Yu, Kan Fang, Ning Zhu, Shoufeng Ma

Eur. J. Oper. Res., 2019

2018

Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs.

Shijin Wang, Zhanguo Zhu, Kan Fang, Feng Chu, Chengbin Chu

Int. J. Prod. Res., 2018

2017

A routing and scheduling approach to rail transportation of hazardous materials with demand due dates.

Kan Fang, Ginger Y. Ke, Manish Verma

Eur. J. Oper. Res., 2017

2016

Scheduling on a single machine under time-of-use electricity tariffs.

Kan Fang, Nelson A. Uhan, Fu Zhao, John W. Sutherland

Ann. Oper. Res., 2016

2013

Flow shop scheduling with peak power consumption constraints.

Kan Fang, Nelson A. Uhan, Fu Zhao, John W. Sutherland

Ann. Oper. Res., 2013

Optimization of switch keyboards.

Xiao (Cosmo) Zhang, Kan Fang, Gregory Francis

Proceedings of the 15th International ACM SIGACCESS Conference on Computers and Accessibility, 2013