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

An application of genetic algorithms for flow shop problems

Author

Listed:
  • Chen, Chuen-Lung
  • Vempati, Venkateswara S.
  • Aljaber, Nasser

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:80:y:1995:i:2:p:389-396
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0228-P
    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. 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.
    2. Widmer, Marino & Hertz, Alain, 1989. "A new heuristic method for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 41(2), pages 186-193, July.
    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.
    4. 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. Martens, J., 2004. "Two genetic algorithms to solve a layout problem in the fashion industry," European Journal of Operational Research, Elsevier, vol. 154(1), pages 304-322, April.
    2. Chang, Pei-Chann & Huang, Wei-Hsiu & Wu, Jheng-Long & Cheng, T.C.E., 2013. "A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 45-55.
    3. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    4. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    5. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.
    6. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    7. 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.
    8. Alberto, I. & Azcarate, C. & Mallor, F. & Mateo, P. M., 2002. "Optimization with simulation and multiobjective analysis in industrial decision-making: A case study," European Journal of Operational Research, Elsevier, vol. 140(2), pages 373-383, July.
    9. Neppalli, Venkata Ranga & Chen, Chuen-Lung & Gupta, Jatinder N. D., 1996. "Genetic algorithms for the two-stage bicriteria flowshop problem," European Journal of Operational Research, Elsevier, vol. 95(2), pages 356-373, December.
    10. 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.
    11. W Q Huang & L Wang, 2006. "A local search method for permutation flow shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1248-1251, October.
    12. 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.
    13. Klemz, Bruce R., 1999. "Using genetic algorithms to assess the impact of pricing activity timing," Omega, Elsevier, vol. 27(3), pages 363-372, June.
    14. 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.
    15. Gruca, Thomas S. & Klemz, Bruce R., 2003. "Optimal new product positioning: A genetic algorithm approach," European Journal of Operational Research, Elsevier, vol. 146(3), pages 621-633, May.
    16. 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.
    17. 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.
    18. Mok, P.Y. & Kwong, C.K. & Wong, W.K., 2007. "Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1876-1893, March.
    19. 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.
    20. 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.
    21. Martin, Clarence H, 2009. "A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming," Omega, Elsevier, vol. 37(1), pages 126-137, February.
    22. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    23. 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.
    24. 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.
    25. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," 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. 29(4), pages 1353-1374, December.

    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. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Ishibuchi, Hisao & Misaki, Shinta & Tanaka, Hideo, 1995. "Modified simulated annealing algorithms for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 388-398, March.
    11. 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.
    12. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    13. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    14. Angel A. Juan & Helena Ramalhinho-Lourenço & Manuel Mateo & Quim Castellà & Barry B. Barrios, 2012. "ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem," Economics Working Papers 1319, Department of Economics and Business, Universitat Pompeu Fabra.
    15. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    16. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    17. Rajendran, Chandrasekharan & Ziegler, Hans, 2001. "A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs," European Journal of Operational Research, Elsevier, vol. 131(3), pages 622-634, June.
    18. 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.
    19. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 2006. "Some aspects of scatter search in the flow-shop problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 654-666, March.
    20. 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.

    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:80:y:1995:i:2:p:389-396. 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.