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

Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming

Author

Listed:
  • Samir Saadaoui
  • Mohamed Mahjoub Dhiaf
  • Hichem Kamoun
  • Basem Barqawi

Abstract

Most research papers in production scheduling are concerned with the optimisation of a single criterion. However, the study of the performance of schedules often involves more than a single aspect and therefore needs a multi-objective treatment. For example, in just in time philosophy, it is very common to consider two conflicting criteria namely earliness and tardiness. Both of these criteria are obtained from processing times which can be in certain cases fixed or obtained from an interval. This scheduling problem can be solved by a wide range of different approaches including both exact and heuristic methods. In this paper, we try to find the most appropriate method that can minimise the two criteria simultaneously for a practical case in the chemical industry. A zero one integer linear programme was developed and implemented through the software LINDO which allowed us to solve our practical problem and compare its solution to those of some priority rules. The goal of this paper is to develop different methods that can find a schedule which minimises the sum of earliness and tardiness penalties.

Suggested Citation

  • Samir Saadaoui & Mohamed Mahjoub Dhiaf & Hichem Kamoun & Basem Barqawi, 2014. "Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 20(4), pages 369-395.
    • Handle: RePEc:ids:ijores:v:20:y:2014:i:4:p:369-395
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=63151
    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:20:y:2014:i:4:p:369-395. 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.