Genetic algorithms for batch sizing and production scheduling
暂无分享,去创建一个
[1] Heinrich Braun,et al. On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.
[2] Vipul Jain,et al. Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..
[3] Sergio Ledesma,et al. Practical Considerations for Simulated Annealing Implementation , 2008 .
[4] Yanchun Liang,et al. Solving traveling salesman problems by genetic algorithms , 2003 .
[5] Don T. Phillips,et al. A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .
[6] Jeff T. Linderoth,et al. Algorithms and Software for Convex Mixed Integer Nonlinear Programs , 2012 .
[7] Jaime Cerdá,et al. State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..
[8] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] Jorge Cantón Padilla. Integrated support system for planning and scheduling of batch chemical plants , 2003 .
[11] P. Balasubramanie,et al. Analysis of Various Alternate Crossover Strategies for Genetic Algorithm to Solve Job Shop Scheduling Problems , 2011 .
[12] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.