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

Chain-reentrant shop with an exact time lag: new results

Author

Listed:
  • Karim Amrouche
  • Mourad Boudhar
  • Mohamed Bendraouche
  • Farouk Yalaoui

Abstract

The two-machine chain-reentrant shop scheduling with the objective of minimizing the makespan, assumes that the tasks pass from the first machine to the second and return back to the first machine. In this paper, we consider the same problem in which an exact time lag between the two operations on the first machine is imposed. In Amrouche and Boudhar (2016) the authors proved that this problem is NP-hard in the strong sense in the case of identical time lags lj=L$ l_j=L $. We propose heuristic algorithms with empirical results for the latter. In addition, we establish a new NP-hardness result and some polynomial cases.

Suggested Citation

  • Karim Amrouche & Mourad Boudhar & Mohamed Bendraouche & Farouk Yalaoui, 2017. "Chain-reentrant shop with an exact time lag: new results," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 285-295, January.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:1:p:285-295
    DOI: 10.1080/00207543.2016.1205235
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1205235
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1205235?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.

    References listed on IDEAS

    as
    1. Lev, V. & Adiri, I., 1984. "V-shop scheduling," European Journal of Operational Research, Elsevier, vol. 18(1), pages 51-56, October.
    2. M. Y. Wang & S. P. Sethi & S. L. van de Velde, 1997. "Minimizing Makespan in a Class of Reentrant Shops," Operations Research, INFORMS, vol. 45(5), pages 702-712, October.
    3. Dino Ahr & József Békési & Gábor Galambos & Marcus Oswald & Gerhard Reinelt, 2004. "An exact algorithm for scheduling identical coupled tasks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(2), pages 193-203, June.
    4. L. G. Mitten, 1959. "Sequencing n Jobs on Two Machines with Arbitrary Time Lags," Management Science, INFORMS, vol. 5(3), pages 293-298, April.
    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. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    2. Nazim Sami & Karim Amrouche & Mourad Boudhar, 2024. "New efficient algorithms for the two-machine no-wait chain-reentrant shop problem," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.

    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. Nazim Sami & Karim Amrouche & Mourad Boudhar, 2024. "New efficient algorithms for the two-machine no-wait chain-reentrant shop problem," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-29, July.
    2. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    3. Yang, Dar-Li & Kuo, Wen-Hung & Chern, Maw-Sheng, 2008. "Multi-family scheduling in a two-machine reentrant flow shop with setups," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1160-1170, June.
    4. Mostafa Khatami & Amir Salehipour, 2021. "Coupled task scheduling with time-dependent processing times," Journal of Scheduling, Springer, vol. 24(2), pages 223-236, April.
    5. József Békési & Gábor Galambos & Michael Jung & Marcus Oswald & Gerhard Reinelt, 2014. "A branch-and-bound algorithm for the coupled task problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(1), pages 47-81, August.
    6. Baptiste, Pierre, 2006. "Stochastic algorithms: Using the worst to reach the best," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 41-51, February.
    7. S. M. Mousavi & I. Mahdavi & J. Rezaeian & M. Zandieh, 2018. "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times," Operational Research, Springer, vol. 18(1), pages 123-158, April.
    8. Kim, J-S. & Kang, S-H. & Lee, S. M., 1997. "Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage," Omega, Elsevier, vol. 25(5), pages 547-555, October.
    9. Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
    10. Bart, H. & Kroon, L. G., 1996. "Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions," European Journal of Operational Research, Elsevier, vol. 91(1), pages 144-159, May.
    11. JC-H Pan & J-S Chen, 2003. "Minimizing makespan in re-entrant permutation flow-shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 642-653, June.
    12. Fondrevelle, J. & Oulamara, A. & Portmann, M.-C., 2008. "Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times," International Journal of Production Economics, Elsevier, vol. 112(1), pages 168-176, March.
    13. Riezebos, J. & Gaalman, G. J. C., 1998. "Time lag size in multiple operations flow shop scheduling heuristics," European Journal of Operational Research, Elsevier, vol. 105(1), pages 72-90, February.
    14. A Allahverdi & F S Al-Anzi, 2006. "Scheduling multi-stage parallel-processor services to minimize average response time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 101-110, January.
    15. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    16. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    17. Aldowaisan, Tariq & Allahverdi, Ali, 2004. "New heuristics for m-machine no-wait flowshop to minimize total completion time," Omega, Elsevier, vol. 32(5), pages 345-352, October.
    18. Bo Chen & Xiandong Zhang, 2021. "Scheduling coupled tasks with exact delays for minimum total job completion time," Journal of Scheduling, Springer, vol. 24(2), pages 209-221, April.
    19. Nadjat Meziani & Ammar Oulamara & Mourad Boudhar, 2019. "Two-machine flowshop scheduling problem with coupled-operations," Annals of Operations Research, Springer, vol. 275(2), pages 511-530, April.
    20. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.

    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:55:y:2017:i:1:p:285-295. 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: 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.