arbiter
JournalsPricingAccount

Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions

Johnson Phosavanh & Daniel Oron

Journal of Scheduling2025https://doi.org/10.1007/s10951-025-00853-0article
AJG 1ABDC B
Weight
0.37

What the paper says

Abstract We analyze two-agent scheduling problems with weighted due-date-related scheduling criteria and an optional rate-modifying activity that, when completed, allows jobs to be completed faster. We start with the single-agent problem of minimizing the total weighted late work and then extend the results over to two-agent problems involving combinations of the weighted number of late jobs and the total weighted late work. We examine the properties of optimal schedules and provide efficient pseudo-polynomial time algorithms to solve these problems.

1 citation

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1007/s10951-025-00853-0

Or copy a formatted citation

@article{johnson2025,
  title        = {{Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions}},
  author       = {Johnson Phosavanh & Daniel Oron},
  journal      = {Journal of Scheduling},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1007/s10951-025-00853-0},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Single-machine two-agent scheduling with a rate-modifying activity and weighted due-date-related functions

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.37

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.16 × 0.4 = 0.06
M · momentum0.53 × 0.15 = 0.08
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.