IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v6y2012i4p497-518.html
   My bibliography  Save this article

Online scheduling of flexible job-shops with blocking and transportation

Author

Listed:
  • Jens Poppenborg
  • Sigrid Knust
  • Joachim Hertzberg

Abstract

This paper deals with online scheduling of a flexible job-shop with blocking where jobs are transported between the machines by one or several automated guided vehicles. The objective is to minimise the total weighted tardiness of the jobs. Schedules have to be generated online (i.e., jobs only become known to the scheduler at their respective release dates) as well as in real time (i.e., only a limited amount of computation time is allowed). We propose a MIP formulation for the offline situation and an online Tabu search algorithm that decomposes the problem into an assignment and a scheduling subproblem. In some computational experiments online and offline algorithms are compared for various problem instances. [Received 17 May 2010; Revised 24 November 2010; Accepted 24 February 2011]

Suggested Citation

  • Jens Poppenborg & Sigrid Knust & Joachim Hertzberg, 2012. "Online scheduling of flexible job-shops with blocking and transportation," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(4), pages 497-518.
    • Handle: RePEc:ids:eujine:v:6:y:2012:i:4:p:497-518
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=47662
    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.

    Citations

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


    Cited by:

    1. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    2. Mogali, Jayanth Krishna & Barbulescu, Laura & Smith, Stephen F., 2021. "Efficient primal heuristic updates for the blocking job shop problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 82-101.

    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:eujine:v:6:y:2012:i:4:p:497-518. 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=210 .

    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.