default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChung-Cheng Jason Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j24]Chung-Cheng Jason Lu
, Shangyao Yan, Hui-Chieh Li, Ali Diabat, Hsiao-Tung Wang:
Optimal fleet deployment for electric vehicle sharing systems with the consideration of demand uncertainty. Comput. Oper. Res. 135: 105437 (2021)- 2020
- [j23]Yongbo Li, Ali Diabat, Chung-Cheng Jason Lu:
Leagile supplier selection in Chinese textile industries: a DEMATEL approach. Ann. Oper. Res. 287(1): 303-322 (2020) - [j22]Yunhua Liu, Ehsan Dehghani, Mohammad Saeed Jabalameli, Ali Diabat, Chung-Cheng Jason Lu:
A coordinated location-inventory problem with supply disruptions: A two-phase queuing theory-optimization model approach. Comput. Ind. Eng. 142: 106326 (2020) - 2018
- [j21]Chung-Cheng Jason Lu, Shih-Wei Lin, Hui-Ju Chen, Kuo-Ching Ying:
Optimal Allocation of Cashiers and Pharmacists in Large Hospitals: A Point-Wise Fluid-Based Dynamic Queueing Network Approach. IEEE Access 6: 2859-2870 (2018) - [j20]Kuo-Ching Ying, Chung-Cheng Jason Lu, Shih-Wei Lin:
Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints. IEEE Access 6: 30702-30713 (2018) - [j19]Shih-Wei Lin, Chung-Cheng Jason Lu, Kuo-Ching Ying:
Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop. IEEE Access 6: 78666-78677 (2018) - [j18]Chung-Cheng Jason Lu, Shangyao Yan, Hao-Chih Ko, Hui-Ju Chen:
A Bilevel Model With a Solution Algorithm for Locating Weigh-In-Motion Stations. IEEE Trans. Intell. Transp. Syst. 19(2): 380-389 (2018) - 2017
- [j17]Kuo-Ching Ying, Shih-Wei Lin, Chung-Cheng Jason Lu:
Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window. Int. J. Prod. Res. 55(6): 1707-1719 (2017) - 2016
- [j16]Kuo-Ching Ying, Chung-Cheng Jason Lu, Jhao-Cheng Chen:
Exact algorithms for single-machine scheduling problems with a variable maintenance. Comput. Ind. Eng. 98: 427-433 (2016) - 2015
- [j15]Shangyao Yan, Chung-Cheng Jason Lu, Jun-Hsiao Hsieh, Han-Chun Lin:
A network flow model for the dynamic and flexible berth allocation problem. Comput. Ind. Eng. 81: 65-77 (2015) - [j14]Chung-Cheng Jason Lu:
Robust data envelopment analysis approaches for evaluating algorithmic performance. Comput. Ind. Eng. 81: 78-89 (2015) - [j13]Shang-Yu Chen, Chung-Cheng Jason Lu:
Assessing the competitiveness of insurance corporations using fuzzy correlation analysis and improved fuzzy modified TOPSIS. Expert Syst. J. Knowl. Eng. 32(3): 392-404 (2015) - 2014
- [j12]Chung-Cheng Jason Lu, Shih-Wei Lin, Kuo-Ching Ying:
Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times. Appl. Soft Comput. 23: 144-151 (2014) - [j11]Chung-Cheng Jason Lu, Kuo-Ching Ying, Shih-Wei Lin:
Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times. Comput. Ind. Eng. 74: 102-110 (2014) - [j10]Chung-Cheng Jason Lu, Yen-Chun Jim Wu:
Evaluation of Heuristics Using Data Envelopment Analysis. Int. J. Inf. Technol. Decis. Mak. 13(4): 795-810 (2014) - [j9]Chung-Cheng Jason Lu, Xuesong Zhou:
Short-Term Highway Traffic State Prediction Using Structural State Space Models. J. Intell. Transp. Syst. 18(3): 309-322 (2014) - 2013
- [j8]Chung-Cheng Jason Lu, Jiuh-Biing Sheu:
Robust vertex p-center model for locating urgent relief distribution centers. Comput. Oper. Res. 40(8): 2128-2137 (2013) - [j7]Chung-Cheng Jason Lu:
Robust weighted vertex p-center model considering uncertain data: An application to emergency management. Eur. J. Oper. Res. 230(1): 113-121 (2013) - [j6]Chung-Cheng Jason Lu, Kune-Muh Tsai, Jung-Hung Chen, Wang-Tsang Lee:
Mitigating the Bullwhip Effect in the Supply Chain of Semiconductor Assembly and Testing Through an Inter-business Information Platform. Int. J. Electron. Bus. Manag. 11(3) (2013) - 2012
- [j5]Chung-Cheng Jason Lu, Vincent F. Yu:
Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows. Comput. Ind. Eng. 63(2): 520-529 (2012) - [j4]Chung-Cheng Jason Lu, Shih-Wei Lin, Kuo-Ching Ying:
Robust scheduling on a single machine to minimize total flow time. Comput. Oper. Res. 39(7): 1682-1691 (2012) - [j3]Chung-Cheng Jason Lu:
An Adaptive System for Predicting Freeway Travel times. Int. J. Inf. Technol. Decis. Mak. 11(4): 727-748 (2012) - 2011
- [j2]Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chung-Cheng Jason Lu:
Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Comput. Oper. Res. 38(5): 809-815 (2011) - [j1]Shih-Wei Lin, Vincent F. Yu, Chung-Cheng Jason Lu:
A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst. Appl. 38(12): 15244-15252 (2011)
Conference and Workshop Papers
- 2009
- [c1]Chung-Cheng Jason Lu, Ta-Hui Yang:
Comparing network performance under the provision of predictive and prevailing travel information. SOLI 2009: 255-260
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 2024-04-24 22:52 CEST 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:
