Tighter bound for MULTIFIT scheduling on uniform processors. - Bo Chen 002 (Discret. Appl. Math., 1991)

Approximation Algorithms for Three-Machine Open Shop Scheduling. - Bo Chen 002; Vitaly A. Strusevich (INFORMS J. Comput., 1993)

A note on LPT scheduling. - Bo Chen 002 (Oper. Res. Lett., 1993)

A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times. - Bo Chen 002 (SIAM J. Comput., 1993)

A Lower Bound for Randomized On-Line Scheduling Algorithms. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Inf. Process. Lett., 1994)

New lower and upper bounds for on-line scheduling. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Oper. Res. Lett., 1994)

An optimal algorithm for preemptive on-line scheduling. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Oper. Res. Lett., 1995)

A New Heuristic for Three-Machine Flow Shop Scheduling. - Bo Chen 002; Celia A. Glass; Chris N. Potts; Vitaly A. Strusevich (Oper. Res., 1996)

Scheduling on identical machines: How good is LPT in an on-line setting? - Bo Chen 002; Arjen P. A. Vestjens (Oper. Res. Lett., 1997)

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling". - R. Chandrasekaran; Bo Chen 002; Gábor Galambos; P. R. Narayanan; André van Vliet (SIAM J. Comput., 1997)

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. - Bo Chen 002; Arjen P. A. Vestjens; Gerhard J. Woeginger (J. Comb. Optim., 1998)

Approximation algorithms for two-machine flow shop scheduling with batch setup times. - Bo Chen 002; Chris N. Potts; Vitaly A. Strusevich (Math. Program., 1998)

On-Line Algorithms for Cardinality Constrained Bin Packing Problems. - Luitpold Babel; Bo Chen 002; Hans Kellerer; Vladimir Kotov (ISAAC, 2001)

On-line scheduling of small open shops. - Bo Chen 002; Donglei Du; Jiye Han; Jianjun Wen (Discret. Appl. Math., 2001)

Optimisation models for re-routing air traffic flows in Europe. - Paula A. Leal de Matos; Bo Chen 002; Richard J. Ormerod (J. Oper. Res. Soc., 2001)

A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). - Jiawei Zhang 006; Bo Chen 002; Yinyu Ye 001 (IPCO, 2004)

Algorithms for on-line bin-packing problems with cardinality constraints. - Luitpold Babel; Bo Chen 002; Hans Kellerer; Vladimir Kotov (Discret. Appl. Math., 2004)

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. - Bo Chen 002; Xiaotie Deng; Wenan Zang (J. Comb. Optim., 2004)

Parallel Scheduling for Early Completion. - Bo Chen 002 (Handbook of Scheduling, 2004)

A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem. - Jiawei Zhang 006; Bo Chen 002; Yinyu Ye 001 (Math. Oper. Res., 2005)

Book review. - Bo Chen 002 (Oper. Res. Lett., 2005)

Lot-sizing scheduling with batch setup times. - Bo Chen 002; Yinyu Ye 001; Jiawei Zhang 006 (J. Sched., 2006)

Logistics scheduling with batching and transportation. - Bo Chen 002; Chung-Yee Lee (Eur. J. Oper. Res., 2008)

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. - Xujin Chen; Bo Chen 002 (Algorithmica, 2009)

Cost-effective designs of fault-tolerant access networks in communication systems. - Xujin Chen; Bo Chen 002 (Networks, 2009)

On-line service scheduling. - Zhenbo Wang; Wenxun Xing; Bo Chen 002 (J. Sched., 2009)

The price of atomic selfish ring routing. - Bo Chen 002; Xujin Chen; Xiaodong Hu 001 (J. Comb. Optim., 2010)

A comprehensive decision-making model for risk management of supply chain. - De Xia; Bo Chen 002 (Expert Syst. Appl., 2011)

Efficiency analysis of load balancing games with and without activation costs. - Bo Chen 002; Sinan Gürel (J. Sched., 2012)

Strong Stability of Nash Equilibria in Load Balancing Games. - Bo Chen 002; Song-Song Li; Yu-Zhong Zhang (CoRR, 2013)

Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands. - Chenlan Wang; Xuan Vinh Doan; Bo Chen 002 (CoRR, 2013)

