default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAda Che
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j50]Eugene Levner, Vladimir Kats, Pengyu Yan, Ada Che:
Fast Algorithm for High-Throughput Screening Scheduling Based on the PERT/CPM Project Management Technique. Algorithms 17(3): 127 (2024)- [j49]Ada Che, Jing Li
, Feng Chu, Chengbin Chu:
Optimizing emergency supply pre-positioning for disaster relief: A two-stage distributionally robust approach. Comput. Oper. Res. 166: 106607 (2024) - [j48]Chenge Wei, Sanne Wøhlk, Ada Che:
A multi-level capacitated arc routing problem with intermediate facilities in waste collection. Comput. Oper. Res. 167: 106671 (2024) - [j47]Jieyu Lei, Ada Che, Tom Van Woensel:
Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network. Eur. J. Oper. Res. 313(2): 478-493 (2024) - [j46]Jianguang Feng, Ada Che, Chengbin Chu, Eugene Levner, Vladimir Kats:
Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity. Eur. J. Oper. Res. 319(2): 468-483 (2024) - [j45]Bohan Zhang, Ada Che, Yusheng Wang:
Grid-based artificial bee colony algorithm for multi-objective job shop scheduling with manual loading and unloading tasks. Expert Syst. Appl. 245: 123011 (2024) - [j44]Yipei Zhang, Feng Chu, Ada Che, Yantong Li:
Closed-loop inventory routing problem for perishable food with returnable transport items selection. Int. J. Prod. Res. 62(1-2): 501-521 (2024) - [j43]Ziliang Wang, Chenhao Zhou, Ada Che, Jingkun Gao:
A policy-based Monte Carlo tree search method for container pre-marshalling. Int. J. Prod. Res. 62(13): 4776-4792 (2024) - [j42]Xiangyu Qin, Ada Che, Bei Wu:
Modeling coupling impacts of self-healing mechanisms and dynamic environments on systems subject to dependent failure processes. Reliab. Eng. Syst. Saf. 250: 110272 (2024) - [j41]Bei Wu, Zhizhong Tan, Ada Che, Lirong Cui:
A Novel Resilience Assessment Framework for Multi-component Critical Infrastructure. IEEE Trans. Engineering Management 71: 14011-14031 (2024) - [j40]Jing Li, Feng Chu, Ada Che, Yunqiang Yin:
A Three-Stage Relief Network Design Approach for Predictable Disasters Considering Time-Dependent Uncertainty. IEEE Trans. Intell. Transp. Syst. 25(6): 5418-5434 (2024) - [j39]Ada Che, Ziliang Wang, Chenhao Zhou:
Multi-Agent Deep Reinforcement Learning for Recharging-Considered Vehicle Scheduling Problem in Container Terminals. IEEE Trans. Intell. Transp. Syst. 25(11): 16855-16868 (2024) - 2023
- [j38]Jianguang Feng, Ada Che:
A note on integrated disassembly line balancing and routing problem. Int. J. Prod. Res. 61(9): 3145-3151 (2023) - [j37]Yusheng Wang, Ada Che, Jianguang Feng:
Energy-efficient unrelated parallel machine scheduling with general position-based deterioration. Int. J. Prod. Res. 61(17): 5886-5900 (2023) - [j36]Zhizhong Tan, Bei Wu, Ada Che:
Resilience modeling for multi-state systems based on Markov processes. Reliab. Eng. Syst. Saf. 235: 109207 (2023) - [j35]Ada Che, Wenjia Wang, Xiaohu Mu, Yipei Zhang, Jianguang Feng:
Tabu-Based Adaptive Large Neighborhood Search for Multi-Depot Petrol Station Replenishment With Open Inter-Depot Routes. IEEE Trans. Intell. Transp. Syst. 24(1): 316-330 (2023) - 2022
- [j34]Yipei Zhang, Ada Che, Feng Chu:
Improved model and efficient method for bi-objective closed-loop food supply chain problem with returnable transport items. Int. J. Prod. Res. 60(3): 1051-1068 (2022) - [j33]Ada Che, Jieyu Lei, Zhibin Jiang:
Optimised redesign of reverse logistics network with multi-level capacity choices for household appliances. Int. J. Prod. Res. 60(18): 5615-5632 (2022) - [j32]Peng Wu, Ling Xu, Ada Che, Feng Chu:
A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation. J. Comb. Optim. 43(5): 1298-1327 (2022) - [j31]Ke Lyu, Haoxun Chen, Ada Che:
A Bid Generation Problem in Truckload Transportation Service Procurement Considering Multiple Periods and Uncertainty: Model and Benders Decomposition Approach. IEEE Trans. Intell. Transp. Syst. 23(7): 9157-9170 (2022) - [c10]Mengyu Zhu, Chenhao Zhou, Ada Che:
Simulation-Optimization Approach for Integrated Scheduling at Wharf Apron in Container Terminals. WSC 2022: 1944-1955 - 2021
- [j30]Pengyu Yan, Hongru Miao, Ada Che, Kaize Yu:
Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants. Comput. Oper. Res. 128: 105130 (2021) - [j29]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
- [j28]Peng Wu, Feng Chu, Ada Che, Yongxiang Zhao:
Dual-Objective Optimization for Lane Reservation With Residual Capacity and Budget Constraints. IEEE Trans. Syst. Man Cybern. Syst. 50(6): 2187-2197 (2020) - [c9]Ke Lyu, Haoxun Chen, Ada Che:
Combinatorial Auction for Truckload Transportation Service Procurement with Auctioneer-Generated Supplementary Bundles of Requests. ITSC 2020: 1-6
2010 – 2019
- 2019
- [j27]Yipei Zhang, Feng Chu, Ada Che, Yugang Yu, Xin Feng:
Novel model and kernel search heuristic for multi-period closed-loop food supply chain planning with returnable transport items. Int. J. Prod. Res. 57(23): 7439-7456 (2019) - 2018
- [j26]Jianguang Feng, Chengbin Chu, Ada Che:
Cyclic jobshop hoist scheduling with multi-capacity reentrant tanks and time-window constraints. Comput. Ind. Eng. 120: 382-391 (2018) - [j25]Jianguang Feng, Ada Che:
Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments. Comput. Oper. Res. 95: 163-171 (2018) - [j24]Pengyu Yan, Ada Che, Eugene Levner, Shi Qiang Liu:
A Heuristic for Inserting Randomly Arriving Jobs Into an Existing Hoist Schedule. IEEE Trans Autom. Sci. Eng. 15(3): 1423-1430 (2018) - [j23]Peng Wu, Feng Chu, Ada Che, MengChu Zhou:
Bi-Objective Scheduling of Fire Engines for Fighting Forest Fires: New Optimization Approaches. IEEE Trans. Intell. Transp. Syst. 19(4): 1140-1151 (2018) - [j22]Nengmin Wang, Meng Zhang, Ada Che, Bin Jiang:
Bi-Objective Vehicle Routing for Hazardous Materials Transportation With No Vehicles Travelling in Echelon. IEEE Trans. Intell. Transp. Syst. 19(6): 1867-1879 (2018) - 2017
- [j21]Ada Che, Yipei Zhang, Jianguang Feng:
Bi-objective optimization for multi-floor facility layout problem with fixed inner configuration and room adjacency constraints. Comput. Ind. Eng. 105: 265-276 (2017) - [j20]Peng Wu, Feng Chu, Ada Che, Yunfei Fang:
An efficient two-phase exact algorithm for the automated truck freight transportation problem. Comput. Ind. Eng. 110: 59-66 (2017) - [j19]Ada Che, Xueqi Wu, Jing Peng, Pengyu Yan:
Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Comput. Oper. Res. 85: 172-183 (2017) - [j18]Ada Che, Vladimir Kats, Eugene Levner:
An efficient bicriteria algorithm for stable robotic flow shop scheduling. Eur. J. Oper. Res. 260(3): 964-971 (2017) - [j17]Peng Wu, Ada Che, Feng Chu, Yunfei Fang:
Exact and Heuristic Algorithms for Rapid and Station Arrival-Time Guaranteed Bus Transportation via Lane Reservation. IEEE Trans. Intell. Transp. Syst. 18(8): 2028-2043 (2017) - 2016
- [j16]Pengyu Yan, Guanhua Wang, Ada Che, Yaoyiran Li:
Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance. Comput. Oper. Res. 76: 155-166 (2016) - 2015
- [j15]Jianguang Feng, Ada Che, Chengbin Chu:
Dynamic hoist scheduling problem with multi-capacity reentrant machines: A mixed integer programming approach. Comput. Ind. Eng. 87: 611-620 (2015) - [j14]Ada Che, Jianguang Feng, Haoxun Chen, Chengbin Chu:
Robust optimization for the cyclic hoist scheduling problem. Eur. J. Oper. Res. 240(3): 627-636 (2015) - [j13]Peng Wu, Ada Che, Feng Chu, MengChu Zhou:
An Improved Exact ε-Constraint and Cut-and-Solve Combined Method for Biobjective Robust Lane Reservation. IEEE Trans. Intell. Transp. Syst. 16(3): 1479-1492 (2015) - [j12]Ada Che, Peng Wu, Feng Chu, MengChu Zhou:
Improved Quantum-Inspired Evolutionary Algorithm for Large-Size Lane Reservation. IEEE Trans. Syst. Man Cybern. Syst. 45(12): 1535-1548 (2015) - [c8]Ada Che, Ke Lv, Eugene Levner, Vladimir Kats:
Energy consumption minimization for single machine scheduling with bounded maximum tardiness. ICNSC 2015: 146-150 - [c7]Peng Wu, Feng Chu, Ada Che:
Mixed-integer Programming for a New Bus-lane Reservation Problem. ITSC 2015: 2782-2787 - 2014
- [j11]Pengyu Yan, Ada Che, Xiaoqiang Cai, Xiaowo Tang:
Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance. Comput. Oper. Res. 50: 128-140 (2014) - [j10]Ada Che, Weidong Lei, Jianguang Feng, Chengbin Chu:
An Improved Mixed Integer Programming Approach for Multi-Hoist Cyclic Scheduling Problem. IEEE Trans Autom. Sci. Eng. 11(1): 302-309 (2014) - [c6]Yipei Zhang, Ada Che:
A Mixed Integer Linear Programming approach for a new form of facility layout problem. CoDIT 2014: 65-68 - [c5]Peng Wu, Feng Chu, Ada Che, Qin Shi:
A bus lane reservation problem in urban bus transit network. ITSC 2014: 2864-2869 - 2013
- [j9]Zhen Zhou, Feng Chu, Ada Che, MengChu Zhou:
$\varepsilon$-Constraint and Fuzzy Logic-Based Optimization of Hazardous Material Transportation via Lane Reservation. IEEE Trans. Intell. Transp. Syst. 14(2): 847-857 (2013) - [c4]Peng Wu, Ada Che, Feng Chu:
A quantum evolutionary algorithm for lane reservation problem. ICNSC 2013: 264-268 - 2012
- [c3]Pengyu Yan, Xiaowo Tang, Ada Che, Chengbin Chu:
Cyclic robotic cells scheduling using tabu search algorithm. ICNSC 2012: 58-62 - [c2]Zhen Zhou, Feng Chu, Ada Che, Saïd Mammar:
A multi-objective model for the hazardous materials transportation problem based on lane reservation. ICNSC 2012: 328-333 - 2011
- [j8]Ada Che, Hongjian Hu, Michelle Chabrol, Michel Gourgand:
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell. Comput. Oper. Res. 38(9): 1275-1285 (2011) - [c1]Yunfei Fang, Feng Chu, Saïd Mammar, Ada Che:
Iterative algorithm for lane reservation problem on transportation network. ICNSC 2011: 305-310
2000 – 2009
- 2009
- [j7]Ada Che, Chengbin Chu:
Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. Eur. J. Oper. Res. 199(1): 77-88 (2009) - [j6]Ada Che, Vladimir Kats, Eugene Levner:
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem. Theor. Comput. Sci. 410(47-49): 5188-5190 (2009) - 2007
- [j5]Ada Che, Chengbin Chu:
Cyclic hoist scheduling in large real-life electroplating lines. OR Spectr. 29(3): 445-470 (2007) - 2005
- [j4]Ada Che, Chengbin Chu:
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. Oper. Res. Lett. 33(3): 274-284 (2005) - [j3]Ada Che, Chengbin Chu:
Multi-degree cyclic scheduling of two robots in a no-wait flowshop. IEEE Trans Autom. Sci. Eng. 2(2): 173-183 (2005) - 2003
- [j2]Ada Che, Chengbin Chu, Eugene Levner:
A polynomial algorithm for 2-degree cyclic robot scheduling. Eur. J. Oper. Res. 145(1): 31-44 (2003) - 2002
- [j1]Ada Che, Chengbin Chu, Feng Chu:
Multicyclic hoist scheduling with constant processing times. IEEE Trans. Robotics Autom. 18(1): 69-80 (2002)
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-12-10 21:40 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:
