IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v99y2006i1-2p16-27.html
   My bibliography  Save this article

Scheduling of a two-machine flowshop with availability constraints on the first machine

Author

Listed:
  • Allaoui, H.
  • Artiba, A.
  • Elmaghraby, S.E.
  • Riane, F.

Abstract

No abstract is available for this item.

Suggested Citation

  • Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
    • Handle: RePEc:eee:proeco:v:99:y:2006:i:1-2:p:16-27
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(04)00448-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. Lee, Chung-Yee, 1999. "Two-machine flowshop scheduling with availability constraints," European Journal of Operational Research, Elsevier, vol. 114(2), pages 420-429, April.
    2. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    3. Blazewicz, Jacek & Breit, Joachim & Formanowicz, Piotr & Kubiak, Wieslaw & Schmidt, Günter, 2001. "Heuristic algorithms for the two-machine flowshop with limited machine availability," Omega, Elsevier, vol. 29(6), pages 599-608, December.
    4. Chung-Yee Lee & Lei Lei & Michael Pinedo, 1997. "Current trends in deterministic scheduling," Annals of Operations Research, Springer, vol. 70(0), pages 1-41, 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. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    2. Kacem, Imed & Chu, Chengbin, 2008. "Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint," International Journal of Production Economics, Elsevier, vol. 112(1), pages 138-150, March.
    3. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    4. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    5. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    6. Sun, Kaibiao & Li, Hongxing, 2010. "Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 124(1), pages 151-158, March.
    7. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    8. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    9. Kacem, Imed & Chu, Chengbin, 2008. "Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1080-1089, June.

    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. Allaoui, H. & Lamouri, S. & Artiba, A. & Aghezzaf, E., 2008. "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 161-167, March.
    2. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    3. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
    4. C.T. Ng & Mikhail Y. Kovalyov, 2004. "An FPTAS for scheduling a two‐machine flowshop with one unavailability interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 307-315, April.
    5. Aggoune, Riad & Portmann, Marie-Claude, 2006. "Flow shop scheduling problem with limited machine availability: A heuristic approach," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 4-15, February.
    6. Aggoune, Riad, 2004. "Minimizing the makespan for the flow shop scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 153(3), pages 534-543, March.
    7. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    8. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
    9. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    10. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    11. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    12. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    13. Huo, Yumei & Zhao, Hairong, 2018. "Two machine scheduling subject to arbitrary machine availability constraint," Omega, Elsevier, vol. 76(C), pages 128-136.
    14. Xiuli Wang & T. C. Edwin Cheng, 2007. "Machine scheduling with an availability constraint and job delivery coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 11-20, February.
    15. Liu, Peihai & Lu, Xiwen, 2016. "Integrated production and job delivery scheduling with an availability constraint," International Journal of Production Economics, Elsevier, vol. 176(C), pages 1-6.
    16. Ali Salmasnia & Danial Mirabadi-Dastjerd, 2017. "Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 544-578, October.
    17. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    18. J S Chen, 2006. "Single-machine scheduling with flexible and periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 703-710, June.
    19. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    20. Navid Hashemian & Claver Diallo & Béla Vizvári, 2014. "Makespan minimization for parallel machines scheduling with multiple availability constraints," Annals of Operations Research, Springer, vol. 213(1), pages 173-186, February.

    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:proeco:v:99:y:2006:i:1-2:p:16-27. 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/ijpe .

    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.