New results for scheduling to minimize tardiness on one machine with rejection and related problems

Christos Koulamas () and George Steiner ()
Additional contact information
Christos Koulamas: College of Business Florida International University
George Steiner: McMaster University

Journal of Scheduling, 2021, vol. 24, issue 1, No 3, 27-34

Abstract: Abstract We study the total weighted tardiness problem with rejection on a single machine. We present new recursive algorithms and approximation results for the agreeably weighted case and a variety of related problems with and without deadlines.

Keywords: Production/scheduling: sequencing; Deterministic; Single machine (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-020-00671-6 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:24:y:2021:i:1:d:10.1007_s10951-020-00671-6

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

DOI: 10.1007/s10951-020-00671-6

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