Complexity results for single-machine scheduling with positional learning effects

B M T Lin ()
Additional contact information
B M T Lin: National Chiao Tung University

Journal of the Operational Research Society, 2007, vol. 58, issue 8, 1099-1102

Abstract: Abstract This note presents complexity results for a single-machine scheduling problem of minimizing the number of late jobs. In the studied problem, the processing times of the jobs are defined by positional learning effects. A recent paper proposed a polynomial time algorithm for the case with a common due date and conjectured the general problem to be 𝒩𝒫-hard. We confirm that the general problem is strongly 𝒩𝒫-hard and show that the studied problem remains 𝒩𝒫-hard even if there are only two different due-date values.

Keywords: single-machine scheduling; learning effect; late job; 𝒩𝒫-hardness (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602227 Abstract (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:58:y:2007:i:8:d:10.1057_palgrave.jors.2602227

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602227

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().