Journal: Computers & OR

Volume 17, Issue 6

0 -- 0James P. Ignizio. Foreword
0 -- 0Samuel J. Raff. Preface
523 -- 533James P. Ignizio. A brief introduction to expert systems
535 -- 543Paul N. Finlay. Decision support systems and expert systems: A comparison of their components and design methodologies
545 -- 552Jay Liebowitz. Introducing an expert systems course into the operations research curriculum
553 -- 560Robert R. Trippi, Efraim Turban. Auto-learning approaches for building expert systems
561 -- 570Tom M. Cavalier, Panos M. Pardalos, Allen L. Soyster. Modeling and integer programming techniques applied to propositional calculus
571 -- 580Don E. Deal, Jen-Gwo Chen, James P. Ignizio, V. Jeyakumar. An expert system scheduler: Some reflections on expert systems development

Volume 17, Issue 5

427 -- 435Rajesh Srivastava, W. C. Benton. The location-routing problem: Considerations in physical distribution system design
437 -- 445Charles Friden, Alain Hertz, Dominique de Werra. Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
447 -- 456Peter C. Bell, Arshad A. Taseen, Paul F. Kirkpatrick. Visual interactive simulation modeling in a decision support role
457 -- 464Youling Lin, Larry M. Austin, James R. Burns. An implicit branch-and-bound algorithm for mixed-integer-linear programming
465 -- 473David Romero, Adolfo Sánchez-Flores. Methods for the one-dimensional space allocation problem
475 -- 479George D. Tsiotras, Hussein Badr. A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite capacity
481 -- 494Geoffrey Bianchi, Richard L. Church. A heuristic for a hybrid fleet model
495 -- 507Malachy Carey. Extending and solving a multiperiod congested network flow model
509 -- 521Richard F. Deckro, Sarangan Rangachari. A goal approach to assembly line balancing

Volume 17, Issue 4

325 -- 332Horst A. Eiselt, Carl-Louis Sandblom. Experiments with external pivoting
333 -- 342Prabuddha De, Jay B. Ghosh, Charles E. Wells. CON due-date determination and sequencing
343 -- 348Claude Dennis Pegden, Matthew Rosenshine. Scheduling arrivals to queues
349 -- 357B. Madhu Rao. On the departure process of the split and match queue
359 -- 363Eng Ung Choo, Gin Hor Chan. Two-way eyeballing heuristics in dynamic lot sizing with backlogging
365 -- 373Tien Y. Kao, Elsayed A. Elsayed. Performance of the LPT algorithm in multiprocessor scheduling
375 -- 388Ashok Vernekar, G. Anandalingam, C. N. Dorny. Optimization of resource location in hierarchical computer networks
389 -- 396Jae D. Hong, M. Jeya Chandra. A heuristic algorithm to minimize the number of crews allocated in an airlift operation
397 -- 409Bajis Dodin, Mete Sirvanci. Stochastic networks and the extreme value distribution
411 -- 423Muhittin Oral, Ossama Kettani. Modeling outranking process as a mathematical programming problem
425 -- 426T. C. Edwin Cheng. A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

Volume 17, Issue 3

243 -- 253F. A. Ogbu, David K. Smith. The application of the simulated annealing algorithm to the solution of the ::::n::::/::::m::::/::::C::::::::::max:::::: flowshop problem
255 -- 263Michael Bastian. Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem
265 -- 272Byong-Hun Ahn, Jae-Ho Hyun. Single facility multi-class job scheduling
273 -- 281D. C. Brauer, G. Naadimuthu. Office facilities planning considering organizational constraints
283 -- 295James S. DeArmon. Improving random number generators on micro-computers
297 -- 307Ram Gopalan, Rajan Batta, Mark H. Karwan. The equity constrained shortest path problem
309 -- 314J. M. Wilson. Compact normal forms in propositional logic and integer programming formulations
315 -- 320Rex K. Kincaid, Oded Z. Maimon. A note on locating a central vertex of a 3-cactus graph
321 -- 324T. C. Edwin Cheng. A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

Volume 17, Issue 2

123 -- 132Jati K. Sengupta. Tests of efficiency in data envelopment analysis
133 -- 142Ue-Pyng Wen, Y. H. Yang. Algorithms for solving the mixed integer two-level linear programming problem
143 -- 152Ana Friedlander, Filho C. Lyra, Hermano Tavares, Eunice L. Medina. Optimization with staircase structure: An application to generation scheduling
153 -- 161Y.-L. Chen, Y. H. Chin. The quickest path problem
163 -- 175Fred F. Easton. A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
177 -- 185Christian N. Madu, Michael N. Chanin, Nicholas C. Georgantzas, Chu-hua Kuei. Coefficient of variation: A critical factor in maintenance float policy
187 -- 198John R. Current, Charles S. Revelle, Jared L. Cohon. An interactive approach to identify the best compromise solution for two objective shortest path problems
199 -- 210S. Selçuk Erengüç, Yasemin Aksoy. A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
211 -- 220LeRoy F. Simmons, Laurette Poulos Simmons, Mayur Mehta, Vivek Shah. Cycle regression analysis: Simultaneous estimation of trigonometric components of a time series
221 -- 230Anna Sciomachen, R. Sozzi. The algorithmic structure of a decision support system for a design of a district heating network
231 -- 241Prabuddha De, Jay B. Ghosh, Charles E. Wells. Scheduling about a common due date with earliness and tardiness penalties

Volume 17, Issue 1

1 -- 7Chuen-Lung Chen, Robert L. Bulfin Jr.. Scheduling unit processing time jobs on a single machine with multiple criteria
9 -- 16Patrick G. McKeown, Cliff T. Ragsdale. A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
17 -- 25Alan Levine, David Finkel. Load balancing in a multi-server queuing system
27 -- 37Hani I. Mesak. Impact of anticipated competitive entry and cost experience on optimal strategic pricing of technological innovations
39 -- 50Cengiz Haksever, Jeffrey L. Ringuest. Computational efficiency and interactive molp algorithms: An implementation of the simolp procedure
51 -- 61Erhan Erkut, Thomas Baptie, Balder Von Hohenbalken. The discrete ::::p::::-Maxian location problem
63 -- 71Joseph Kreimer, Moshe Dror. The monotonicity of the threshold detection probability in a stochastic accumulation process
73 -- 78Hark Hwang, Dug Hee Moon, Seong Whan Shinn. An EOQ model with quantity discounts for both purchasing price and freight cost
79 -- 94James H. Bookbinder, Steven H. Edwards. School-bus routing for program scheduling
95 -- 96M. B. Wright. Speeding up the hungarian algorithm
97 -- 103J. R. Rao, Nilima Roy. Use of tranquility in determining the numerical compensation for a fuzzy multicriteria decision making problem
105 -- 112Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen. Single machine scheduling to minimize mean absolute lateness: A heuristic solution
113 -- 117Ton Volgenant, Roy Jonker. Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
119 -- 121Hyo-Seong Lee. A short note on the poisson input queuing system with start-up time and under control-operating policy