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

Flowshop scheduling research after five decades

Citations

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


Cited by:

  1. 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.
  2. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
  3. Vallada, Eva & Ruiz, Rubén, 2009. "Cooperative metaheuristics for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 365-376, March.
  4. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
  5. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
  6. Shiuan Wan & Yi-Ping Wang, 2020. "The Comparison of Density-Based Clustering Approach among Different Machine Learning Models on Paddy Rice Image Classification of Multispectral and Hyperspectral Image Data," Agriculture, MDPI, vol. 10(10), pages 1-17, October.
  7. 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.
  8. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.
  9. Figielska, Ewa, 2014. "A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages," European Journal of Operational Research, Elsevier, vol. 236(2), pages 433-444.
  10. Antonino Chiarello & Manlio Gaudioso & Marcello Sammarra, 2018. "Truck synchronization at single door cross-docking terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 395-447, March.
  11. Abdeljaouad, Mohamed Amine & Bahroun, Zied & Omrane, Anissa & Fondrevelle, Julien, 2015. "Job-shop production scheduling with reverse flows," European Journal of Operational Research, Elsevier, vol. 244(1), pages 117-128.
  12. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
  13. Ding, Jian-Ya & Song, Shiji & Wu, Cheng, 2016. "Carbon-efficient scheduling of flow shops by multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 248(3), pages 758-771.
  14. Naderi, Bahman & Ruiz, Rubén, 2014. "A scatter search algorithm for the distributed permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 323-334.
  15. 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.
  16. Henning Strubelt & Sebastian Trojahn & Sebastian Lang & Abdulrahman Nahhas, 2018. "Scheduling Approach for the Simulation of a Sustainable Resource Supply Chain," Logistics, MDPI, vol. 2(3), pages 1-11, July.
  17. Stefansdottir, Bryndis & Grunow, Martin & Akkerman, Renzo, 2017. "Classifying and modeling setups and cleanings in lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 261(3), pages 849-865.
  18. Waldherr, Stefan & Knust, Sigrid & Briskorn, Dirk, 2017. "Synchronous flow shop problems: How much can we gain by leaving machines idle?," Omega, Elsevier, vol. 72(C), pages 15-24.
  19. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
  20. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.
  21. Pang, King-Wah, 2013. "A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness," International Journal of Production Economics, Elsevier, vol. 141(1), pages 127-136.
  22. 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.
  23. 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.
  24. Yeung, Wing-Kwan & Choi, Tsan-Ming & Cheng, T.C.E., 2011. "Supply chain scheduling and coordination with dual delivery modes and inventory storage cost," International Journal of Production Economics, Elsevier, vol. 132(2), pages 223-229, August.
  25. Elisa Negri & Vibhor Pandhare & Laura Cattaneo & Jaskaran Singh & Marco Macchi & Jay Lee, 2021. "Field-synchronized Digital Twin framework for production scheduling with uncertainty," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1207-1228, April.
  26. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
  27. F T Tseng & E F Stafford, 2008. "New MILP models for the permutation flowshop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1373-1386, October.
  28. Ruiz, Rubén & Pan, Quan-Ke & Naderi, Bahman, 2019. "Iterated Greedy methods for the distributed permutation flowshop scheduling problem," Omega, Elsevier, vol. 83(C), pages 213-222.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.