Journal: Computers & OR

Volume 21, Issue 9

961 -- 968Clark Jeffries, Tim Niznik. Easing the conscience of the guilty net
969 -- 977I. M. Premachandra, Liliana Gonzalez. An exact solution to a class of queueing systems with multipurpose counters
979 -- 989C. E. Love, K. F. Lam. Classifying and controlling errors in forecasting using multiple criteria goal programming
991 -- 1000Jun Wang. A neural network approach to modeling fuzzy preference relations for multiple criteria decision making
1001 -- 1009Stephen E. Bechtold, Michael J. Brusco. A microcomputer-based heuristic for tour scheduling of a mixed workforce
1011 -- 1024Won J. Lee, A. Victor Cabot, Munirpallam A. Venkataramanan. A branch and bound algorithm for solving separable convex integer programming problems
1025 -- 1033Bruno-Laurent Garcia, Jean-Yves Potvin, Jean-Marc Rousseau. A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints
1035 -- 1039Chiang Kao, J. Y. Wong. Several extensively tested random number generators

Volume 21, Issue 8

797 -- 0Samuel J. Raff. Preface
799 -- 0S. Selçuk Erengüç, Hasan Pirkul. Foreword : Heuristic, Genetic and Tabu Search
801 -- 822Fred Glover. Optimization by ghost image processes in neural networks
823 -- 839David L. Woodruff. Simulated annealing and tabu search: Lessons from a line search
841 -- 853Oya Icmeli, S. Selçuk Erengüç. A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
855 -- 865Jadranka Skorin-Kapov. Extensions of a tabu search adaptation to the quadratic assignment problem
867 -- 876John Knox. Tabu search performance on the symmetric traveling salesman problem
877 -- 884Roland Hübscher, Fred Glover. Applying tabu search with influential diversification to multiprocessor scheduling
885 -- 893James P. Kelly, Manuel Laguna, Fred Glover. A study of diversification strategies for the quadratic assignment problem
895 -- 907Hasan Pirkul, Erik Rolland. New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
909 -- 925Haldun Aytug, Gary J. Koehler, Jane L. Snowdon. Genetic learning of dynamic scheduling within a simulation environment
927 -- 940Anna-Lena Nordström, Süleyman Tüfekci. A genetic algorithm for the talent scheduling problem
941 -- 954Sencer Yeralan, C. S. Lin. Genetic search with dynamic operating disciplines
955 -- 960Daniel G. Conway, M. A. Venkataramanan. Genetic search and the dynamic facility layout problem

Volume 21, Issue 7

717 -- 721T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz. One-machine batching and sequencing of multiple-type items
723 -- 733Francis J. Nourie, Faruk Güder. A restricted-entry method for a transportation problem with piecewise-linear concave costs
735 -- 745Robert C. Soltysik, Paul R. Yarnold. The WARMACK-GONZALEZ algorithm for linear two-category multivariable optimal discriminant analysis
747 -- 755Yaw O. Chang, John K. Karlof. Large scale geometric programming: An application in coding theory
757 -- 768Steven T. Breslawski, Stanley Zionts. A simulation based study of modifications to the Zionts-Wallenius algorithm for multiple objective linear programming
769 -- 776C. S. Sung, B. K. Yoo. Parametric max flow problems in a class of networks with series-parallel structure
777 -- 785Kurt M. Bretthauer, A. Victor Cabot. A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
787 -- 795B. V. Cadambi. One machine scheduling to minimize expected mean tardiness - Part II

Volume 21, Issue 6

