| Publication | Date of Publication | Type |
|---|
Operational Research: Methods and Applications
(available as arXiv preprint) | N/A | Paper |
Randomized strategyproof mechanisms with best of both worlds fairness and efficiency
European Journal of Operational Research | 2025-05-20 | Paper |
An FPTAS for scheduling with resource constraints
Operations Research Letters | 2023-09-12 | Paper |
An improved approximation algorithm for scheduling monotonic moldable tasks
European Journal of Operational Research | 2023-07-03 | Paper |
Bounding Residence Times for Atomic Dynamic Routings
Mathematics of Operations Research | 2023-01-09 | Paper |
Atomic congestion games with random players: network equilibrium and the price of anarchy
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Capacity games with supply function competition
Operations Research | 2022-09-19 | Paper |
Optimizing voting order on sequential juries: a median voter theorem and beyond
Social Choice and Welfare | 2022-04-13 | Paper |
Atomic dynamic flow games: adaptive vs. nonadaptive agents
Operations Research | 2022-02-16 | Paper |
Scheduling coupled tasks with exact delays for minimum total job completion time
Journal of Scheduling | 2021-12-13 | Paper |
Rawlsian fairness in push and pull supply chains
European Journal of Operational Research | 2021-06-04 | Paper |
Incentive schemes for resolving Parkinson's law in project management
European Journal of Operational Research | 2021-06-03 | Paper |
A functional equation of tail-balance for continuous signals in the Condorcet jury theorem
Aequationes Mathematicae | 2021-02-15 | Paper |
Price of fairness in two-agent single-machine scheduling problems
European Journal of Operational Research | 2019-02-25 | Paper |
Scheduling with time-of-use costs
European Journal of Operational Research | 2019-01-09 | Paper |
Vehicle routing with probabilistic capacity constraints
European Journal of Operational Research | 2018-07-12 | Paper |
The importance of voting order for jury decisions by sequential majority voting
European Journal of Operational Research | 2018-05-25 | Paper |
Who should cast the casting vote? Using sequential voting to amalgamate information
Theory and Decision | 2018-03-28 | Paper |
Normal-form preemption sequences for an open problem in scheduling theory
Journal of Scheduling | 2018-02-28 | Paper |
Supplier competition with option contracts for discrete blocks of capacity
Operations Research | 2017-09-26 | Paper |
Tactical fixed job scheduling with spread-time constraints
Computers & Operations Research | 2016-11-10 | Paper |
Strong stability of Nash equilibria in load balancing games
Science China. Mathematics | 2014-12-02 | Paper |
Stability vs. optimality in selfish ring routing
Acta Mathematica Sinica, English Series | 2014-06-11 | Paper |
Efficiency analysis of load balancing games with and without activation costs
Journal of Scheduling | 2014-02-05 | Paper |
Cost-effective designs of fault-tolerant access networks in communication systems
Networks | 2010-11-24 | Paper |
The price of atomic selfish ring routing
Journal of Combinatorial Optimization | 2010-06-11 | Paper |
Equilibria in load balancing games
Acta Mathematicae Applicatae Sinica. English Series | 2010-01-11 | Paper |
On-line service scheduling
Journal of Scheduling | 2009-08-28 | Paper |
Approximation algorithms for soft-capacitated facility location in capacitated network design
Algorithmica | 2009-06-17 | Paper |
Logistics scheduling with batching and transportation
European Journal of Operational Research | 2008-04-24 | Paper |
Lot-sizing scheduling with batch setup times
Journal of Scheduling | 2007-05-15 | Paper |
Optimal Binomial Group Testing with a Test History
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
Optimisation models for re-routing air traffic flows in Europe
The Journal of the Operational Research Society | 2005-03-16 | Paper |
On-line scheduling a batch processing system to minimize total weighted job completion time
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2081006 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081032 (Why is no real title available?) | 2004-08-04 | Paper |
On-line scheduling of small open shops
Discrete Applied Mathematics | 2002-10-31 | Paper |
How good is a dense shop schedule?
Acta Mathematicae Applicatae Sinica. English Series | 2001-05-06 | Paper |
| scientific article; zbMATH DE number 1302193 (Why is no real title available?) | 2000-09-26 | Paper |
Approximation algorithms for two-machine flow shop scheduling with batch setup times
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
An improved heuristic for one-machine scheduling with delays constraints
Science in China. Series A | 1998-06-22 | Paper |
On-line scheduling of two-machine open shops where jobs arrive over time
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters | 1998-03-18 | Paper |
A New Heuristic for Three-Machine Flow Shop Scheduling
Operations Research | 1997-08-03 | Paper |
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
SIAM Journal on Computing | 1997-05-26 | Paper |
An optimal algorithm for preemptive on-line scheduling
Operations Research Letters | 1997-02-11 | Paper |
| scientific article; zbMATH DE number 895359 (Why is no real title available?) | 1996-07-01 | Paper |
| scientific article; zbMATH DE number 776077 (Why is no real title available?) | 1996-01-08 | Paper |
A lower bound for randomized on-line scheduling algorithms
Information Processing Letters | 1995-09-19 | Paper |
New lower and upper bounds for on-line scheduling
Operations Research Letters | 1995-07-06 | Paper |
Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
The Journal of the Operational Research Society | 1995-05-28 | Paper |
A note on LPT scheduling
Operations Research Letters | 1994-04-12 | Paper |
Approximation Algorithms for Three-Machine Open Shop Scheduling
ORSA Journal on Computing | 1994-03-24 | Paper |
A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
SIAM Journal on Computing | 1994-02-07 | Paper |
Worst-case analysis of heuristics for open shops with parallel machines
European Journal of Operational Research | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 123444 (Why is no real title available?) | 1993-02-18 | Paper |
| scientific article; zbMATH DE number 77993 (Why is no real title available?) | 1992-12-16 | Paper |
Parametric bounds for LPT scheduling on uniform processors
Acta Mathematicae Applicatae Sinica. English Series | 1992-06-26 | Paper |
Tighter bound for MULTIFIT scheduling on uniform processors
Discrete Applied Mathematics | 1992-06-25 | Paper |
