Scheduling two projects with controllable processing times in a single-machine environment

Byung-Cheon Choi () and Myoung-Ju Park ()
Additional contact information
Byung-Cheon Choi: Chungnam National University
Myoung-Ju Park: Kyung Hee University

Journal of Scheduling, 2020, vol. 23, issue 5, No 7, 619-628

Abstract: Abstract We consider two single-machine scheduling problems in which two competing projects share one common resource. Each project has multiple interim assessments, and its own jobs are ordered completely. A tardy job incurs a tardiness penalty cost which can be avoided by compressing some jobs, which requires an additional cost. The performance measure of each project is the total tardiness penalty cost plus the total compression cost. The first problem minimizes the weighted sum of the performance measures of two projects, and the second problem minimizes the performance measure of one project with a constraint on that of the other. We show that the first problem is solvable in strongly polynomial time and the second is weakly NP-hard. Furthermore, we analyze how the computational complexity of each problem changes if the number of projects is more than two.

Keywords: Scheduling; Two-agent sequencing; Computational complexity (search for similar items in EconPapers)
Date: 2020
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-020-00658-3 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:23:y:2020:i:5:d:10.1007_s10951-020-00658-3

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

DOI: 10.1007/s10951-020-00658-3

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 ().