597 -- 605Umesh Chandra Gupta, T. S. S. Srinivasa Rao. A recursive method to compute the steady state probabilities of the machine interference model: (::::M::::/::::G::::/1)/::::K::::
607 -- 614William E. Stein, Murray J. Côté. Scheduling arrivals to a queue
615 -- 628N. K. Jaiswal, B. S. Nagabhushana. Combat modeling with spatial effects, reserve deployment and termination decision rules
641 -- 651Wen Lea Pearn, Mao Lin Li. Algorithms for the Windy Postman Problem
653 -- 659Gur Mosheiov. Scheduling jobs under simple linear deterioration
661 -- 675Hamidreza Amindavar, James A. Ritcey, Arun K. Somani. Analytical computation of Markov chain using Padé approximations
677 -- 688John J. Bernardo, Kun-Si Lin. An interactive procedure for bi-criteria production scheduling
689 -- 705Farid Harche, Gerald L. Thompson. The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
707 -- 716Abraham P. Punnen. On combined minmax-minsum optimization

Volume 21, Issue 5

477 -- 486V. Sridharan, R. Lawrence LaForge. A model to estimate service levels when a portion of the master production schedule is frozen
487 -- 498Ahmet Bolat, Mehmet Savsar, Mohammed A. Al-Fawzan. Algorithms for real-time scheduling of jobs on mixed model assembly lines
499 -- 510X. Cai, C. J. Goh. A fast heuristic for the train scheduling problem
511 -- 519Jianzhong Zhang, Dan Sha. A priority measure in interval methods for constrained global optimization
521 -- 533Jeffrey L. Riggs, Sheila B. Brown, Robert P. Trueblood. Integration of technical, cost, and schedule risks in project management
535 -- 541William Hurley. Adjacent vertex simplex algorithms: More experimental results on random problems
543 -- 556Zilla Sinuany-Stern, Abraham Mehrez, Arieh Barboy. Academic departments efficiency via DEA
557 -- 572Oded Herman, Zvi Ganz. The capacity expansion problem in the service industry
573 -- 586Katherine J. Toussaint, Bruce L. Golden. Exchange heuristics to improve the clarity of base/time plots
587 -- 596Joaquim Júdice, Fernanda M. Pires. A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Volume 21, Issue 4

359 -- 367Brian Borchers, John E. Mitchell. An improved branch and bound algorithm for mixed integer nonlinear programs
369 -- 384Yong Sun Choi, Soung Hie Kim. An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors
385 -- 396Layek Abdel-Malek, Chi Tang. A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
397 -- 410Takeo Yamada, J. Yoruzuya, Seiji Kataoka. Enumerating extreme points of a highly degenerate polytope
411 -- 420Tej S. Dhakar, Charles P. Schmidt, David M. Miller. Base stock level determination for high cost low demand critical repairable spares
421 -- 431Kemal Altinkemer. Topological design of ring networks
433 -- 445Ami Arbel. A multiobjective interior primal-dual linear programming algorithm
447 -- 454Yuemin Ding, Alok Baveja, Rajan Batta. Implementing larson and sadiq s location model in a geographic information system
455 -- 461Stephen M. Hart, Chuen-Lung Chen. Simulated annealing and the mapping problem: A computational study
463 -- 475Hong Chich Chou, Chung-Ping Chung. Optimal multiprocessor task scheduling using dominance and equivalence relations

Volume 21, Issue 3

225 -- 238Lance A. Matheson, J. Pirie Hart, Theodore D. Klastorin. The optimal design of personalized bank check printing plates
239 -- 248Bezalel Gavish, Suresh Sridhar. ::::O::::(::::n::::) algorithms for load balancing in distributed computing systems
249 -- 263Bill C. Hardgrave, Rick L. Wilson, Kent A. Walstrom. Predicting graduate student success: A comparison of neural networks and traditional techniques
265 -- 279John N. Hooker, Hong Yan, Ignacio E. Grossmann, R. Raman. Logic cuts for processing networks with fixed charges
281 -- 287Marc J. Schniederjans, Karen D. Loch. An aid for strategic marketing in the banking industry: A Markov analysis
289 -- 296Surendra M. Gupta, Emanuel Melachrinoudis. Complementarity and equivalence in finite source queueing models with spares
297 -- 317Sushant Jain, J. MacGregor Smith. Open finite queueing networks with ::::M/M/C/K:::: parallel servers
319 -- 327Han-Lin Li. A new global approach for 0-1 polynomial programs
329 -- 336Adam Fadlalla, James R. Evans, Martin S. Lew. A greedy heuristic for the mean tardiness sequencing problem
337 -- 351Gölgen Bengü, Juan Carlos Ortiz. Telecommunications systems maintenance
353 -- 358Kao-Chêng Lin, Maw-Sheng Chern. The single most vital arc in the most economical path problem - A parametric analysis

