Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects

Radosław Rudek

European Journal of Industrial Engineering, 2013, vol. 7, issue 2, 206-223

Abstract: In this paper, we analyse the single machine maximum lateness minimisation scheduling problem with the aging effect, where the job processing times are described by non-decreasing functions dependent on the sum of the normal processing times of already processed jobs. We prove that the considered problem is at least NP-hard even if job processing times are described by linear functions. Moreover, we construct the branch and bound method and implement well known approximation algorithms for the general version of the problem and verify numerically their efficiency. [Received 18 February 2011; Revised 26 May 2011, 3 September 2011; Accepted 12 September 2011]

Keywords: single machine scheduling; deterioration; aging effects; computational complexity; branch and bound; B%B; metaheuristics; maximum lateness. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.inderscience.com/link.php?id=52575 (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:ids:eujine:v:7:y:2013:i:2:p:206-223

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().