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

A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

Author

Listed:
  • Ghasem Moslehi
  • Mehdi Mahnam
  • Majid Amin-Nayeri
  • Amir Azaron

Abstract

In this paper, we consider the problem of scheduling n jobs on a single machine to minimise the sum of maximum earliness and tardiness. Since this problem is trying to minimise the earliness and tardiness values, the model is consistent with the just-in-time production system. Most of publications on this subject have studied 'min-sum' objective functions, but in many settings balancing the costs of the jobs by minimising the cost of the worst scheduled job as 'min-max' criteria is more important. Using efficient lower and upper bounds and new dominance rules, a branch-and-bound scheme is proposed. The proposed algorithm is then tested on a set of randomly generated problems of different sizes, varying from 5 to 1,000 jobs. Using these approaches, we are able to solve all problems in a reasonable time. Computational results demonstrate the efficiency of our branch-and-bound algorithm over the existing methods reported in the literature.

Suggested Citation

  • Ghasem Moslehi & Mehdi Mahnam & Majid Amin-Nayeri & Amir Azaron, 2010. "A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 8(4), pages 458-482.
    • Handle: RePEc:ids:ijores:v:8:y:2010:i:4:p:458-482
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=34069
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.

    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:8:y:2010:i:4:p:458-482. 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.