Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning

R Rudek
Additional contact information
R Rudek: Wrocław University of Economics, Wrocław, Poland

Journal of the Operational Research Society, 2014, vol. 65, issue 8, 1170-1176

Abstract: In this paper, we analyse the single processor maximum completion time (makespan) minimization problem with distinct release dates of jobs and the sum-of-processing time-based learning effect. We prove that the considered problem is strongly NP-hard, if, in addition to jobs with the same learning ratio, there are jobs with constant job processing times. Such jobs are not affected by learning and model, for instance, required system upgrades or training courses.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v65/n8/pdf/jors201319a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v65/n8/full/jors201319a.html Link to full text HTML (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:65:y:2014:i:8:p:1170-1176

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

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