Tactical fixed job scheduling with spread-time constraints. - Shuyu Zhou; Xiandong Zhang; Bo Chen 002; Steef L. van de Velde (Comput. Oper. Res., 2014)

Structural Properties of an Open Problem in Preemptive Scheduling. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (CoRR, 2015)

Normal-form preemption sequences for an open problem in scheduling theory. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2016)

A Network Game of Dynamic Traffic. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (EC, 2017)

Combinatorial optimization: theory, computation, and applications. - Bo Chen 002; Peter Gritzmann; Silvano Martello (Discret. Appl. Math., 2017)

The importance of voting order for jury decisions by sequential majority voting. - Steve Alpern; Bo Chen 002 (Eur. J. Oper. Res., 2017)

Supplier Competition with Option Contracts for Discrete Blocks of Capacity. - Edward J. Anderson; Bo Chen 002; Lusheng Shao (Oper. Res., 2017)

Vehicle routing with probabilistic capacity constraints. - Mahdi Noorizadegan; Bo Chen 002 (Eur. J. Oper. Res., 2018)

Price of fairness in two-agent single-machine scheduling problems. - Alessandro Agnetis; Bo Chen 002; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2019)

Scheduling with time-of-use costs. - Bo Chen 002; Xiandong Zhang (Eur. J. Oper. Res., 2019)

Optimizing Voting Order on Sequential Juries: A Median Voter Theorem. - Steve Alpern; Bo Chen 002 (CoRR, 2020)

Achieving Efficiency in Capacity Procurement. - Lusheng Shao; Edward J. Anderson; Bo Chen 002 (Found. Trends Technol. Inf. Oper. Manag., 2020)

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores. - Ankang Sun; Bo Chen 002; Xuan Vinh Doan (AAMAS, 2021)

New progress in combinatorial optimization. - Bo Chen 002; Silvano Martello; Bernard Ries (Discret. Appl. Math., 2021)

Incentive schemes for resolving Parkinson's Law in project management. - Bo Chen 002; Nicholas G. Hall (Eur. J. Oper. Res., 2021)

Rawlsian fairness in push and pull supply chains. - Yanmin Jiang; Xiaole Wu; Bo Chen 002; Qiying Hu (Eur. J. Oper. Res., 2021)

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (Oper. Res., 2021)

Scheduling coupled tasks with exact delays for minimum total job completion time. - Bo Chen 002; Xiandong Zhang (J. Sched., 2021)

Capacity Games with Supply Function Competition. - Edward J. Anderson; Bo Chen 002; Lusheng Shao (Oper. Res., 2022)

Preface. - Bo Chen 002; Dachuan Xu; Guochuan Zhang (J. Comb. Optim., 2022)

Atomic congestion games with random players: network equilibrium and the price of anarchy. - Chenlan Wang; Xuan Vinh Doan; Bo Chen 002 (J. Comb. Optim., 2022)

Optimizing voting order on sequential juries: a median voter theorem and beyond. - Steve Alpern; Bo Chen 002 (Soc. Choice Welf., 2022)

Bounding Residence Times for Atomic Dynamic Routings. - Zhigang Cao 002; Bo Chen 002; Xujin Chen; Changjun Wang (Math. Oper. Res., 2022)

Equitability and welfare maximization for allocating indivisible items. - Ankang Sun; Bo Chen 002; Xuan Vinh Doan (Auton. Agents Multi Agent Syst., 2023)

An improved approximation algorithm for scheduling monotonic moldable tasks. - Fangfang Wu; Xiandong Zhang; Bo Chen 002 (Eur. J. Oper. Res., 2023)

An FPTAS for scheduling with resource constraints. - Bo Chen 002; Vitaly A. Strusevich (Oper. Res. Lett., 2023)

Fairness criteria for allocating indivisible chores: connections and efficiencies. - Ankang Sun; Bo Chen 002; Xuan Vinh Doan (Auton. Agents Multi Agent Syst., 2023)

Operational Research: methods and applications. - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

Randomized strategyproof mechanisms with best of both worlds fairness and efficiency. - Ankang Sun; Bo Chen 002 (Eur. J. Oper. Res., 2025)

New Challenges in Combinatorial Optimization. - Bo Chen 002; Alexander S. Kulikov; Silvano Martello (J. Comb. Optim., 2025)