| Publication | Date of Publication | Type |
|---|
Optimally rescheduling jobs with a last-in-first-out buffer
Journal of Scheduling | 2022-01-14 | Paper |
On the Stackelberg knapsack game
European Journal of Operational Research | 2021-06-04 | Paper |
A Stackelberg knapsack game with weight control
Theoretical Computer Science | 2019-11-13 | Paper |
Robust single machine scheduling with a flexible maintenance activity
Computers & Operations Research | 2019-04-18 | Paper |
Price of fairness in two-agent single-machine scheduling problems
European Journal of Operational Research | 2019-02-25 | Paper |
Cheapest paths in dynamic networks
Networks | 2018-06-13 | Paper |
Price of fairness for allocating a bounded resource
European Journal of Operational Research | 2018-05-24 | Paper |
Competitive multi-agent scheduling with an iterative selection rule
4OR | 2018-04-13 | Paper |
An exact algorithm for a multicommodity min-cost flow over time problem
| 2018-04-11 | Paper |
Maximin fairness in project budget allocation
| 2017-02-14 | Paper |
Minimum cost paths over dynamic networks
| 2016-10-18 | Paper |
The Subset Sum game
European Journal of Operational Research | 2016-06-24 | Paper |
On-line scheduling with setup costs
Information Processing Letters | 2016-06-16 | Paper |
Scheduling two agent task chains with a central selection mechanism
Journal of Scheduling | 2015-07-28 | Paper |
Two agent scheduling with a central selection mechanism
Theoretical Computer Science | 2015-07-24 | Paper |
On the bicriteria \(k\)-server problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Two agents competing for a shared machine
Algorithmic Decision Theory | 2013-12-17 | Paper |
Strategies in competing subset selection
Annals of Operations Research | 2013-09-16 | Paper |
Parallel dedicated machines scheduling with chain precedence constraints
European Journal of Operational Research | 2012-12-29 | Paper |
Single-machine scheduling problems with generalized preemption
INFORMS Journal on Computing | 2012-07-28 | Paper |
Competitive subset selection with two agents
Discrete Applied Mathematics | 2011-10-27 | Paper |
A job-shop problem with one additional resource type
Journal of Scheduling | 2011-10-18 | Paper |
Optimal power control in OFDMA cellular networks
Networks | 2011-06-22 | Paper |
Stable routing under the Spanning Tree Protocol
Operations Research Letters | 2010-12-20 | Paper |
Scheduling three chains on two parallel machines
European Journal of Operational Research | 2009-11-27 | Paper |
Subset Weight Maximization with Two Competing Agents
Algorithmic Decision Theory | 2009-11-17 | Paper |
On-line load balancing made simple: greedy strikes back
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Minimum cost multi-product flow lines
Annals of Operations Research | 2008-03-31 | Paper |
Exact algorithms for a discrete metric labeling problem
Discrete Optimization | 2008-01-11 | Paper |
Part batching and scheduling in a flexible cell to minimize setup costs
Journal of Scheduling | 2007-12-20 | Paper |
Exact algorithms for a discrete metric labeling problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Competitive algorithms for the bicriteria \(k\)-server problem
Discrete Applied Mathematics | 2006-10-30 | Paper |
scientific article; zbMATH DE number 2038778 (Why is no real title available?)
| 2004-02-08 | Paper |
An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
Theoretical Computer Science | 2003-08-17 | Paper |
Optimally balancing assembly lines with different workstations
Discrete Applied Mathematics | 2002-05-15 | Paper |
scientific article; zbMATH DE number 1670658 (Why is no real title available?)
| 2001-11-11 | Paper |
