Bo Chen

Orcid: 0000-0001-7605-9453

Affiliations:
  • University of Warwick, Warwick Business School, Coventry, UK
  • Erasmus Universiteit Rotterdam, Institute of Econometrics, The Netherlands (PhD 1994)


According to our database1, Bo Chen authored at least 58 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fairness criteria for allocating indivisible chores: connections and efficiencies.
Auton. Agents Multi Agent Syst., October, 2023

An FPTAS for scheduling with resource constraints.
Oper. Res. Lett., July, 2023

An improved approximation algorithm for scheduling monotonic moldable tasks.
Eur. J. Oper. Res., 2023

Equitability and welfare maximization for allocating indivisible items.
Auton. Agents Multi Agent Syst., 2023

2022
Bounding Residence Times for Atomic Dynamic Routings.
Math. Oper. Res., November, 2022

Optimizing voting order on sequential juries: a median voter theorem and beyond.
Soc. Choice Welf., 2022

Atomic congestion games with random players: network equilibrium and the price of anarchy.
J. Comb. Optim., 2022

Preface.
J. Comb. Optim., 2022

Capacity Games with Supply Function Competition.
Oper. Res., 2022

2021
Scheduling coupled tasks with exact delays for minimum total job completion time.
J. Sched., 2021

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents.
Oper. Res., 2021

Rawlsian fairness in push and pull supply chains.
Eur. J. Oper. Res., 2021

Incentive schemes for resolving Parkinson's Law in project management.
Eur. J. Oper. Res., 2021

New progress in combinatorial optimization.
Discret. Appl. Math., 2021

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Achieving Efficiency in Capacity Procurement.
Found. Trends Technol. Inf. Oper. Manag., 2020

Optimizing Voting Order on Sequential Juries: A Median Voter Theorem.
CoRR, 2020

2019
Scheduling with time-of-use costs.
Eur. J. Oper. Res., 2019

Price of fairness in two-agent single-machine scheduling problems.
Eur. J. Oper. Res., 2019

2018
Vehicle routing with probabilistic capacity constraints.
Eur. J. Oper. Res., 2018

2017
Supplier Competition with Option Contracts for Discrete Blocks of Capacity.
Oper. Res., 2017

The importance of voting order for jury decisions by sequential majority voting.
Eur. J. Oper. Res., 2017

Combinatorial optimization: theory, computation, and applications.
Discret. Appl. Math., 2017

A Network Game of Dynamic Traffic.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Normal-form preemption sequences for an open problem in scheduling theory.
J. Sched., 2016

2015
Structural Properties of an Open Problem in Preemptive Scheduling.
CoRR, 2015

2014
Tactical fixed job scheduling with spread-time constraints.
Comput. Oper. Res., 2014

2013
Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands.
CoRR, 2013

Strong Stability of Nash Equilibria in Load Balancing Games.
CoRR, 2013

2012
Efficiency analysis of load balancing games with and without activation costs.
J. Sched., 2012

2011
A comprehensive decision-making model for risk management of supply chain.
Expert Syst. Appl., 2011

2010
The price of atomic selfish ring routing.
J. Comb. Optim., 2010

2009
On-line service scheduling.
J. Sched., 2009

Cost-effective designs of fault-tolerant access networks in communication systems.
Networks, 2009

Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.
Algorithmica, 2009

2008
Logistics scheduling with batching and transportation.
Eur. J. Oper. Res., 2008

2006
Lot-sizing scheduling with batch setup times.
J. Sched., 2006

2005
Book review.
Oper. Res. Lett., 2005

A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem.
Math. Oper. Res., 2005

2004
Parallel Scheduling for Early Completion.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.
J. Comb. Optim., 2004

Algorithms for on-line bin-packing problems with cardinality constraints.
Discret. Appl. Math., 2004

A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2001
Optimisation models for re-routing air traffic flows in Europe.
J. Oper. Res. Soc., 2001

On-line scheduling of small open shops.
Discret. Appl. Math., 2001

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program., 1998

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time.
J. Comb. Optim., 1998

1997
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput., 1997

Scheduling on identical machines: How good is LPT in an on-line setting?
Oper. Res. Lett., 1997

1996
A New Heuristic for Three-Machine Flow Shop Scheduling.
Oper. Res., 1996

1995
An optimal algorithm for preemptive on-line scheduling.
Oper. Res. Lett., 1995

1994
New lower and upper bounds for on-line scheduling.
Oper. Res. Lett., 1994

A Lower Bound for Randomized On-Line Scheduling Algorithms.
Inf. Process. Lett., 1994

1993
A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times.
SIAM J. Comput., 1993

A note on LPT scheduling.
Oper. Res. Lett., 1993

Approximation Algorithms for Three-Machine Open Shop Scheduling.
INFORMS J. Comput., 1993

1991
Tighter bound for MULTIFIT scheduling on uniform processors.
Discret. Appl. Math., 1991


  Loading...