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

No-wait flowshops with bicriteria of makespan and maximum lateness

Author

Listed:
  • Allahverdi, Ali
  • Aldowaisan, Tariq

Abstract

No abstract is available for this item.

Suggested Citation

  • Allahverdi, Ali & Aldowaisan, Tariq, 2004. "No-wait flowshops with bicriteria of makespan and maximum lateness," European Journal of Operational Research, Elsevier, vol. 152(1), pages 132-147, January.
    • Handle: RePEc:eee:ejores:v:152:y:2004:i:1:p:132-147
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00646-X
    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. Gangadharan, Rajesh & Rajendran, Chandrasekharan, 1993. "Heuristic algorithms for scheduling in the no-wait flowshop," International Journal of Production Economics, Elsevier, vol. 32(3), pages 285-290, November.
    2. Kim, Yeong-Dae, 1995. "Minimizing total tardiness in permutation flowshops," European Journal of Operational Research, Elsevier, vol. 85(3), pages 541-555, September.
    3. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    4. Sivrikaya-Serifoglu, Funda & Ulusoy, Gunduz, 1998. "A bicriteria two-machine permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 414-430, June.
    5. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    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. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On no-wait and no-idle flow shops with makespan criterion," European Journal of Operational Research, Elsevier, vol. 178(3), pages 677-685, May.
    2. Abdennour Azerine & Mourad Boudhar & Djamal Rebaine, 2022. "A two-machine no-wait flow shop problem with two competing agents," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 168-199, January.
    3. Allahverdi, Ali & Aydilek, Harun & Aydilek, Asiye, 2018. "No-wait flowshop scheduling problem with two criteria; total tardiness and makespan," European Journal of Operational Research, Elsevier, vol. 269(2), pages 590-601.
    4. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    5. Qi-Xia Yang & Long-Cheng Liu & Min Huang & Tian-Run Wang, 2024. "Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-17, August.
    6. Gais Alhadi & Imed Kacem & Pierre Laroche & Izzeldin M. Osman, 2020. "Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines," Annals of Operations Research, Springer, vol. 285(1), pages 369-395, February.
    7. Wang, Chuyang & Li, Xiaoping & Wang, Qian, 2010. "Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion," European Journal of Operational Research, Elsevier, vol. 206(1), pages 64-72, October.

    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. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    2. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    3. B-J Joo & Y-D Kim, 2009. "A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 572-582, April.
    4. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    5. Vahid Riahi & Morteza Kazemi, 2018. "A new hybrid ant colony algorithm for scheduling of no-wait flowshop," Operational Research, Springer, vol. 18(1), pages 55-74, April.
    6. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    7. Joaquín Bautista-Valhondo & Rocío Alfaro-Pozo, 2020. "Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 5-23, March.
    8. Matthias Bultmann & Sigrid Knust & Stefan Waldherr, 2018. "Flow shop scheduling with flexible processing times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 809-829, July.
    9. Framinan, Jose M. & Leisten, Rainer & Ruiz-Usano, Rafael, 2002. "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, Elsevier, vol. 141(3), pages 559-569, September.
    10. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    11. O Holthaus & C Rajendran, 2005. "A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 947-953, August.
    12. Wang, Chuyang & Li, Xiaoping & Wang, Qian, 2010. "Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion," European Journal of Operational Research, Elsevier, vol. 206(1), pages 64-72, October.
    13. Lemesre, J. & Dhaenens, C. & Talbi, E.G., 2007. "An exact parallel method for a bi-objective permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1641-1655, March.
    14. Chia-Shin Chung & James Flynn & Walter Rom & Piotr Staliński, 2012. "A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems," Journal of Entrepreneurship, Management and Innovation, Fundacja Upowszechniająca Wiedzę i Naukę "Cognitione", vol. 8(2), pages 26-43.
    15. Mario Levorato & David Sotelo & Rosa Figueiredo & Yuri Frota, 2024. "Efficient solutions to the m-machine robust flow shop under budgeted uncertainty," Annals of Operations Research, Springer, vol. 338(1), pages 765-799, July.
    16. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    17. Zhang, Yi & Li, Xiaoping & Wang, Qian, 2009. "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," European Journal of Operational Research, Elsevier, vol. 196(3), pages 869-876, August.
    18. Marcelo Seido Nagano & Adriano Seiko Komesu & Hugo Hissashi Miyata, 2019. "An evolutionary clustering search for the total tardiness blocking flow shop problem," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1843-1857, April.
    19. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    20. Allahverdi, Ali, 2003. "The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime," European Journal of Operational Research, Elsevier, vol. 147(2), pages 373-396, June.

    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:152:y:2004:i:1:p:132-147. 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.