Volume 21, Issue 2

113 -- 118Gen-Huey Chen, Yung-Chen Hung. Algorithms for the constrained quickest path problem and the enumeration of quickest paths
119 -- 125David Ben-Arieh, Ping-Teng Chang. An extension to the ::::p::::-median group technology algorithm
127 -- 142Shouhong Wang, Norman P. Archer. A neural network technique in modeling multiple criteria multiple person decision making
143 -- 154Shouhong Wang. Neural network techniques for monotonic nonlinear models
155 -- 167P. L. Abad. Supplier pricing when the buyer s annual requirements are fixed
169 -- 183Stan Lipovetsky, Asher Tishler. Linear methods in multimode data analysis for decision making
185 -- 197Evangelos Triantaphyllou, Allen L. Soyster, Soundar R. T. Kumara. Generating logical expressions from positive and negative examples via a branch-and-bound approach
199 -- 204Pao-Long Chang, Shiuh-Nan Hwang, Chiang Kao. Some good multipliers for random number generator for 16-bit microcomputers
205 -- 210Paulo M. França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller. A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
211 -- 224Elsayed A. Elsayed, Mohammed Ettouney. Perturbation analysis of linear programming problems with random parameters

Volume 21, Issue 10

1041 -- 1050Weizhen Mao, Rex K. Kincaid. A look-ahead heuristic for scheduling jobs with release dates on a single machine
1051 -- 1059Norman D. Curet. An incremental primal-dual method for generalized networks
1061 -- 1068Ely Merzbach, Boris Singer. How to construct a partition when preference sets are given
1069 -- 1072Les G. Proll, Abdellah Salhi. A note on a maximum distance problem
1073 -- 1088Cheryl Gaimon, Johnny C. Ho. Uncertainty and the acquisition of capacity: A competitive analysis
1089 -- 1093Chiang Kao. Decomposition with simulated division for efficiently generating random numbers
1095 -- 1101Ching-Jong Liao. A new node selection strategy in the branch-and-bound procedure
1103 -- 1113Erhan Erkut, Yilmaz Ülküsal, Oktay Yeniçerioglu. A comparison of ::::p::::-dispersion heuristics
1115 -- 1127John R. Gum, James A. Chisman. An operations research information system (ORIS)

Volume 21, Issue 1

1 -- 9John W. Chinneck. MINOS(IIS): Infeasibility analysis using MINOS
11 -- 17Noel Bryson, Saul I. Gass. Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
19 -- 25Frits C. R. Spieksma. A branch-and-bound algorithm for the two-dimensional vector packing problem
27 -- 37Vincent A. Barker, Bo Friis Nielsen. Using program package NSPCG to analyze the trunk reservation service protection method
39 -- 56Amiya K. Chakravarty, Sanjoy Ghose. Strategic underproduction with product switching
57 -- 65Joanna M. Leleno. Adjustment process-based approach for computing a Nash-Cournot equilibrium
67 -- 78Hyo-Seong Lee, Sang-Kuk Kim. Optimal dispatching of an infinite capacity shuttle with compound poisson arrivals: Control at a single terminal
79 -- 99Ross A. Gerrard, Richard L. Church. Analyzing tradeoffs between zonal constraints and accessibility in facility location
101 -- 111Steven E. Butt, Tom M. Cavalier. A heuristic for the multiple tour maximum collection problem