IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v30y1996i4p303-314.html
   My bibliography  Save this article

Routing Two-Machine Flowshop Problems on Networks with Special Structure

Author

Listed:
  • Igor Averbakh

    (Department of Mathematics, Western Washington University, Bellingham, Washington 98225)

  • Oded Berman

    (Faculty of Management, University of Toronto, Toronto, Ontario M5S 1V4, Canada)

Abstract

We consider a version of the routing two-machine flowshop problem, where n jobs located at different nodes of a transportation network must be executed by two machines traveling between the jobs. Each job must be processed by both machines in the order, machine 1 first, machine 2 second. The goal is to minimize the makespan given that the total distance traveled must be as small as possible. Properties of the problem are discussed, and algorithms with complexity O ( n log n ) are developed for the problem on trees and cactuses.

Suggested Citation

  • Igor Averbakh & Oded Berman, 1996. "Routing Two-Machine Flowshop Problems on Networks with Special Structure," Transportation Science, INFORMS, vol. 30(4), pages 303-314, November.
    • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:4:p:303-314
    DOI: 10.1287/trsc.30.4.303
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.30.4.303
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.30.4.303?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. Ilya Chernykh & Alexander Kononov & Sergey Sevastyanov, 2024. "An exact solution with an improved running time for the routing flow shop problem with two machines," Journal of Scheduling, Springer, vol. 27(4), pages 329-340, August.
    2. Averbakh, Igor & Berman, Oded & Chernykh, Ilya, 2005. "A -approximation algorithm for the two-machine routing open-shop problem on a two-node network," European Journal of Operational Research, Elsevier, vol. 166(1), pages 3-24, October.
    3. Yu, Wei & Liu, Zhaohui & Wang, Leiyang & Fan, Tijun, 2011. "Routing open shop and flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 213(1), pages 24-36, August.
    4. Averbakh, Igor & Berman, Oded & Chernykh, Ilya, 2006. "The routing open-shop problem on a network: Complexity and approximation," European Journal of Operational Research, Elsevier, vol. 173(2), pages 531-539, September.
    5. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.

    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:inm:ortrsc:v:30:y:1996:i:4:p:303-314. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.