default search action
Haoxun Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j53]Zengxu Guo, Haoxun Chen
:
Joint optimization of inventory replenishment and rationing policies for an omnichannel store with both in-store and online demands. Comput. Ind. Eng. 191: 110171 (2024) - [j52]Lei Wang
A decomposition and coordination method for optimising ( Q , S ) policies in a two-echelon distribution system with joint replenishment. Int. J. Prod. Res. 62(1-2): 556-573 (2024) - [j51]Xinyue Liang, Haoxun Chen
Bi-Objective Vehicle Routing for Perishable Products Delivery With Consideration of Customers' Priorities and Customized Delivery Time Windows. IEEE Trans. Intell. Transp. Syst. 25(11): 16881-16896 (2024) - 2023
- [j50]Xiaohui Lyu, Haoxun Chen
A benders decomposition algorithm for a bid generation problem in the procurement of Three-echelon transportation services. Comput. Oper. Res. 158: 106291 (2023) - [j49]Zhaojin Li
A Lagrangian Relaxation Heuristic for a Bi-Objective Multimodal Transportation Planning Problem. IEEE Trans. Intell. Transp. Syst. 24(1): 382-399 (2023) - [c25]Zengxu Guo, Haoxun Chen:
Cost Evaluation of a (Q, r, K) Inventory Model with Two Demand Classes of Lost Sales and Backorders. APMS (3) 2023: 257-270 - 2022
- [j48]Lei Wang
Optimization of a stochastic joint replenishment inventory system with service level constraints. Comput. Oper. Res. 148: 106001 (2022) - [j47]Yunfeng Ma
An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts. Eur. J. Oper. Res. 301(1): 51-66 (2022) - [j46]Haoxun Chen, Bo Dai, Yuan Li, Yidong Zhang, Xiaoqing Wang, Yuming Deng:
Stock allocation in a two-echelon distribution system controlled by (s, S) policies. Int. J. Prod. Res. 60(3): 894-911 (2022) - [j45]Duc Huy Nguyen
An effective approach for optimization of a perishable inventory system with uncertainty in both demand and supply. Int. Trans. Oper. Res. 29(4): 2682-2704 (2022) - [j44]Peng Wu
Optimizing Locations and Qualities of Multiple Facilities With Competition via Intelligent Search. IEEE Trans. Intell. Transp. Syst. 23(6): 5092-5105 (2022) - [j43]Ke Lyu, Haoxun Chen
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) - 2021
- [j42]Qunli Yuchi, Nengmin Wang, Zhengwen He, Haoxun Chen:
Hybrid heuristic for the location-inventory-routing problem in closed-loop supply chain. Int. Trans. Oper. Res. 28(3): 1265-1295 (2021) - [j41]Xue Qiao, Zheng Wang
Joint Ordering and Markdown Policy for Short Lifetime Products With Competitive Price- and Freshness-Based Demand. IEEE Trans Autom. Sci. Eng. 18(4): 1956-1968 (2021) - [c24]Lei Wang
Optimization of a Periodic Review Joint Replenishment Policy for a Stochastic Inventory System. APMS (1) 2021: 493-501 - 2020
- [j40]Peng Wu, Feng Chu
IoT-based location and quality decision-making in emerging shared parking facilities with competition. Decis. Support Syst. 134: 113301 (2020) - [c23]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
- [j39]Zhen Yang
An effective hybrid approach to the two-stage capacitated facility location problem. Eur. J. Oper. Res. 275(2): 467-480 (2019) - [j38]Beibei Xiong, Haoxun Chen
A multi-objective distance friction minimization model for performance assessment through data envelopment analysis. Eur. J. Oper. Res. 279(1): 132-142 (2019) - [c22]Bo Dai, Haoxun Chen, Yuan Li, Yidong Zhang, Xiaoqing Wang, Yuming Deng:
Inventory Replenishment Planning of a Distribution System with Warehouses at the Locations of Producers and Minimum and Maximum Joint Replenishment Quantity Constraints. ICORES 2019: 277-284 - [c21]Zheng Chang, Haoxun Chen, Farouk Yalaoui:
Modeling and Evaluation of a City Logistics System with Freight Buses. ICORES 2019: 292-298 - [c20]Xiaohui Lyu, Haoxun Chen, Nengmin Wang:
An Iterative Request Exchange Mechanism for Carrier Collaboration in Less than Truckload Transportation. ICORES 2019: 299-306 - [c19]Elham Jelodari Mamaghani, Haoxun Chen, Christian Prins:
A Hybrid Genetic and Simulation Annealing Approach for a Multi-period Bid Generation Problem in Carrier Collaboration. ICORES 2019: 307-314 - 2018
- [j37]Duc Huy Nguyen
Supplier selection and operation planning in biomass supply chains with supply uncertainty. Comput. Chem. Eng. 118: 103-117 (2018) - 2017
- [j36]Haoxun Chen:
Undominated nonnegative excesses and core extensions of transferable utility games. Eur. J. Oper. Res. 261(1): 222-233 (2017) - [j35]Ming Li, Zheng Wang
A Robust Reorder-Time/Order-Quantity Policy Under Invisible Stock Loss. IEEE Trans. Syst. Man Cybern. Syst. 47(12): 3102-3116 (2017) - 2016
- [j34]Yuan Li, Haoxun Chen, Christian Prins
Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252(1): 27-38 (2016) - 2015
- [j33]Qingxian An
Measuring slacks-based efficiency for commercial banks in China by using a two-stage DEA model with undesirable output. Ann. Oper. Res. 235(1): 13-35 (2015) - [j32]Haoxun Chen, Peng Li:
Optimization of (R, Q) policies for serial inventory systems using the guaranteed service approach. Comput. Ind. Eng. 80: 261-273 (2015) - [j31]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) - [c18]Peng Li, Haoxun Chen:
Optimization of (R;Q) policies for two-level distribution inventory systems with operating flexibility. ICNSC 2015: 603-606 - 2014
- [j30]Bo Dai, Haoxun Chen, Genke Yang:
Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests. Oper. Res. 14(3): 361-386 (2014) - 2013
- [c17]Wenhua Zhao, Haoxun Chen:
Estimation-based variable neighborhood search approach for a probabilistic routing problem with deadlines in wireless sensor and actor networks. ICNSC 2013: 436-441 - 2012
- [j29]Yugang Yu, Chengbin Chu
Large scale stochastic inventory routing problems with split delivery and service level constraints. Ann. Oper. Res. 197(1): 135-158 (2012) - [j28]Bo Dai, Haoxun Chen:
Profit allocation mechanisms for carrier collaboration in pickup and delivery service. Comput. Ind. Eng. 62(2): 633-643 (2012) - [j27]Nasreddine Saidani, Feng Chu
Competitive facility location and design with reactions of competitors already in the market. Eur. J. Oper. Res. 219(1): 9-17 (2012) - [j26]Zhen Yang, Feng Chu
A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur. J. Oper. Res. 221(3): 521-532 (2012) - [j25]Bo Dai, Haoxun Chen:
Mathematical model and solution approach for carriers' collaborative transportation planning in less than truckload transportation. Int. J. Adv. Oper. Manag. 4(1/2): 62-84 (2012) - [j24]Chengbin Chu
A Polynomial Dynamic Programming Algorithm for Crude Oil Transportation Planning. IEEE Trans Autom. Sci. Eng. 9(1): 42-55 (2012) - [c16]Wenhua Zhao, Haoxun Chen, Huifeng Li:
A variable neighborhood search approach for multiple traveling salesman problem with deadlines. ICNSC 2012: 301-306 - 2011
- [j23]Jianxiang Li, Feng Chu
Coordination of split deliveries in one-warehouse multi-retailer distribution systems. Comput. Ind. Eng. 60(2): 291-301 (2011) - [j22]Zhen Yang, Haoxun Chen, Feng Chu
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem. Comput. Ind. Eng. 61(2): 430-435 (2011) - [j21]Qingning Shen, Feng Chu
A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation. Comput. Chem. Eng. 35(10): 2113-2123 (2011) - [j20]Jianxiang Li, Feng Chu
A solution approach to the inventory routing problem in a three-level distribution system. Eur. J. Oper. Res. 210(3): 736-744 (2011) - [j19]Bo Dai, Haoxun Chen:
A multi-agent and auction-based framework and approach for carrier collaboration. Logist. Res. 3(2-3): 101-120 (2011) - [c15]Bo Dai, Haoxun Chen:
Price-setting based Combinatorial Auction Approach for Carriers' Collaboration in Less than Truckload Transportation. ICAART (1) 2011: 407-413 - [c14]Peng Li, Haoxun Chen:
Optimal ( R, nQ ) Policies for Serial Inventory Systems with Guaranteed Service. OR 2011: 439-444 - 2010
- [j18]Jianxiang Li, Haoxun Chen, Feng Chu
Performance evaluation of distribution strategies for the inventory routing problem. Eur. J. Oper. Res. 202(2): 412-419 (2010) - [j17]Karim Labadi
Modelling, analysis and optimisation of supply chains by using Petri net models: the state-of-the-art. Int. J. Bus. Perform. Supply Chain Model. 2(3/4): 188-215 (2010)
2000 – 2009
- 2009
- [j16]Yugang Yu, Feng Chu
A Stackelberg game and its improvement in a VMI system with a manufacturing vendor. Eur. J. Oper. Res. 192(3): 929-948 (2009) - 2008
- [j15]Zhihai Xiang
The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. Eur. J. Oper. Res. 185(2): 534-551 (2008) - [j14]Yugang Yu, Haoxun Chen, Feng Chu
A new model and hybrid approach for large scale inventory routing problems. Eur. J. Oper. Res. 189(3): 1022-1040 (2008) - [j13]Yasmina Hani, Lionel Amodeo
Simulation based optimization of a train maintenance facility. J. Intell. Manuf. 19(3): 293-300 (2008) - [c13]Feng Chu
An O(T3) Polynomial algorithm for crude oil transportation. CASE 2008: 303-308 - [c12]Jianxiang Li, Haoxun Chen, Feng Chu
Effectiveness evaluation on direct shipping strategy. SMC 2008: 1760-1764 - 2007
- [j12]Yugang Yu, Feng Chu
A note on coordination of production and distribution planning. Eur. J. Oper. Res. 177(1): 626-629 (2007) - [j11]Yasmina Hani, Lionel Amodeo, Farouk Yalaoui, Haoxun Chen:
Ant colony optimization for solving an industrial layout problem. Eur. J. Oper. Res. 183(2): 633-642 (2007) - [j10]Karim Labadi
Modeling and Performance Evaluation of Inventory Systems Using Batch Deterministic and Stochastic Petri Nets. IEEE Trans. Syst. Man Cybern. Part C 37(6): 1287-1302 (2007) - [c11]Lionel Amodeo
Multi-objective Supply Chain Optimization: An Industrial Case Study. EvoWorkshops 2007: 732-741 - [c10]Karim Labadi, Haoxun Chen, Lionel Amodeo:
Transformation analysis methods for the BDSPN model. ICINCO-SPSMC 2007: 135-141 - [c9]Jianxiang Li, Feng Chu
Probabilistic analysis on three-level distribution systems. SMC 2007: 1729-1734 - 2006
- [j9]Zhihai Xiang
A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. 174(2): 1117-1139 (2006) - 2005
- [j8]Haoxun Chen, Lionel Amodeo, Feng Chu
Modeling and performance evaluation of supply chains using batch deterministic and stochastic Petri nets. IEEE Trans Autom. Sci. Eng. 2(2): 132-144 (2005) - 2004
- [c8]Karim Labadi
Batch deterministic and stochastic Petri nets modeling, analysis and its application to supply chain. SMC (5) 2004: 4515-4520 - 2003
- [j7]Haoxun Chen, Peter B. Luh:
An alternative framework to Lagrangian relaxation approach for job shop scheduling. Eur. J. Oper. Res. 149(3): 499-512 (2003) - [j6]Peter B. Luh, Ming Ni, Haoxun Chen, Lakshman S. Thakur:
Price-based approach for activity coordination in a supply network. IEEE Trans. Robotics Autom. 19(2): 335-346 (2003) - [c7]Haoxun Chen, Chengbin Chu:
Supply chain planning with order/setup costs and capacity constraints a new Lagrangian relaxation approach. ICRA 2003: 1743-1748 - 2002
- [c6]Haoxun Chen, Lionel Amodeo, Feng Chu:
Batch Deterministic and Stochastic Petri Nets: A Tool for Modeling and Performance Evaluation of Supply Chain. ICRA 2002: 78-83 - 2001
- [j5]Haoxun Chen, Hans-Michael Hanisch:
Analysis of Hybrid Systems Based on Hybrid Net Condition/Event System Model. Discret. Event Dyn. Syst. 11(1-2): 163-185 (2001) - [c5]Haoxun Chen, Peter B. Luh, Lei Fang:
A Time Window Based Approach for Job Shop Scheduling. ICRA 2001: 842-847 - 2000
- [j4]Haoxun Chen:
Control Synthesis of Petri Nets Based on S-Decreases. Discret. Event Dyn. Syst. 10(3): 233-249 (2000) - [j3]Haoxun Chen, Hans-Michael Hanisch:
Control synthesis of timed discrete event systems based on predicate invariance. IEEE Trans. Syst. Man Cybern. Part B 30(5): 713-724 (2000) - [c4]Haoxun Chen, Peter B. Luh:
Scheduling and Coordination in Manufacturing Enterprise Automation. ICRA 2000: 389-394
1990 – 1999
- 1999
- [c3]Haoxun Chen, Jürgen Ihlow, Carsten Lehmann:
A Genetic Algorithm for Flexible Job-Shop Scheduling. ICRA 1999: 1120-1125 - 1998
- [j2]Haoxun Chen, Chengbin Chu, Jean-Marie Proth:
Cyclic scheduling of a hoist with time window constraints. IEEE Trans. Robotics Autom. 14(1): 144-152 (1998) - [j1]Haoxun Chen, Chengbin Chu, Jean-Marie Proth:
An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method. IEEE Trans. Robotics Autom. 14(5): 786-795 (1998) - 1997
- [c2]Haoxun Chen, Hans-Michael Hanisch:
Control Synthesis of Hybrid Systems Based on Predicate Invariance. Hybrid Systems 1997: 1-15 - 1995
- [c1]Haoxun Chen, Chengbin Chu, Jean-Marie Proth:
A More Efficient lagrangian Relaxation Approach to Job-Shop Scheduling Problems. ICRA 1995: 496-501
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-02 22:29 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: