Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem

H.M. Soroush and F.A. Alqallaf

International Journal of Operational Research, 2009, vol. 6, issue 4, 538-572

Abstract: We study a static single machine scheduling problem in which processing times, due-dates, and penalties for not completing jobs on time are distinct arbitrary random variables. The objective is to identify an optimal sequence, which minimises the expected weighted sum of a quadratic function of job lateness. The problem is NP-hard to solve; however, based on a precedence relation structure among adjacent jobs, we develop an exact algorithm. Our computational results demonstrate that the algorithm solves large problem instances quickly. Furthermore, the proposed problem is general in the sense that its special cases reduce to some classical deterministic or new stochastic single machine models.

Keywords: single machine scheduling; stochastic; job lateness; weighted quadratic function; JIT; just-in-time; sequencing. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=27157 (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:ijores:v:6:y:2009:i:4:p:538-572

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().