Advanced Search
MyIDEAS: Login

Single-machine scheduling with inserted idle time to minimise a weighted quadratic function of job lateness

Contents:

Author Info

  • H.M. Soroush
Registered author(s):

    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]

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://inderscience.metapress.com/link.asp?target=contribution&id=F4041611R7417851
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Inderscience Enterprises Ltd in its journal European Journal of Industrial Engineering.

    Volume (Year): 4 (2010)
    Issue (Month): 2 (January)
    Pages: 131-166

    as in new window
    Handle: RePEc:ids:eujine:v:4:y:2010:i:2:p:131-166

    Contact details of provider:
    Web page: http://inderscience.metapress.com/link.asp?target=journal&id=120697

    Related research

    Keywords: single machine scheduling; quadratic lateness; idle times; precedence relations; branch-and-bound; optimal sequences;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:4:y:2010:i:2:p:131-166

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ian Winship) or (Christopher F. Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.