Single-machine primary–secondary scheduling with total tardiness being the primary criterion

Qiulan Zhao and Jinjiang Yuan ()
Additional contact information
Qiulan Zhao: Nanjing University
Jinjiang Yuan: Zhengzhou University

Journal of Scheduling, 2024, vol. 27, issue 3, No 7, 309-318

Abstract: Abstract We study the single-machine primary–secondary scheduling problems in which the total tardiness is the primary criterion and the secondary criteria are the maximum lateness, the (weighted) number of tardy jobs, and the total weighted tardiness, respectively. These problems are known to be NP-hard, but their exact complexities (strongly NP-hard or pseudo-polynomially solvable) were posed by (in: Pardalos (ed) Complexity in numerical optimization, World Scientific, 1993) as open problems. In this paper, we show that these problems are solvable in pseudo-polynomial time.

Keywords: Scheduling; Single machine; Primary–secondary; Total tardiness; Pseudo-polynomial time (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-023-00793-7 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:27:y:2024:i:3:d:10.1007_s10951-023-00793-7

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

DOI: 10.1007/s10951-023-00793-7

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