IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v13y2012i1p110-127.html
   My bibliography  Save this article

Minimising variance of job completion times in a single machine

Author

Listed:
  • G. Srinivasan
  • B. Srirangacharyulu

Abstract

In this paper, we consider a deterministic n-job, single-machine sequencing problem with the objective of minimising the variance of job completion times. Completion time variance (CTV) is relevant in situations where uniformity in service is needed. CTV is a non-regular performance measure that can decrease when one or more completion times increases. It penalises jobs that are completed early as well as late. Minimising CTV in a single machine is a ‘hard’ problem. The objective of this paper is to provide an exact algorithm to solve the single-machine CTV minimisation problem based on implicit enumeration. We develop a lower bound for a given partial sequence and present a branch and bound algorithm to solve the problem. Computational results show that optimal solutions for problems up to 80 jobs can be obtained with less computational time when compared to an existing pseudo-polynomial algorithm.

Suggested Citation

  • G. Srinivasan & B. Srirangacharyulu, 2012. "Minimising variance of job completion times in a single machine," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 13(1), pages 110-127.
    • Handle: RePEc:ids:ijores:v:13:y:2012:i:1:p:110-127
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=44030
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:13:y:2012:i:1:p:110-127. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.