default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKan Fang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Kan Fang
, Enyuan Fu, Dian Huang, Ginger Y. Ke, Manish Verma:
A value-at-risk based approach to the routing problem of multi-hazmat railcars. Eur. J. Oper. Res. 320(1): 132-145 (2025)- [j18]Zhaofang Mao, Jiaxin Zhang, Yiting Sun, Kan Fang, Dian Huang:
Balancing parallel assembly lines with human-robot collaboration: problem definition, mathematical model and tabu search approach. Int. J. Prod. Res. 63(1): 51-85 (2025) - 2024
- [j17]Zhaofang Mao, Yida Xu, Kan Fang, Chengbo Wang, Dian Huang:
An adaptive large neighborhood search algorithm for parallel assembly lines scheduling problem with complex fixture constraints. Comput. Ind. Eng. 188: 109900 (2024) - [j16]Zhaofang Mao, Yiting Sun, Kan Fang, Dian Huang, Jiaxin Zhang:
Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem. Comput. Oper. Res. 165: 106605 (2024) - [j15]Zhaofang Mao, Enyuan Fu, Dian Huang, Kan Fang, Lin Chen:
Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints. Eur. J. Oper. Res. 317(3): 890-905 (2024) - [j14]Zhanghuang Xie, Xiaomei Li, Dian Huang, Andrea Appolloni, Kan Fang:
Simultaneous product platform design and scheduling on unrelated additive/subtractive hybrid machines. Ind. Manag. Data Syst. 124(11): 3012-3051 (2024) - [j13]Kan Fang, Wenchang Luo, Michael L. Pinedo, Miaomiao Jin, Lingfa Lu:
Rescheduling for new orders on a single machine with rejection. J. Oper. Res. Soc. 75(2): 346-360 (2024) - [j12]Dong Wang, Kan Fang, Wenchang Luo, Wenli Ouyang:
Approximation algorithms for mixed batch scheduling on parallel machines. J. Oper. Res. Soc. 75(12): 2365-2374 (2024) - 2023
- [j11]Zhaofang Mao, Jiaxin Zhang, Kan Fang, Dian Huang, Yiting Sun:
Balancing U-type assembly lines with human-robot collaboration. Comput. Oper. Res. 159: 106359 (2023) - [j10]Dian Huang, Zhaofang Mao, Kan Fang, Lin Chen:
Solving the shortest path interdiction problem via reinforcement learning. Int. J. Prod. Res. 61(1): 31-48 (2023) - [c2]Shijin Wang, Hanyu Zhang, Feng Chu, Kan Fang:
Simultaneous Production and Transportation Problem to Minimize the Total Cost of Waiting Time and Tardiness. ICNSC 2023: 1-6 - 2022
- [j9]Dian Huang, Zhaofang Mao, Kan Fang, Biao Yuan:
Combinatorial Benders decomposition for mixed-model two-sided assembly line balancing problem. Int. J. Prod. Res. 60(8): 2598-2624 (2022) - 2021
- [j8]Kan Fang, Shijin Wang, Michael L. Pinedo, Lin Chen, Feng Chu:
A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions. Eur. J. Oper. Res. 291(1): 128-146 (2021) - [j7]Kan Fang, Wenchang Luo, Ada Che:
Speed scaling in two-machine lot-streaming flow shops with consistent sublots. J. Oper. Res. Soc. 72(11): 2429-2441 (2021) - 2020
- [j6]Zhaofang Mao, Dian Huang, Kan Fang, Chengbo Wang, Dandan Lu:
Milk-run routing problem with progress-lane in the collection of automobile parts. Ann. Oper. Res. 291(1): 657-684 (2020)
2010 – 2019
- 2019
- [j5]Qinxiao Yu, Kan Fang, Ning Zhu, Shoufeng Ma:
A matheuristic approach to the orienteering problem with service time dependent profits. Eur. J. Oper. Res. 273(2): 488-503 (2019) - 2018
- [j4]Shijin Wang, Zhanguo Zhu, Kan Fang, Feng Chu, Chengbin Chu:
Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs. Int. J. Prod. Res. 56(9): 3173-3187 (2018) - 2017
- [j3]Kan Fang, Ginger Y. Ke, Manish Verma:
A routing and scheduling approach to rail transportation of hazardous materials with demand due dates. Eur. J. Oper. Res. 261(1): 154-168 (2017) - 2016
- [j2]Kan Fang, Nelson A. Uhan, Fu Zhao, John W. Sutherland:
Scheduling on a single machine under time-of-use electricity tariffs. Ann. Oper. Res. 238(1-2): 199-227 (2016) - 2015
- [i1]Xiao (Cosmo) Zhang, Kan Fang, Gregory Francis:
Optimization of Switch Keyboards. CoRR abs/1503.04375 (2015) - 2013
- [j1]Kan Fang, Nelson A. Uhan, Fu Zhao, John W. Sutherland:
Flow shop scheduling with peak power consumption constraints. Ann. Oper. Res. 206(1): 115-145 (2013) - [c1]Xiao (Cosmo) Zhang, Kan Fang, Gregory Francis:
Optimization of switch keyboards. ASSETS 2013: 60:1-60:2
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
