IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6591632.html
   My bibliography  Save this article

Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

Author

Listed:
  • Mohammed Al-Salem
  • Leonardo Bedoya-Valencia
  • Ghaith Rabadi

Abstract

The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.

Suggested Citation

  • Mohammed Al-Salem & Leonardo Bedoya-Valencia & Ghaith Rabadi, 2016. "Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-11, November.
    • Handle: RePEc:hin:jnlmpe:6591632
    DOI: 10.1155/2016/6591632
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/6591632.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2016/6591632.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/6591632?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Ahmadian, Mohammad Mahdi & Salehipour, Amir & Cheng, T.C.E., 2021. "A meta-heuristic to solve the just-in-time job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 288(1), pages 14-29.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6591632. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.