Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties

Domaniç, Nevzat Onur; Plaxton, C. Greg

doi:10.1007/978-3-319-13075-0_51

Cited by 3 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The survey of Shabtay et al [20] also presents both the theoretical and practical significance of enabling job-rejection in scheduling problems and describes an abundance of problems studied in this area in the past few years. Studies published later include e.g., Domaniç and Plaxton [3] consider scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties. Shabtay [19], studies the single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost.…”

Section: Introductionmentioning

confidence: 99%

Scheduling with regular performance measures and optional job rejection on a single machine

Mor

Shapira

2019

Journal of the Operational Research Society

View full text Add to dashboard Cite

We address single machine problems with optional job-rejection, studied recently in Zhang et al. [21] and Cao et al. [2]. In these papers, the authors focus on minimizing regular performance measures, i.e., functions that are non-decreasing in the jobs completion time, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. They also prove that the considered problems are ordinary NP-hard and provide pseudo-polynomial-time Dynamic Programming (DP) solutions. In this paper, we focus on three of these problems: makespan with release-dates; total completion times; and total weighted completion, and present enhanced DP solutions demonstrating both theoretical and practical improvements. Moreover, we provide extensive numerical studies verifying their efficiency.

show abstract

Section: Introductionmentioning

confidence: 99%