Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach
暂无分享,去创建一个
[1] Enrique Mérida Casermeiro,et al. Modelling competitive Hopfield networks for the maximum clique problem , 2003, Comput. Oper. Res..
[2] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[3] Vladimir Cherkassky,et al. A neural network approach to job-shop scheduling , 1991, IEEE Trans. Neural Networks.
[4] Yoshiyasu Takefuji,et al. Scaling properties of neural networks for job-shop scheduling , 1995, Neurocomputing.
[5] Katsumi Morikawa,et al. Neural network approach for minimizing the makespan of the general job-shop , 1994 .
[6] Mahesan Niranjan,et al. A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.
[7] Tao Li,et al. Design of Competition-Based Neural Networks for Combinatorial Optimization , 1990, Int. J. Neural Syst..
[8] Mohamad H. Hassoun,et al. A coupled gradient network approach for static and temporal mixed-integer optimization , 1996, IEEE Trans. Neural Networks.
[9] Zhen-Ping Lo,et al. Multiple job scheduling with artificial neural networks , 1993 .
[10] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .
[11] Kate A. Smith,et al. Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research , 1999 .
[12] Esther M. Arkin,et al. Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..
[13] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .
[14] N. S. Şengör,et al. An analysis of maximum clique formulations and saturated linear dynamical network , 1999 .
[15] R. Heady,et al. Minimizing the sum of job earliness and tardiness in a multimachine system , 1998 .
[16] Gao Liansheng,et al. Intelligent scheduling model and algorithm for manufacturing , 2000 .
[17] Yuehwern Yih,et al. Selection of dispatching rules on multiple dispatching decision points in real-time scheduling of a semiconductor wafer fabrication system , 2003 .
[18] Zhiwei Zhu,et al. Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .
[19] T. S. Abdul-Razaq,et al. Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .
[20] Jeffrey B. Sidney,et al. Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..
[21] Jose A. Ventura,et al. Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .
[22] M. Chen,et al. Applications of neural networks to solving SMT scheduling problems a case study , 1999 .
[23] B. Kamgar-Parsi. Dynamical stability and parameter selection in neural optimization , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.
[24] Guoqing Wang,et al. Parallel machine earliness and tardiness scheduling with proportional weights , 2003, Comput. Oper. Res..
[25] J. J. Hopfield,et al. “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.
[26] Yoshiyasu Takefuji,et al. A generalized maximum neural network for the module orientation problem , 1992 .
[27] Yoshiyasu Takefuji,et al. Neural network parallel computing , 1992, The Kluwer international series in engineering and computer science.
[28] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .
[29] Nagraj Balakrishnan,et al. Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..
[30] Sweet. Determination of parameters in a Hopfield/Tank computational network , 1988 .
[31] P. De,et al. Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .
[32] Yueh-Min Huang,et al. Competitive neural network to solve scheduling problems , 2001, Neurocomputing.
[33] James P. Ignizio,et al. A stochastic neural network for resource constrained scheduling , 1992, Comput. Oper. Res..
[34] Yoichi Takenaka,et al. A maximum neural network approach for N-queens problems , 1997, Biological Cybernetics.
[35] P. Ow,et al. Filtered beam search in scheduling , 1988 .
[36] José Muñoz-Pérez,et al. Design and analysis of maximum Hopfield networks , 2001, IEEE Trans. Neural Networks.
[37] Ihsan Sabuncuoglu,et al. A neural network model for scheduling problems , 1996 .
[38] Pau-Choo Chung,et al. Polygonal approximation using a competitive Hopfield neural network , 1994, Pattern Recognit..
[39] Sanjit K. Mitra,et al. Alternative networks for solving the traveling salesman problem and the list-matching problem , 1988, IEEE 1988 International Conference on Neural Networks.
[40] G. G. Coghill,et al. Genetic breeding of control parameters for the Hopfield/Tank neural net , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.
[41] Yoshiyasu Takefuji,et al. A parallel improvement algorithm for the bipartite subgraph problem , 1992, IEEE Trans. Neural Networks.
[42] J. Wang. A time-varying recurrent neural system for convex programming , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.
[43] Funda Sivrikaya-Serifoglu,et al. Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..
[44] Nicholas G. Hall. Single- and multiple-processor models for minimizing completion time variance , 1986 .
[45] J J Hopfield,et al. Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.
[46] T. M. Willems,et al. Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling , 1995, J. Intell. Manuf..
[47] Yoshiyasu Takefuji,et al. An artificial maximum neural network: a winner-take-all neuron model forcing the state of the system in a solution domain , 2004, Biological Cybernetics.
[48] David E. van den Bout,et al. A traveling salesman objective function that works , 1988, IEEE 1988 International Conference on Neural Networks.
[49] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[50] Robert E. Tarjan,et al. One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..