IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v38y2000i1p85-99.html
   My bibliography  Save this article

Workshop scheduling using practical (inaccurate) data Part 3: A framework to integrate job releasing, routing and scheduling functions to create a robust predictive schedule

Author

Listed:
  • R. Shafaei
  • P. Brunn

Abstract

A comprehensive simulation study conducted by the authors investigated the robustness of a predictive scheduling system in a dynamic and stochastic environment. The results revealed that to improve the robustness of a scheduling system, besides using a robust scheduling method with a frequent rescheduling policy, the shop load should be well controlled and kept balanced. Integrating the planning and the scheduling functions has been shown to achieve this objective. This paper discusses the effects of the planning i.e. job releasing and routing and the scheduling functions in creating a robust schedule and a framework to integrate the above functions is proposed. This system consists of a planning module that is concerned with job releasing and routing decisions and a scheduling module that provides the detailed scheduling. A mathematical model using the integer programming technique is use to demonstrate a solution for the planning module. In addition, a heuristic algorithm is used to solve the scheduling problem. It is shown that, in terms of shop load balance level and job delivery time, the proposed system performs better than a benchmark loading strategy on the basis of minimum processing cost.

Suggested Citation

  • R. Shafaei & P. Brunn, 2000. "Workshop scheduling using practical (inaccurate) data Part 3: A framework to integrate job releasing, routing and scheduling functions to create a robust predictive schedule," International Journal of Production Research, Taylor & Francis Journals, vol. 38(1), pages 85-99, January.
  • Handle: RePEc:taf:tprsxx:v:38:y:2000:i:1:p:85-99
    DOI: 10.1080/002075400189590
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/002075400189590
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/002075400189590?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tprsxx:v:38:y:2000:i:1:p:85-99. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.