1 | -- | 19 | Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia. Scheduling in sports: An annotated bibliography |
20 | -- | 31 | Brian Q. Rieksts, Jose A. Ventura. Two-stage inventory models with a bi-modal transportation cost |
32 | -- | 41 | Nils Boysen. Truck scheduling at zero-inventory cross docking terminals |
42 | -- | 49 | Russell D. Meller, Zeynep Kirkizoglu, Weiping Chen. A new optimization model to support a bottom-up approach to facility design |
50 | -- | 61 | Jiaquan Gao, Jun Wang. WBMOAIS: A novel artificial immune system for multiobjective optimization |
62 | -- | 71 | B. Srirangacharyulu, G. Srinivasan. Completion time variance minimization in single machine and multi-machine systems |
72 | -- | 82 | Ibrahim Akgün, Barbaros Ç. Tansel. Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints |
83 | -- | 90 | C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu. A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs |
91 | -- | 98 | Vincent Raymond, François Soumis, Dominique Orban. A new version of the Improved Primal Simplex for degenerate linear programs |
99 | -- | 107 | Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu. Improving the discrimination power and weights dispersion in the data envelopment analysis |
108 | -- | 114 | Charles Bordenave, Michel Gendreau, Gilbert Laporte. Heuristics for the mixed swapping problem |
115 | -- | 122 | Anita Schöbel, Daniel Scholz. The big cube small cube solution method for multidimensional facility location problems |
123 | -- | 136 | Alper Murat, Vedat Verter, Gilbert Laporte. A continuous analysis framework for the solution of location-allocation problems with dense demand |
137 | -- | 151 | Hui Li, Jie Sun. Business failure prediction using hybrid:::2::: case-based reasoning (H:::2:::CBR) |
152 | -- | 162 | Fardin Ahmadizar, Mehdi Ghazanfari, Seyyed M. T. Fatemi Ghomi. Group shops scheduling with makespan criterion subject to random release dates and processing times |
163 | -- | 171 | Shimon Abravaya, Michael Segal. Maximizing the number of obnoxious facilities to locate within a bounded region |
172 | -- | 181 | Bing Han, Jimmy Leblet, Gwendal Simon. Hard multidimensional multiple choice knapsack problems, an empirical study |
182 | -- | 188 | Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey. Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times |
189 | -- | 198 | Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi. Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness |
199 | -- | 212 | Nasser Salmasi, Rasaratnam Logendran, Mohammad Reza Skandari. Total flow time minimization in a flowshop sequence-dependent group scheduling problem |
213 | -- | 221 | B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh. A contribution and new heuristics for open shop scheduling |