Solving the continuous flow-shop scheduling problem by metaheuristics
暂无分享,去创建一个
[1] Paul Jung,et al. No free lunch. , 2002, Health affairs.
[2] Stefan Voß,et al. Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..
[3] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[4] Maurice Bonney,et al. Solutions to the Constrained Flowshop Sequencing Problem , 1976 .
[5] John N. Hooker,et al. Testing heuristics: We have it all wrong , 1995, J. Heuristics.
[6] David Connolly,et al. General Purpose Simulated Annealing , 1992 .
[7] I H Osman,et al. Meta-Heuristics Theory and Applications , 2011 .
[8] René van Dal,et al. Solvable Cases of the No-Wait Flow-Shop Scheduling Problem , 1991 .
[9] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .
[10] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[11] David L. Woodruff,et al. Hashing vectors for tabu search , 1993, Ann. Oper. Res..
[12] Jürg Nievergelt,et al. Complexity, Algorithms, Programs, Systems: The Shifting Focus , 1994, J. Symb. Comput..
[13] Cees Duin,et al. The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs , 1999, Networks.
[14] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[15] Stefan Voß,et al. Generic metaheuristics application to industrial engineering problems , 1999 .
[16] C. Rajendran,et al. Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .
[17] Lucio Bianco,et al. The traveling salesman problem with cumulative costs , 1993, Networks.
[18] Stefan Voß,et al. Hotframe: A Heuristic Optimization Framework , 2003 .
[19] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[20] C. V. Ramamoorthy,et al. On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .
[21] S. S. Panwalkar,et al. The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..
[22] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[23] David L. Woodruff,et al. Optimization software class libraries , 2002 .
[24] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[25] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.
[26] D. Chaudhuri,et al. Heuristic algorithms for continuous flow-shop problem , 1990 .
[27] Stefan Voß,et al. Solving General Ring Network Design Problems by Meta-Heuristics , 2000 .
[28] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[29] Wlodzimierz Szwarc,et al. A note on the flow‐shop problem without interruptions in job processing , 1981 .
[30] José Luis González Velarde,et al. Computing Tools for Modeling, Optimization and Simulation , 2000 .
[31] Matteo Fischetti,et al. The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..
[32] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[33] Huang,et al. AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .
[34] Chandrasekharan Rajendran,et al. A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .
[35] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[36] Victor J. Rayward-Smith,et al. Modern Heuristic Search Methods , 1996 .
[37] John N. Hooker,et al. Needed: An Empirical Science of Algorithms , 1994, Oper. Res..
[38] Jaideep Motwani,et al. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .
[39] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[40] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .
[41] S. Dreyfus,et al. Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .
[42] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[43] J. Gupta. Optimal flowshop schedules with no intermediate storage space , 1976 .
[44] Chuen-Lung Chen,et al. Genetic algorithms applied to the continuous flow shop problem , 1996 .
[45] Mauricio G. C. Resende,et al. Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.
[46] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[47] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..
[48] S. Voß,et al. A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .
[49] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[50] D. A. Wismer,et al. Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..
[51] K. R. Baker,et al. Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .
[52] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[53] Joseph C. Culberson,et al. On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.