IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v70y2001i2p101-115.html
   My bibliography  Save this article

Minimizing makespan in a blocking flowshop using genetic algorithms

Author

Listed:
  • Caraffa, Vince
  • Ianes, Stefano
  • P. Bagchi, Tapan
  • Sriskandarajah, Chelliah

Abstract

No abstract is available for this item.

Suggested Citation

  • Caraffa, Vince & Ianes, Stefano & P. Bagchi, Tapan & Sriskandarajah, Chelliah, 2001. "Minimizing makespan in a blocking flowshop using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 70(2), pages 101-115, March.
  • Handle: RePEc:eee:proeco:v:70:y:2001:i:2:p:101-115
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(99)00104-8
    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. Chen, Chuen-Lung & Vempati, Venkateswara S. & Aljaber, Nasser, 1995. "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, Elsevier, vol. 80(2), pages 389-396, January.
    2. Ho, Johnny C. & Chang, Yih-Long, 1991. "A new heuristic for the n-job, M-machine flow-shop problem," European Journal of Operational Research, Elsevier, vol. 52(2), pages 194-202, May.
    3. Taillard, E., 1990. "Some efficient heuristic methods for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 65-74, July.
    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. K A H Kobbacy & S Vadera & M H Rasmy, 2007. "AI and OR in management of operations: history and trends," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 10-28, January.
    2. Débora Ronconi, 2005. "A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking," Annals of Operations Research, Springer, vol. 138(1), pages 53-65, September.
    3. Liu, Shi Qiang & Kozan, Erhan, 2009. "Scheduling a flow shop with combined buffer conditions," International Journal of Production Economics, Elsevier, vol. 117(2), pages 371-380, February.
    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. 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.
    6. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    7. Donald Davendra & Ivan Zelinka & Magdalena Bialic-Davendra & Roman Senkerik & Roman Jasek, 2012. "Clustered enhanced differential evolution for the blocking flow shop scheduling problem," 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. 20(4), pages 679-717, December.
    8. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    9. Pham, Dinh-Nguyen & Klinkert, Andreas, 2008. "Surgical case scheduling as a generalized job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1011-1025, March.
    10. Nouha Nouri & Talel Ladhari, 2018. "Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking," Annals of Operations Research, Springer, vol. 267(1), pages 413-430, August.
    11. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    12. Ada Y. Barlatt & Amy Cohn & Oleg Gusikhin & Yakov Fradkin & Rich Davidson & John Batey, 2012. "Ford Motor Company Implements Integrated Planning and Scheduling in a Complex Automotive Manufacturing Environment," Interfaces, INFORMS, vol. 42(5), pages 478-491, October.
    13. Xiaohui Zhang & Xinhua Liu & Shufeng Tang & Grzegorz Królczyk & Zhixiong Li, 2019. "Solving Scheduling Problem in a Distributed Manufacturing System Using a Discrete Fruit Fly Optimization Algorithm," Energies, MDPI, Open Access Journal, vol. 12(17), pages 1-24, August.
    14. 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.
    15. 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.
    16. Ribas, Imma & Companys, Ramon & Tort-Martorell, Xavier, 2011. "An iterated greedy algorithm for the flowshop scheduling problem with blocking," Omega, Elsevier, vol. 39(3), pages 293-301, June.
    17. Lee, Wen-Chiung & Shiau, Yau-Ren & Chen, Shiuan-Kang & Wu, Chin-Chia, 2010. "A two-machine flowshop scheduling problem with deteriorating jobs and blocking," International Journal of Production Economics, Elsevier, vol. 124(1), pages 188-197, March.
    18. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, 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. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    2. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    3. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    4. Rad, Shahriar Farahmand & Ruiz, Rubén & Boroojerdian, Naser, 2009. "New high performing heuristics for minimizing makespan in permutation flowshops," Omega, Elsevier, vol. 37(2), pages 331-345, April.
    5. Onwubolu, Godfrey & Davendra, Donald, 2006. "Scheduling flow shops using differential evolution algorithm," European Journal of Operational Research, Elsevier, vol. 171(2), pages 674-692, June.
    6. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    7. Chen, Chuen-Lung & Vempati, Venkateswara S. & Aljaber, Nasser, 1995. "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, Elsevier, vol. 80(2), pages 389-396, January.
    8. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    9. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    10. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    11. Agarwal, Anurag & Colak, Selcuk & Eryarsoy, Enes, 2006. "Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach," European Journal of Operational Research, Elsevier, vol. 169(3), pages 801-815, March.
    12. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    13. Chu, Chengbin & Proth, Jean-Marie & Sethi, Suresh, 1995. "Heuristic procedures for minimizing makespan and the number of required pallets," European Journal of Operational Research, Elsevier, vol. 86(3), pages 491-502, November.
    14. O Etiler & B Toklu & M Atak & J Wilson, 2004. "A genetic algorithm for flow shop scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 830-835, August.
    15. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    16. Wilson, Amy D. & King, Russell E. & Wilson, James R., 2004. "Case study on statistically estimating minimum makespan for flow line scheduling problems," European Journal of Operational Research, Elsevier, vol. 155(2), pages 439-454, June.
    17. Baker, Kenneth R. & Altheimer, Dominik, 2012. "Heuristic solution methods for the stochastic flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(1), pages 172-177.
    18. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2005. "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics," European Journal of Operational Research, Elsevier, vol. 165(1), pages 34-54, August.
    19. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    20. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.

    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:70:y:2001:i:2:p:101-115. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: . General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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 hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.