Real time multiple-grade cutting stock optimization using adaptive fuzzy and recursive algorithms
暂无分享,去创建一个
[1] Kenneth H. Rosen. Discrete Mathematics and Its Applications: And Its Applications , 2006 .
[2] Mark R. Lembersky,et al. “Decision Simulators” Speed Implementation and Improve Operations , 1984 .
[3] Peter Trkman,et al. A combined approach to the solution to the general one-dimensional cutting stock problem , 2005, Comput. Oper. Res..
[4] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[5] Robert W. Haessler. Selection and design of heuristic procedures for solving roll trim problems , 1988 .
[6] Mikael Rönnqvist. A method for the cutting stock problem with different qualities , 1995 .
[7] Harald Dyckhoff,et al. A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..
[8] Gleb Belov,et al. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..
[9] Oliver Holthaus,et al. On the best number of different standard lengths to stock for one-dimensional assortment problems , 2003 .
[10] Paul E. Sweeney,et al. Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .
[11] Miro Gradisar,et al. A hybrid approach for optimization of one-dimensional cutting , 1999, Eur. J. Oper. Res..
[12] Xin Yao,et al. A new evolutionary approach to cutting stock problems with and without contiguity , 2002, Comput. Oper. Res..
[13] David Pisinger. A tree-search heuristic for the container loading problem , 1998 .
[14] Francis J. Vasko,et al. A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading , 1999, Eur. J. Oper. Res..
[15] Cliff T. Ragsdale,et al. The Ordered Cutting Stock Problem , 2004, Decis. Sci..
[16] F. F. Chen,et al. Holonic Concept Based Methodology for Part Routeing on Flexible Manufacturing Systems , 2000 .
[17] Robert Hinterding,et al. Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity , 1993, Evo Workshops.
[18] Stephen F. Smith,et al. Ant colony control for autonomous decentralized shop floor routing , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.
[19] Peter B. Luh,et al. Holonic manufacturing scheduling: architecture, cooperation mechanism, and implementation , 1997, Proceedings of IEEE/ASME International Conference on Advanced Intelligent Mechatronics.
[20] Robert W. Haessler,et al. One-dimensional cutting stock decisions for rolls with multiple quality grades , 1990 .
[21] Janko Cernetic,et al. Improving competitiveness in veneers production by a simple-to-use DSS , 2004, Eur. J. Oper. Res..
[22] David Whitaker,et al. A Partitioned Cutting-stock Problem Applied in the Meat Industry , 1990 .
[23] Gerhard Wäscher,et al. Simulated annealing for order spread minimization in sequencing cutting patterns , 1998, Eur. J. Oper. Res..
[24] Hideyuki Takagi,et al. Optimization of Fuzzy Systems by Switching Reasoning Methods Dynamically , 1993 .
[25] Bret J. Wagner,et al. A genetic algorithm solution for one-dimensional bundled stock cutting , 1999, Eur. J. Oper. Res..
[26] Chuen-Lung Chen,et al. A simulated annealing heuristic for the one-dimensional cutting stock problem , 1996 .
[27] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[28] Alain Delchambre,et al. A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[29] D. Sculli,et al. A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape , 1981 .
[30] J. Oliveira,et al. Solving nesting problems with non‐convex polygons by constraint logic programming , 2003 .
[31] Hermann Gehring,et al. A Genetic Algorithm for Solving the Container Loading Problem , 1997 .