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

An application of genetic algorithms for flow shop problems

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Bruno Athayde Prata & Helio Yochihiro Fuchigami, 2024. "A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness," Journal of Intelligent Manufacturing, Springer, vol. 35(5), pages 2161-2174, June.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. Klemz, Bruce R., 1999. "Using genetic algorithms to assess the impact of pricing activity timing," Omega, Elsevier, vol. 27(3), pages 363-372, June.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.