Two-agent scheduling problems under rejection budget constraints

Daniel Oron

Omega, 2021, vol. 102, issue C

Abstract: We study two single machine scheduling problems with two competing agents and the option of rejecting jobs. We seek to minimize the scheduling criterion of one agent under the condition that the maximum completion time of the second agent does not exceed a given upper-bound. Moreover, we assume that jobs are either scheduled or rejected (incurring job-dependent penalties) subject to an upper bound on the total rejection cost. The scheduling objective for the first agent is either the makespan or the total completion time, while that of the second agent is the makespan. As both problems are known to be NP-hard, we develop efficient pseudo-polynomial dynamic programming algorithms to obtain optimal solutions. The algorithms are shown to efficiently solve medium to large size problems through an extensive numerical study.

Keywords: Single machine; Two-agents; Rejection; Dynamic programming (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048320306678
Full text for ScienceDirect subscribers only

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:eee:jomega:v:102:y:2021:i:c:s0305048320306678

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2020.102313

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().