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

Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs

Author

Listed:
  • Ghasem Moslehi
  • Majid Rohani

Abstract

Just-in-time JIT (Just In Time) is an important procedure in scheduling problems which aims at minimizing minimising both earliness and tardiness at the same time. In this case, the problem is a multi-objective scheduling problem. A candidate solution method for this type of problem is finding the Pareto-optima. The present research investigates the single-machine scheduling problem in which the three objects: number of tardy job, maximum earliness, and maximum tardiness must be minimized minimised (1||ΣUj,Emax,Tmax). The branch and bound approach is proposed to find the Pareto- optima. A number of new dominance properties, upper bound, and lower bound rules are developed that help the branch and bound procedure to perform more efficiently. We generate 700 random problems to test our approach. Computational results are reported, for instances, of up to 30 jobs in size.

Suggested Citation

  • Ghasem Moslehi & Majid Rohani, 2012. "Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(4), pages 433-452.
    • Handle: RePEc:ids:ijores:v:14:y:2012:i:4:p:433-452
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=47514
    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:14:y:2012:i:4:p:433-452. 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.