Citations (11)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
M Haouari & T Ladhari. (2003) A branch-and-bound-based local search method for the flow shop problem. Journal of the Operational Research Society 54:10, pages 1076-1084.
Read now
Read now
Hui-Chin Tang. (2001) A new lower bounding rule for permutation flow shop scheduling. Journal of Information and Optimization Sciences 22:2, pages 249-257.
Read now
Read now
Articles from other publishers (9)
Marcelo Seido Nagano, Fernando Luis Rossi & Caio Paziani Tomazella. (2017) A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Production Engineering 11:4-5, pages 523-529.
Crossref
Crossref
X. Li & M. Yin. (2012) A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem. Scientia Iranica 19:6, pages 1921-1935.
Crossref
Crossref
J. Jackson, M. Faied & A. Girard. (2011) Comparison of Tabu/2‐opt heuristic and optimal tree search method for assignment problems. International Journal of Robust and Nonlinear Control 21:12, pages 1358-1371.
Crossref
Crossref
Justin Jackson, Yu-hsien Chang & Anouck Girard. (2010) A new measure of solution quality for combinatorial task assignment problems. A new measure of solution quality for combinatorial task assignment problems.
S. Chandrasekaran, S. G. Ponnambalam, R. K. Suresh & N. Vijayakumar. (2007) Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance. Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance.
S. Chandrasekaran, S.G. Ponnambalam, R.K. Suresh & N. Vijayakumar. (2006) A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems. A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems.
S. Chandrasekaran, S.G. Ponnambalam, R.K. Suresh & N. Vijayakumar. (2006) An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance. An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance.
Javier Otamendi. (2006) Integrating Simulation into Decision Support Systems. Integrating Simulation into Decision Support Systems.
Walther Rogério Buzzo & João Vitor Moccellin. (2000) Programação da produção em sistemas flow shop utilizando um método heurístico híbrido algoritmo genético-simulated annealing. Gestão & Produção 7:3, pages 364-377.
Crossref
Crossref