Chen Bo

Bo Chen

Information about the author Bo Chen will soon be added to the site.
Found 16 papers in total
Supplier Competition with Option Contracts for Discrete Blocks of Capacity
Supplier Competition with Option Contracts for Discrete Blocks of Capacity
2017
When a firm faces an uncertain demand, it is common to procure supply using some type...
On the feasible payoff set of two‐player repeated games with unequal discounting
On the feasible payoff set of two‐player repeated games with unequal discounting
2013
We provide a novel characterization of the feasible payoff set of a general...
Efficiency analysis of load balancing games with and without activation costs
Efficiency analysis of load balancing games with and without activation costs
2012
In this paper, we study two models of resource allocation games: the classical...
Lot-sizing scheduling with batch setup times
Lot-sizing scheduling with batch setup times
2006
This paper is concerned with scheduling independent jobs on m parallel machines in...
Scheduling of batch plants: Constraint-based approach and performance investigation
Scheduling of batch plants: Constraint-based approach and performance investigation
2007
Batch processing plants are attractive due to their suitability for the manufacturing...
A multiexchange local search algorithm for the capacitated facility location problem
A multiexchange local search algorithm for the capacitated facility location problem
2005
We present a multiexchange local search algorithm for approximating the capacitated...
On-line scheduling a batch processing system to minimize total weighted job completion time
On-line scheduling a batch processing system to minimize total weighted job completion time
2004
Scheduling a batch processing system has been extensively studied in the last decade....
On-line preemptive scheduling on uniform machines
On-line preemptive scheduling on uniform machines
2001
We address the problem of preemptively scheduling on-line jobs on a set of m arbitrary...
How good is a dense shop schedule?
How good is a dense shop schedule?
2001
In this paper, we study a class of simple and easy-to-construct shop schedules, known...
Scheduling on identical machines: How good is longest processing time in an on-line setting?
Scheduling on identical machines: How good is longest processing time in an on-line setting?
1997
We consider a parallel machine scheduling problem where jobs arrive over time. A set...
Approximation algorithms for two-machine flow shop scheduling with batch setup times
Approximation algorithms for two-machine flow shop scheduling with batch setup times
1998
In many practical situations, batching of similar jobs to avoid setups is performed...
An optimal algorithm for preemptive on-line scheduling
An optimal algorithm for preemptive on-line scheduling
1995
The authors investigate the problem of on-line scheduling jobs on m identical parallel...
Worst-case analysis of heuristics for open shops with parallel machines
Worst-case analysis of heuristics for open shops with parallel machines
1993
The paper considers the multi-stage open shop scheduling problem wit a numbe of...
New lower and upper bounds for on-line scheduling
New lower and upper bounds for on-line scheduling
1994
The authors investigate the problem of on-line scheduling a set of independent jobs on...
A note on LPT scheduling
A note on LPT scheduling
1993
In the theory of parallel-machine scheduling, the Largest Processing-Time-first (LPT)...
Tighter bound for MULTIFIT scheduling on uniform processors
Tighter bound for MULTIFIT scheduling on uniform processors
1991
The paper examines one of the basic, well studied problems of scheduling theory, that...
Papers per page: