Local search methods for the flowshop scheduling problem with flowtime minimization

Allahverdi, 2002, New heuristics to minimize total completion time in m-machine flowshops, International Journal of Production Economics, 77, 71, 10.1016/S0925-5273(01)00228-6 Baker, 1974 Ballestı´n, 2007, Resource leveling in make-to-order production: modeling and heuristic solution method, International Journal of Operations Research, 4, 50 Bansal, 1977, Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach, IIE Transactions, 9, 306 Czapiński, 2010, Parallel simulated annealing with genetic enhancement for flowshop problem with Csum, Computers & Industrial Engineering, 59, 778, 10.1016/j.cie.2010.08.003 Dong, 2009, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Computers & Operations Research, 36, 1664, 10.1016/j.cor.2008.04.001 Dubois-Lacoste, 2011, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Computers & Operations Research, 38, 1219, 10.1016/j.cor.2010.10.008 Fanjul-Peyro, 2010, Iterated greedy local search methods for unrelated parallel machine scheduling, European Journal of Operational Research, 207, 55, 10.1016/j.ejor.2010.03.030 Framinan, 2005, Comparison of heuristics for flowtime minimisation in permutation flowshops, Computers & Operations Research, 32, 1237, 10.1016/j.cor.2003.11.002 Gonzalez, 1978, Flowshop and jobshop schedules: complexity and approximation, Operations Research, 26, 36, 10.1287/opre.26.1.36 Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823 Gupta, 2000, Designing a tabu search algorithm to minimize total flow time in a flow shop, Arabian Journal for Science and Engineering, 25, 79 Ignall, 1965, Application of the branch and bound technique to some flow shop scheduling problems, Operations Research, 13, 400, 10.1287/opre.13.3.400 Jarboui, 2008, A combinatorial particle swarm optimization for solving permutation flowshop problems, Computers & Industrial Engineering, 54, 526, 10.1016/j.cie.2007.09.006 Jarboui, 2009, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Computers & Operations Research, 36, 2638, 10.1016/j.cor.2008.11.004 Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Laha, 2009, A heuristic to minimize total flow time in permutation flow shop, OMEGA, The International Journal of Management Science, 37, 734, 10.1016/j.omega.2008.05.002 Laurent, 2009, Iterated local search for the multiple depot vehicle scheduling problem, Computers & Industrial Engineering, 57, 277, 10.1016/j.cie.2008.11.028 Li, 2009, Efficient composite heuristics for total flowtime minimization in permutation flow shops, OMEGA, The International Journal of Management Science, 37, 155, 10.1016/j.omega.2006.11.003 Li, 2005, An efficient constructive heuristic for permutation flow shops to minimize total flowtime, Chinese Journal of Electronics, 14, 203 Liu, 2001, Constructive and composite heuristic solutions to the P//∑Cj scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5 Lourenço, 2010, Iterated local search: framework and applications, vol. 14, 363 Minella, 2011, Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems, Computers & Operations Research, 38, 1521, 10.1016/j.cor.2011.01.010 Montgomery, 2009 Osman, 1989, Simulated annealing for permutation flow-shop scheduling, OMEGA, The International Journal of Management Science, 17, 551, 10.1016/0305-0483(89)90059-5 Pan, 2008, A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Computers & Industrial Engineering, 55, 795, 10.1016/j.cie.2008.03.003 Pan, 2012, An estimation of distribution algorithm for lot-streaming flow shop problems with setup times OMEGA, The International Journal of Management Science, 40, 166 Pinedo, 2009 Rajendran, 1993, Heuristic algorithm for scheduling in flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1 Rajendran, 2004, Ant-colony algorithms for permutation flowhsop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6 Rajendran, 2005, Two ant-colony algorithms for minimizing total flowtime in permutation flowshops, Computers & Industrial Engineering, 48, 789, 10.1016/j.cie.2004.12.009 Ribas, 2011, An iterated greedy algorithm for the flowshop scheduling problem with blocking, OMEGA, The International Journal of Management Science, 39, 293, 10.1016/j.omega.2010.07.007 Ruiz, 2006, Two new robutst genetic algorithms for the flowshop scheduling problem, OMEGA, The International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006 Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009 Ruiz, 2008, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, European Journal of Operational Research, 187, 1143, 10.1016/j.ejor.2006.07.029 Stafford, 1988, On the development of a mixed integer linear programming model for the flowshop sequencing problem, Journal of the Operational Research Society, 39, 1163, 10.1057/jors.1988.193 Stützle, T., 1998. Local Search Algorithms for Combinatorial Problems – Analysis, Algorithms, and New Applications. PhD thesis. TU Darmstadt, Computer Science Department. Darmstadt, Germany. Stützle, T., 1998b. Applying Iterated Local Search to the Permutation Flowshop Problem. Technical Report AIDA-98-04. FG Intellektik, TU Darmstadt. Darmstadt, Germany. Stützle, 2006, Iterated local search for the quadratic assignment problem, European Journal of Operational Research, 174, 1519, 10.1016/j.ejor.2005.01.066 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Tang, 2002, A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time, Journal of Intelligent Manufacturing, 13, 61, 10.1023/A:1013681029869 Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024 Tasgetiren, 2011, A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow Shops, Information Sciences, 181, 3459, 10.1016/j.ins.2011.04.018 Tseng, 2009, A hybrid genetic local search for the permutation flowshop scheduling problem, European Journal of Operational Research, 198, 84, 10.1016/j.ejor.2008.08.023 Tseng, 2010, A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem, International Journal of Production Economics, 127, 121, 10.1016/j.ijpe.2010.05.003 Urlings, 2010, Shifting representation search for hybrid flexible flowline problems, European Journal of Operational Research, 207, 1086, 10.1016/j.ejor.2010.05.041 Vallada, 2010, Genetic algorithm with path relinking for the minimum tardiness permutation flowshop problem, OMEGA, The International Journal of Management Science, 38, 556, 10.1016/j.omega.2009.04.002 Vempati, 1993, An effective heuristic for flow shop problems with total flow time as criterion, Computers & Industrial Engineering, 25, 219, 10.1016/0360-8352(93)90260-5 Xu, 2011, An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization, Expert systems with Applications, 38, 7970, 10.1016/j.eswa.2010.12.075 Yamada, T., Reeves, C.R., 1998. Solving the Csum permutation flowshop scheduling problem by genetic local search. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 230–234. Yao, 2010, Bi-objective Multipopulation genetic algorithm for multimodal function optimization, IEEE Transactions on Evolutionary Computation, 14, 80, 10.1109/TEVC.2009.2017517 Zhang, 2009, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, European Journal of Operational Research, 196, 869, 10.1016/j.ejor.2008.04.033 Zhang, 2011, Estimation of distribution algorithm for permutation flow shops with total flowtime minimization, Computers & Industrial Engineering, 60, 706, 10.1016/j.cie.2011.01.005 Zheng, 2010, Solving flow shop scheduling problems by quantum differential evolutionary algorithm, International Journal of Advanced Manufacturing Technology, 49, 643, 10.1007/s00170-009-2438-4