IDEAS home Printed from https://ideas.repec.org/a/ids/ijpsii/v3y2021i2p140-159.html
   My bibliography  Save this article

Single machine multi-criteria scheduling problem: total completion time, maximum lateness, and maximum earliness performance measures

Author

Listed:
  • Saheed Akande
  • Ganiyu O. Ajisegiri

Abstract

This paper considers the multi-criteria scheduling problem with total completion time, maximum lateness, and maximum earliness as the objectives. The problem is a minimisation problem; the total completion time, a MIN-SUM problem, the maximum earliness, a MIN-MAX problem, and the maximum lateness, a MIN-MAX problem. Though, the problem is NP-hard, shortest processing time (SPT) rule, yields optimal for total completion time while early due date rule (EDD) is the optimal solution for maximum lateness and maximum earliness if each criterion were to be considered separately. Two heuristics, named SOL I and SOL II were proposed and the results for each of the criteria were compared to the optimal of the sub-problems. Results of the computational experiment on small job-sizes (5 ≤ n ≤ 30) and large job-sizes (40 ≤ n ≤ 100) show that the two heuristics results are not significantly different from the optimal at 99% significant level for total completion time and maximum lateness performance measures. However, for maximum earliness, the optimal solutions are significantly better than the two proposed heuristics.

Suggested Citation

  • Saheed Akande & Ganiyu O. Ajisegiri, 2021. "Single machine multi-criteria scheduling problem: total completion time, maximum lateness, and maximum earliness performance measures," International Journal of Planning and Scheduling, Inderscience Enterprises Ltd, vol. 3(2), pages 140-159.
  • Handle: RePEc:ids:ijpsii:v:3:y:2021:i:2:p:140-159
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=115618
    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:ijpsii:v:3:y:2021:i:2:p:140-159. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=372 .

    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=372 .

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.