Best compromise solution for a new multiobjective scheduling problem
暂无分享,去创建一个
[1] Matthias Ehrgott,et al. Computation of ideal and Nadir values and implications for their use in MCDM methods , 2003, Eur. J. Oper. Res..
[2] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[3] Andrzej P. Wierzbicki,et al. Reference Point Approaches , 1999 .
[4] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[5] Jatinder N. D. Gupta,et al. Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..
[6] Yossi Azar,et al. Ancient and New Algorithms for Load Balancing in the lp Norm , 1998, SODA '98.
[7] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[8] Jean-Charles Billaut,et al. Multicriteria Scheduling Problems , 2003 .
[9] Jatinder N. D. Gupta,et al. Two-machine flowshop scheduling with a secondary criterion , 2003, Comput. Oper. Res..
[10] Michael Pinedo,et al. Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis , 1995, INFORMS J. Comput..
[11] Upkar Varshney,et al. Issues in Emerging 4G Wireless Networks , 2001, Computer.
[12] Christian Huitema,et al. Routing in the Internet , 1995 .
[13] Joseph Y.-T. Leung,et al. Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .
[14] John W. Fowler,et al. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..
[15] Jean-Charles Billaut,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[16] E. Gustafsson,et al. Always best connected , 2003, IEEE Wirel. Commun..
[17] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .