 Single-machine scheduling with inserted idle time to minimise a weighted quadratic function of job latenessH.M. Soroush European Journal of Industrial Engineering, 2010, vol. 4, issue 2, 131-166 Abstract: This study is concerned with the problem of finding an optimal sequence that minimises the weighted sum of a quadratic function of job lateness on a single machine where an idle time is allowed to be inserted only before the processing of the first job begins. We first prove that the solution method of Sen et al. (1995) for the problem does not work because their ordering rule for adjacent jobs is not applicable to nonadjacent jobs. We then develop an exact algorithm for this Non-deterministic Polynomial-time hard (NP-hard) problem based on a precedence relation structure among adjacent jobs. The algorithm considers the lateness cost of an incumbent sequence as the initial upper bound, and incorporates some improved lower bounds and a number of effective branching rules into a Branch-and-Bound (B&B) algorithm to discard dominated branches. Our computational results demonstrate that the algorithm can solve large problem instances quickly. [Submitted 06 December 2008; Revised 02 February 2009; Accepted 07 February 2009] Keywords: single machine scheduling; quadratic lateness; idle times; precedence relations; branch-and-bound; optimal sequences. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:4:y:2010:i:2:p:131-166 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.