IDEAS home Printed from https://ideas.repec.org/r/eee/jomega/v35y2007i3p302-311.html

The permutation flow shop problem with blocking. A tabu search approach

Citations

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


Cited by:

  1. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
  2. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
  3. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
  4. Li, Xiaoping & Wang, Qian & Wu, Cheng, 2009. "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, Elsevier, vol. 37(1), pages 155-164, February.
  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. 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.
  7. 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.
  8. Ansis Ozolins, 2019. "Improved bounded dynamic programming algorithm for solving the blocking flow shop 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. 27(1), pages 15-38, March.
  9. 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.
  10. 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.
  11. Bo Liu & Ling Wang & Ying Liu & Shouyang Wang, 2011. "A unified framework for population-based metaheuristics," Annals of Operations Research, Springer, vol. 186(1), pages 231-262, June.
  12. 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.
  13. Teixeira, Ewerton & Subramanian, Anand & Kramer, Hugo Harry, 2026. "A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 329(2), pages 391-404.
  14. Jacobson, Sheldon H. & McLay, Laura A., 2009. "Applying statistical tests to empirically compare tabu search parameters for MAX 3-SATISFIABILITY: A case study," Omega, Elsevier, vol. 37(3), pages 522-534, June.
  15. Han, Yuyan & Wang, Yuting & Pan, Quan-ke & Wang, Ling & Tasgetiren, M. Fatih, 2024. "Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach," European Journal of Operational Research, Elsevier, vol. 318(2), pages 424-441.
  16. Wang, Fan & Zhang, Shengfan & Henderson, Louise M., 2018. "Adaptive decision-making of breast cancer mammography screening: A heuristic-based regression model," Omega, Elsevier, vol. 76(C), pages 70-84.
  17. 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.
  18. 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.
  19. Leung, Lawrence C. & Wong, Wai Hung & Hui, Yer Van & Wan, Yulai, 2013. "Managing third-party logistics under uncertainty: A decision scheme and managerial implications," International Journal of Production Economics, Elsevier, vol. 145(2), pages 630-644.
  20. 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, vol. 12(17), pages 1-24, August.
  21. Ma, Hong & Cheang, Brenda & Lim, Andrew & Zhang, Lei & Zhu, Yi, 2012. "An investigation into the vehicle routing problem with time windows and link capacity constraints," Omega, Elsevier, vol. 40(3), pages 336-347.
  22. Anken, F. & Beasley, J.E., 2012. "Corporate structure optimisation for multinational companies," Omega, Elsevier, vol. 40(2), pages 230-243, April.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.