Hybrid Nested Partitions algorithm for scheduling in job shop problem
暂无分享,去创建一个
[1] Leyuan Shi,et al. An Optimization Framework for Product Design , 2001, Manag. Sci..
[2] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[3] Guoyong Shi,et al. A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..
[4] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[5] Hyung Rim Choi,et al. A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..
[6] Jaekyung Yang,et al. Intelligent Partitioning for Feature Selection , 2005, INFORMS J. Comput..
[7] LeyuanSHI,et al. A NESTED PARTITIONS FRAMEWORK FOR SOLVING LARGE-SCALE MULTICOMMODITY FACILITY LOCATION PROBLEMS , 2004 .
[8] Leyuan Shi,et al. Nested Partitions Method for Global Optimization , 2000, Oper. Res..
[9] Mauricio G. C. Resende,et al. A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..
[10] FEDERICO DELLA CROCE,et al. A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..
[11] M. Sakawa,et al. An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate , 1999 .
[12] Leyuan Shi,et al. A method for scheduling in parallel manufacturing systems with flexible resources , 2000 .
[13] Leyuan Shi,et al. A new hybrid optimization algorithm , 1999 .
[14] Leyuan Shi,et al. Optimal buffer allocation in production lines , 2003 .
[15] Leyuan Shi,et al. Ordinal Comparison via the Nested Partitions Method , 2002, Discret. Event Dyn. Syst..
[16] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .