Abstract
We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. The scheduling measure considered in this paper is minimum total (earliness, tardiness and due-date) cost, based on common flow allowance, i.e., due-dates are defined as linear functions of the job processing times. We introduce a simple polynomial time solution for this problem (linear in the number of jobs), as well as to its extension to a multi-agent setting. We further extend the model to that of a due-window assignment based on common flow allowance.
| Original language | American English |
|---|---|
| Pages (from-to) | 1454-1468 |
| Number of pages | 15 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 33 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 May 2017 |
Bibliographical note
Funding Information:This research was supported by the Israel Science Foundation (Grant No. 1286/14). The second author was supported in part by The Charles Rosen Chair of Management and the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.
Publisher Copyright:
© 2016, Springer Science+Business Media New York.
Keywords
- Common flow-allowance
- Minmax
- Scheduling
- Single machine
- Two agents