Kan Fang

Orcid: 0000-0002-0847-6906

According to our database1, Kan Fang authored at least 14 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rescheduling for new orders on a single machine with rejection.
J. Oper. Res. Soc., February, 2024

2023
Balancing U-type assembly lines with human-robot collaboration.
Comput. Oper. Res., November, 2023

Solving the shortest path interdiction problem via reinforcement learning.
Int. J. Prod. Res., 2023

Simultaneous Production and Transportation Problem to Minimize the Total Cost of Waiting Time and Tardiness.
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.
Int. J. Prod. Res., 2022

2021
Speed scaling in two-machine lot-streaming flow shops with consistent sublots.
J. Oper. Res. Soc., 2021

A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions.
Eur. J. Oper. Res., 2021

2020
Milk-run routing problem with progress-lane in the collection of automobile parts.
Ann. Oper. Res., 2020

2019
A matheuristic approach to the orienteering problem with service time dependent profits.
Eur. J. Oper. Res., 2019

2018
Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs.
Int. J. Prod. Res., 2018

2017
A routing and scheduling approach to rail transportation of hazardous materials with demand due dates.
Eur. J. Oper. Res., 2017

2016
Scheduling on a single machine under time-of-use electricity tariffs.
Ann. Oper. Res., 2016

2013
Flow shop scheduling with peak power consumption constraints.
Ann. Oper. Res., 2013

Optimization of switch keyboards.
Proceedings of the 15th International ACM SIGACCESS Conference on Computers and Accessibility, 2013


  Loading...