635 | -- | 643 | Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard. A GRASP:::TM::: for a difficult single machine scheduling problem:::, ::: |
645 | -- | 654 | Joaquim Júdice, Ana M. Faustino. A computational analysis of LCP methods for bilinear and concave quadratic programming |
655 | -- | 661 | Tom M. Cavalier, Brian J. Melloy. An iterative linear programming solution to the Euclidean regression model |
663 | -- | 668 | R. K.-Y. Li, R. J. Willis. Alternative resources in project scheduling |
669 | -- | 678 | Marc J. Schniederjans, N. K. Kwak, James S. Frueh. A stochastic linear programming model to improve automobile dealership operations |
679 | -- | 694 | Mohan L. Chaudhry, Umesh Chandra Gupta, Manju Agarwal. On exact computational analysis of distributions of numbers in systems for ::::M/G::::/1/::::N:::: + 1 and ::::GI/M::::/1/::::N:::: + 1 queues using roots |
695 | -- | 707 | Yasushi Masuda, Ushio Sumita. Numerical analysis of gracefully degrading fault-tolerant computer systems: Semi-markov and laguerre transform approach |
709 | -- | 716 | Leo W. G. Strijbosch, Arno G. M. van Doorne, Willem J. Selen. A simplified molp algorithm: The MOLP-S procedure |
717 | -- | 720 | Prabuddha De, Jay B. Ghosh, Charles E. Wells. Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine |
721 | -- | 730 | Alireza Ardalan. Combined optimal price and optimal inventory replenishment policies when a sale results in increase in demand |
731 | -- | 739 | Michael M. Kostreva, Karen S. B. Jennings. Nurse scheduling on a microcomputer |
741 | -- | 749 | K. Nurmi. Travelling salesman problem tools for microcomputers |
751 | -- | 765 | Panos Constantopoulos, Fred C. Schweppe, Richard C. Larson. Estia: A real-time consumer control scheme for space conditioning usage under spot electricity pricing |
767 | -- | 786 | Jean-François Mondou, Teodor Gabriel Crainic, Sang Nguyen. Shortest path algorithms: A computational study with the C programming language |
787 | -- | 796 | B. V. Cadambi. One machine scheduling to minimize expected mean tardiness - part I |