| 1003 | -- | 1016 | E. Jack Chen, W. David Kelton. Estimating steady-state distributions via simulation-generated histograms |
| 1017 | -- | 1029 | Mahesh Kumar, James B. Orlin. Scale-invariant clustering with minimum volume ellipsoids |
| 1030 | -- | 1046 | Kuo-Ling Huang, Ching-Jong Liao. Ant colony optimization combined with taboo search for the job shop scheduling problem |
| 1047 | -- | 1064 | Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Henrique Pacca Loureiro Luna. Benders decomposition for the uncapacitated multiple allocation hub location problem |
| 1065 | -- | 1083 | Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit. Reactive GRASP for the strip-packing problem |
| 1084 | -- | 1098 | Ali Husseinzadeh Kashan, Behrooz Karimi, Masoud Jenabi. A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes |
| 1099 | -- | 1111 | Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi. A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times |
| 1112 | -- | 1126 | José Brandão, Richard W. Eglese. A deterministic tabu search algorithm for the capacitated arc routing problem |
| 1127 | -- | 1137 | Emmanuel Néron, Fabrice Tercinet, Francis Sourd. Search tree based approaches for parallel machine scheduling |
| 1138 | -- | 1150 | Cenk Çaliskan. A double scaling algorithm for the constrained maximum flow problem |
| 1151 | -- | 1175 | Rubén Ruiz, Funda Sivrikaya-Serifoglu, Thijs Urlings. Modeling realistic hybrid flexible flowshop scheduling problems |
| 1176 | -- | 1190 | Rabia Nessah, Farouk Yalaoui, Chengbin Chu. A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates |
| 1191 | -- | 1203 | José H. Dulá. A computational study of DEA with massive data sets |
| 1204 | -- | 1226 | Têkogan D. Hemazro, Brigitte Jaumard, Odile Marcotte. A column generation and branch-and-cut algorithm for the channel assignment problem |
| 1227 | -- | 1249 | Alex J. Ruiz-Torres, Grisselle Centeno. Minimizing the number of late jobs for the permutation flowshop problem with secondary resources |
| 1250 | -- | 1264 | Pedro Leite Rocha, Martín Gómez Ravetti, Geraldo Robson Mateus, Panos M. Pardalos. Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times |
| 1265 | -- | 1280 | Grigorios N. Beligiannis, Charalampos N. Moschopoulos, Georgios P. Kaperonis, Spiridon D. Likothanassis. Applying evolutionary computation to the school timetabling problem: The Greek case |
| 1281 | -- | 1291 | Yaodong Cui, Yuli Yang, Xian Cheng, Peihua Song. A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem |
| 1292 | -- | 1314 | Patrick N. Bless, Diego Klabjan, Soo Y. Chang. Heuristics for automated knowledge source integration and service composition |
| 1315 | -- | 1328 | Cláudio Alves, José M. Valério de Carvalho. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem |
| 1329 | -- | 1343 | Andreas C. Nearchou. A differential evolution approach for the common due date early/tardy job scheduling problem |
| 1344 | -- | 1349 | Dehua Xu, Kaibiao Sun, Hongxing Li. Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan |
| 1350 | -- | 1373 | Eva Vallada, Rubén Ruiz, Gerardo Minella. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics |
| 1374 | -- | 1376 | Bernardo Almada-Lobo, José F. Oliveira, Maria Antónia Carravilla. A note on the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times |