Competitive two-agent scheduling with release dates and preemption on a single machine

Shi-Sheng Li () and Ren-Xia Chen
Additional contact information
Shi-Sheng Li: Department of Information and Computation Science, Zhongyuan University of Technology
Ren-Xia Chen: College of Science, Zhongyuan University of Technology

Journal of Scheduling, 2023, vol. 26, issue 3, No 1, 227-249

Abstract: Abstract We study several competitive two-agent scheduling problems with release dates and preemption on a single machine, where the scheduling criterion of the first agent is regular and of the sum-form and the scheduling criterion of the second criterion is regular and of the max-form or the weighted number of tardy jobs. Two variants of the problems are investigated. One is the restricted version, in which the goal is to find a feasible schedule so that the objective value of the first agent is minimized subject to the restriction that the objective value of the second agent does not exceed a given threshold value. The other one is the Pareto version, in which the goal is to find all the Pareto-optimal points and their corresponding Pareto-optimal schedules. We design polynomial-time and pseudo-polynomial-time algorithms for each of the considered problems.

Keywords: Scheduling; Single-machine; Two-agent; Release date; Preemption (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-023-00779-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:26:y:2023:i:3:d:10.1007_s10951-023-00779-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-023-00779-5

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().