| 1611 | -- | 1620 | A. Krishnamoorthy, T. G. Deepak. Modified ::::N::::-policy for ::::M::::/::::G::::/1 queues |
| 1621 | -- | 1640 | Cheng-Shuo Wang, Reha Uzsoy. A genetic algorithm to minimize maximum lateness on a batch processing machine |
| 1641 | -- | 1659 | Ko-Hsin Liang, Xin Yao, Charles S. Newton, David Hoffman. A new evolutionary approach to cutting stock problems with and without contiguity |
| 1661 | -- | 1676 | Yong Kyoon Lee, Kyung-Sam Park, Soung Hie Kim. Identification of inefficiencies in an additive model based IDEA (imprecise data envelopment analysis) |
| 1677 | -- | 1700 | Salvador Nieto Sánchez, Evangelos Triantaphyllou, Jianhua Chen, T. Warren Liao. An incremental learning algorithm for constructing Boolean functions from positive and negative examples |
| 1701 | -- | 1717 | Liang-Yuh Ouyang, Cheng-Kang Chen, Hung-Chi Chang. Quality improvement, setup cost and lead-time reductions in lot size reorder point models with an imperfect production process |
| 1719 | -- | 1737 | Ue-Pyng Wen, Tsung-Lin Wu, Ching-Chir Shyur. Bi-directional self-healing ring network planning |
| 1739 | -- | 1757 | Maria Jesus Lopez-Herrero. On the number of customers served in the ::::M::::/::::G::::/1 retrial queue: first moments and maximum entropy approach |
| 1759 | -- | 1772 | Alexandre Linhares, Horacio Hideki Yanasse. Connections between cutting-pattern sequencing, VLSI design, and flexible machines |