Decomposition Based on Models that use Bandwidth Minimization Heuristics in Matrices for Scheduling Problems
暂无分享,去创建一个
Nelson Rangel-Valdez | Claudia Gómez Santillán | Laura Cruz Reyes | Daniel Martínez-Vega | G. MayraS.Hernández | R. FedericoGamboa
[1] Hakan Yildiz,et al. Methodologies and applications for scheduling, routing & related problems , 2008 .
[2] Pavel Novoa Hernández. Optimización evolutiva multi-objetivo en la planificación de controles a clase en la educación superior cubana , 2015 .
[3] Simon Li,et al. A Formal Two-Phase Method for Decomposition of Complex Design Problems , 2005 .
[4] Celso C. Ribeiro,et al. Sports scheduling: Problems and applications , 2012, Int. Trans. Oper. Res..
[5] Bahman Naderi,et al. Solution algorithms for the project selection and scheduling problem with resource constraints and time dependent returns , 2015 .
[6] Jesús María,et al. Optimización bajo incertidumbre. Técnicas de descomposición y aplicación en Grid , 2008 .
[7] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[8] Ronald G. Askin,et al. Project selection, scheduling and resource allocation with time dependent returns , 2009, Eur. J. Oper. Res..
[9] Jaime A Giraldo,et al. generador de modelos de simulación. aplicaciones en scheduling , 2013 .
[10] Pavel Novoa-Hernández,et al. Evolutionary Multi-objective Optimization for Scheduling Professor Evaluations in Cuban Higher Education , 2015, Computación y Sistemas.
[11] Daniel Baena Mirabete. Aplicación del método de Benders para ajuste controlado de tablas (CTA) , 2008 .
[12] Andrew Lim,et al. Heuristics for matrix bandwidth reduction , 2006, Eur. J. Oper. Res..
[13] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .