| 645 | -- | 655 | Gur Mosheiov, Daniel Oron. A note on the SPT heuristic for solving scheduling problems with generalized due dates |
| 657 | -- | 674 | Mhand Hifi. Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study |
| 675 | -- | 694 | Mhand Hifi, Rym M Hallah. Approximate algorithms for constrained circular cutting problems |
| 695 | -- | 711 | George Kozanidis, Emanuel Melachrinoudis. A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints |
| 713 | -- | 719 | Miroslaw Kwiesielewicz, Ewa van Uden. Inconsistent and contradictory judgements in pairwise comparison method in the AHP |
| 721 | -- | 743 | Michel Denault, Jean-Louis Goffin. Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach |
| 745 | -- | 759 | So Young Sohn, Ki Yeol Oh. Simulation study for the optimal repair capacity of an IT maintenance center based on LRD failure distribution |
| 761 | -- | 778 | Uwe Aickelin, Kathryn A. Dowsland. An indirect Genetic Algorithm for a nurse-scheduling problem |
| 779 | -- | 790 | Cyril Duron, Jean-Marie Proth. Insertion of a random bitask in a schedule: a real-time approach |
| 791 | -- | 801 | Kuo-Ching Ying, Ching-Jong Liao. An ant colony system for permutation flow-shop sequencing |
| 803 | -- | 805 | Gholam R. Amin, Mehdi Toloo. A polynomial-time algorithm for finding epsilon in DEA models |