| 1283 | -- | 1300 | William G. Ferrell Jr., Aman Chhoker. Design of economically optimal acceptance sampling plans with inspection error |
| 1301 | -- | 1315 | Suk-Hun Yoon, Jose A. Ventura. Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling |
| 1317 | -- | 1330 | Kenneth E. Rosing, M. John Hodgson. Heuristic concentration for the ::::p::::-median: an example demonstrating how and why it works |
| 1331 | -- | 1341 | Umesh Chandra Gupta, V. Goswami. Performance analysis of finite buffer discrete-time queue with bulk service |
| 1343 | -- | 1352 | Giuseppe Paletta. The period traveling salesman problem: a new heuristic algorithm |
| 1353 | -- | 1374 | Marcos Escobar, Amedeo R. Odoni, Emily Roth. Approximate solution for multi-server queueing systems with Erlangian service times |
| 1375 | -- | 1391 | Anito Joseph. A concurrent processing framework for the set partitioning problem |
| 1393 | -- | 1415 | Tai-Hsi Wu, Chinyao Low, Jiunn-Wei Bai. Heuristic solutions to multi-depot location-routing problems |
| 1417 | -- | 1439 | Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov. Heuristics for hybrid flow shops with controllable processing times and assignable due dates |
| 1441 | -- | 1446 | Edward Yu-Hsien Lin, Dennis L. Bricker. Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming |