IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v173y2006i2p531-539.html
   My bibliography  Save this article

The routing open-shop problem on a network: Complexity and approximation

Author

Listed:
  • Averbakh, Igor
  • Berman, Oded
  • Chernykh, Ilya

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:173:y:2006:i:2:p:531-539
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00182-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Yoshiyuki Karuno & Hiroshi Nagamochi & Toshihide Ibaraki, 1997. "Vehicle scheduling on a tree with release and handling times," Annals of Operations Research, Springer, vol. 69(0), pages 193-207, January.
    2. Matteo Fischetti & Gilbert Laporte & Silvano Martello, 1993. "The Delivery Man Problem and Cumulative Matroids," Operations Research, INFORMS, vol. 41(6), pages 1055-1064, December.
    3. Igor Averbakh & Oded Berman, 1999. "A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems," Operations Research, INFORMS, vol. 47(1), pages 165-170, February.
    4. 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.
    5. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    2. 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.
    3. Antonina P. Khramova & Ilya Chernykh, 2021. "A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing," Journal of Scheduling, Springer, vol. 24(4), pages 405-412, August.
    4. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. Antonina P. Khramova & Ilya Chernykh, 2021. "A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing," Journal of Scheduling, Springer, vol. 24(4), pages 405-412, August.
    4. 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.
    5. Yuanxiao Wu & Xiwen Lu, 0. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    6. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    7. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    8. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    9. Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
    10. Ribeiro, Glaydston Mattos & Laporte, Gilbert & Mauri, Geraldo Regis, 2012. "A comparison of three metaheuristics for the workover rig routing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 28-36.
    11. Sofie Coene & Frits C. R. Spieksma & Gerhard J. Woeginger, 2011. "Charlemagne's Challenge: The Periodic Latency Problem," Operations Research, INFORMS, vol. 59(3), pages 674-683, June.
    12. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    13. F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    14. Averbakh, Igor & Pereira, Jordi, 2015. "Network construction problems with due dates," European Journal of Operational Research, Elsevier, vol. 244(3), pages 715-729.
    15. Mauro Dell'Amico & Francesco Maffioli, 2000. "Combining Linear and Non-Linear Objectives in Spanning Tree Problems," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 253-269, June.
    16. Ricardo Fukasawa & Qie He & Yongjia Song, 2016. "A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(1), pages 23-34, February.
    17. Zhang, Zizhen & Qin, Hu & Zhu, Wenbin & Lim, Andrew, 2012. "The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach," European Journal of Operational Research, Elsevier, vol. 220(2), pages 295-304.
    18. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    19. Sepehr Nemati & Oleg V. Shylo & Oleg A. Prokopyev & Andrew J. Schaefer, 2016. "The Surgical Patient Routing Problem: A Central Planner Approach," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 657-673, November.
    20. Ha-Bang Ban, 2021. "A metaheuristic for the delivery man problem with time windows," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 794-816, May.

    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:eee:ejores:v:173:y:2006:i:2:p:531-539. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.