Search
Now showing items 1-3 of 3
A cutting plane approach for the multi-machine precedence-constrained scheduling problem
(Springer, 2020)
A cutting-plane approach is developed for the problem of optimally scheduling jobs with arbitrary precedence constraints on unrelated parallel machines to minimize weighted completion time. While the single machine version ...
A framework for fair decision-making over time with time-invariant utilities
(Elsevier, 2023-12-02)
Fairness is a major concern in contemporary decision problems. In these situations, the objective is to maximize fairness while preserving the efficacy of the underlying decision-making problem. This paper examines repeated ...
When Nash meets Stackelberg
(INFORMS, 2023-12-22)
This article introduces a class of Nash games among Stackelberg players (NASPs), namely, a class of simultaneous noncooperative games where the players solve sequential Stackelberg games. Specifically, each player solves ...