Computers & Operations Research, Volume 24

Volume 24, Number 1, January 1997

• Rainer Leisten:
  A posteriori error bounds in linear programming aggregation. 1-16
  
• P. C. Chu, J. E. Beasley:
  A genetic algorithm for the generalised assignment problem. 17-23
  
• Rex K. Kincaid:
  A molecular structure matching problem. 25-35
  
• V. Daniel R. Guide Jr., Rajesh Srivastava:
  An evaluation of order release strategies in a remanufacturing environment. 37-47
  
• Ali Amiri:
  Solution procedures for the service system design problem. 49-60
  
• Faruk Güder, James L. Zydiak:
  Non-stationary ordering policies for multi-item inventory systems subject to a single resource constraint and quantity discounts. 61-71
  
• Zhimin Huang:
  Bargaining, risk and franchising coordination. 73-83
  
• Amy Zhaohui Zeng, Tianming Zhang:
  A queuing model for designing an optimal three-dimensional maintenance float system. 85-95
  

Volume 24, Number 2, February 1997

• Rasaratnam Logendran, Parthasarathi Ramakrishna:
  A methodology for simultaneously dealing with machine duplication and part subcontracting in cellular manufacturing systems. 97-116
  
• Zilla Sinuany-Stern, Israel David, Sigal Biran:
  An efficient heuristic for a partially observable Markov decision process of machine replacement. 117-126
  
• Alan T. Murray, Richard L. Church:
  Solving the anti-covering location problem using Lagrangian relaxation. 127-140
  
• Jay B. Ghosh:
  Job selection in a heavily loaded shop. 141-145
  
• Tsiushuang Chen, Xiangtong Qi, Fengsheng Tu:
  Single machine scheduling to minimize weighted earliness subject to maximum tardiness. 147-152
  
• Andrew Mason, Mikael Rönnqvist:
  Solution methods for the balancing of jet turbines. 153-167
  
• Ching-Jong Liao, Li-Man Liao:
  Single facility scheduling with major and minor setups. 169-178
  
• Constantine Loucopoulos, Robert Pavur:
  Computational characteristics of a new mathematical programming model for the three-group discriminant problem. 179-191
  
• Chung-Hsing Yeh:
  A fast finite loading algorithm for job oriented scheduling. 193-198
  

Volume 24, Number 3, March 1997

• R. J. W. James:
  Using tabu search to solve the common due date early/tardy machine scheduling problem. 199-208
  
• Andrew J. Higgins, Erhan Kozan, Luis Ferreira:
  Modelling the number and location of sidings on a single line railway. 209-220
  
• Chae Y. Lee, Seon G. Chang:
  Balancing loads on sonet rings with integer demand splitting. 221-229
  
• Roger Grinde, Tom M. Cavalier:
  A new algorithm for the two-polygon containment problem. 231-251
  
• Chris Tofallis:
  Input efficiency profiling: An application to airlines. 253-258
  
• Yong Shi, Heeseok Lee:
  A binary integer linear program with multi-criteria and multi-constraint levels. 259-273
  
• Ali Amiri, Hasan Pirkul:
  Routing and capacity assignment in backbone communication networks. 275-287
  

Volume 24, Number 4, April 1997

• Rahul Simha, Amitava Majumdar:
  An urn model with applications to database performance evaluation. 289-300
  
• Huan Li, Yixin Zhu:
  M(n)/G/1/N queues with generalized vacations. 301-316
  
• Mohid Khalid, Prakash D. Vyavahare, Hemant B. Kekre:
  Analysis of an asymmetric polling system. 317-333
  
• Gündüz Ulusoy, Funda Sivrikaya-Serifoglu, Ümit Bilge:
  A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. 335-351
  
• Ami Arbel:
  An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points. 353-365
  
• A. M. Flitman:
  Towards analysing student failures: neural networks compared with regression analysis and multiple discriminant analysis. 367-377
  
• Gin Hor Chan:
  Eyeballing heuristics for dynamic lot sizing problems with rolling horizons. 379-385
  

Volume 24, Number 5, May 1997

• Y. Narahari, N. Hemachandra, M. S. Gaur:
  Transient analysis of multiclass manufacturing systems with priority scheduling. 387-398
  
• Darryn J. Reid:
  Enhanced genetic operators for the resolution of discrete constrained optimization problems. 399-411
  
• Jiafu Tang, Dingwei Wang:
  An interactive approach based on a genetic algorithm for a type of quadratic programming problems with fuzzy objective and resources. 413-422
  
• Bay Arinze, Seung-Lae Kim, Murugan Anandarajan:
  Combining and selecting forecasting models using rule based induction. 423-433
  
• Linda Salchenberger, Enrique R. Venta, Luz A. Venta:
  Using neural networks to aid the diagnosis of breast implant rupture. 435-444
  
• Bruce L. Golden, Gilbert Laporte, Éric D. Taillard:
  An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. 445-452
  
• Ajay Singh, J. MacGregor Smith:
  Buffer allocation for an integer nonlinear network design problem. 453-472
  
• Frank G. Landram, Bahram Alidaee:
  Computing orthogonal polynomials. 473-476
  
• Rudolf Vetschera:
  A recursive algorithm for volume-based sensitivity analysis of linear decision models. 477-491
  

Volume 24, Number 6, June 1997

• Jesus R. Artalejo:
  Analysis of an M/G/1 queue with constant repeated attempts and server vacations. 493-504
  
• Kwang Jae Kim, Hsien-Ruey Chen:
  A comparison of fuzzy and nonparametric linear regression. 505-519
  
• Joze Rugelj, Sandi Klavzar:
  Distributed multicast routing in point-to-point networks. 521-527
  
• Fikri Karaesmen, Surendra M. Gupta:
  Duality relations for queues with arrival and service control. 529-538
  
• Hark Hwang, Seong Whan Shinn:
  Retailer's pricing and lot sizing policy for exponentially deteriorating products under the condition of permissible delay in payments. 539-547
  
• Rajendra S. Solanki, Jyothi K. Gorti:
  Implementation of an integer optimization platform using object oriented programming. 549-557
  
• H. W. Lee, D. I. Chung, S. S. Lee, K. C. Chae:
  Server unavailability reduces mean waiting time in some batch service queuing systems. 559-567
  
• Soung Hie Kim, Byeong Seok Ahn, Sang Hyun Choi:
  An efficient force planning system using multi-objective linear goal programming. 569-580
  
• Nachimuthu Karunanithi, Tamra Carpenter:
  Sonet ring sizing with genetic algorithms. 581-591
  

Volume 24, Number 7, July 1997

• Kim Fung Lam, Jane W. Moy:
  An experimental comparison of some recently developed linear programming approaches to the discriminant problem. 593-599
  
• Norman D. Curet:
  Applying steepest-edge techniques to a network primal-dual algorithm. 601-609
  
• Shanling Li, Devanath Tirupati:
  Impact of product mix flexibility and allocation policies on technology. 611-626
  
• Armin Scholl, Robert Klein, Christian Jürgens:
  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. 627-645
  
• Z. Khan, B. Prasad, T. Singh:
  Machining condition optimization by genetic algorithms and simulated annealing. 647-657
  
• Alfredo Marín, Blas Pelegrín:
  A branch-and-bound algorithm for the transportation problem with location of p transshipment points. 659-678
  
• Anito Joseph, Noel Bryson:
  Partitioning of sequentially ordered systems using linear programming. 679-686
  
• Rajani R. Joshi:
  A new heuristic algorithm for probabilistic optimization. 687-697
  

Volume 24, Number 8, August 1997

• Brian Borchers, John E. Mitchell:
  A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs. 699-701
  
• P. Patrick Wang:
  Optimally scheduling N customer arrival times for a single-server system. 703-716
  
• Jiafu Tang, Dingwei Wang:
  A nonsymmetric model for fuzzy nonlinear programming problems with penalty coefficients. 717-725
  
• Mhand Hifi:
  An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock. 727-736
  
• Geon Cho, Dong X. Shaw, Seong-Lyun Kim:
  An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks. 737-748
  
• James S. Finan, William J. Hurley:
  The analytic hierarchy process: Does adjusting a pairwise comparison matrix to improve the consistency ratio help? 749-755
  
• Gerard J. Chang, Pei-Hsin Ho:
  The ß-assignment problem in general graphs. 757-765
  
• Ravinder Nath, Balaji Rajagopalan, Randy Ryker:
  Determining the saliency of input variables in neural network classifiers. 767-773
  
• Bahram Alidaee, Duane Rosa:
  Scheduling parallel machines to minimize total weighted and unweighted tardiness. 775-788
  
• Jennifer Xie, Martin J. Fischer, Carl M. Harris:
  Workload and waiting time in a fixed-time loop system. 789-803
  

Volume 24, Number 9, September 1997

• Luis C. Dias, João Paulo Costa, João C. N. Clímaco:
  Conflicting criteria, cooperating processors - some experiments on implementing a multicriteria decision support method on a parallel computer. 805-817
  
• Hsiao-Fan Wang, Ching-Chun Fu:
  A generalization of fuzzy goal programming with preemptive structure. 819-828
  
• Bernard Gendron, Teodor Gabriel Crainic:
  A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. 829-847
  
• Kun-Nyeong Chang, Sehun Kim:
  Channel allocation in cellular radio networks. 849-860
  
• Paulo M. França, Vinícius Amaral Armentano, Regina Berretta, Alistair Richard Clark:
  A heuristic method for lot-sizing in multi-stage systems. 861-874
  
• Liang-Yuh Ouyang, Kun-Shan Wu:
  Mixture inventory model involving variable lead time with a service level constraint. 875-882
  
• Chae Y. Lee, Seok Joo Koh:
  A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach. 883-897
  

Volume 24, Number 10, October 1997

• Chiang Kao, H. C. Tang:
  Systematic searches for good multiple recursive random number generators. 899-905
  
• John T. Buchanan, James Corner:
  The effects of anchoring in interactive MCDM solution methods. 907-918
  
• Susan X. Li:
  Transaction-efficiency analysis of franchising arrangements through chance cross-constrained game theory. 919-935
  
• Liang-Hsuan Chen:
  Designing robust products with multiple quality characteristics. 937-944
  
• Miro Gradisar, Joze Jesenko, Gortan Resinovic:
  Optimization of roll cutting in clothing industry. 945-953
  
• Ali Allahverdi:
  Scheduling in stochastic flowshops with independent setup, processing and removal times. 955-960
  
• Takeo Yamada, Mayumi Futakawa:
  Heuristic and reduction algorithms for the knapsack sharing problem. 961-967
  
• Gin Hor Chan, Kim Suan Chiu:
  A simple heuristic for multi-product dynamic lot sizing problems. 969-979
  
• Beyime Tachefine, François Soumis:
  Maximal closure on a graph with resource constraints. 981-990
  

Volume 24, Number 11, November 1997

• Kwun Ik Cho, Soung Hie Kim:
  An improved interactive hybrid method for the linear multi-objective knapsack problem. 991-1003
  
• Siddhartha S. Syam:
  A model for the capacitated p-facility location problem in global environments. 1005-1016
  
• Ping Ji, W. B. Lee, Hongyu Li:
  A new algorithm for the assignment problem: An alternative to the Hungarian method. 1017-1023
  
• Jatinder N. D. Gupta, Vitaly A. Strusevich, Carin M. Zwaneveld:
  Two-stage no-wait scheduling models with setup and removal times separated. 1025-1031
  
• Alok Aurovillian, Hong Zhang, Malgorzata M. Wiecek:
  A bookkeeping strategy for multiple objective linear programs. 1033-1041
  
• Meltem Denizel, S. Selçuk Erengüç:
  Exact solution procedures for certain planning problems in flexible manufacturing systems. 1043-1055
  
• Gilbert Laporte:
  Modeling and solving several classes of arc routing problems as traveling salesman problems. 1057-1061
  
• Paul A. Savory, Gerald T. Mackulak:
  An aggregation procedure for simulating manufacturing flow line models. 1063-1073
  
• Moncer Hariga, Ali Al-Alyan:
  A lot sizing heuristic for deteriorating items with shortages in growing and declining markets. 1075-1083
  
• Sungyeol Kang, Richard F. Serfozo:
  Maxima of sojourn times in acyclic Jackson queueing networks. 1085-1095
  
• Nenad Mladenovic, Pierre Hansen:
  Variable neighborhood search. 1097-1100
  

Volume 24, Number 12, December 1997

• Soung Hie Kim, Byeong Seok Ahn:
  Group decision making procedure considering preference strength under incomplete information. 1101-1112
  
• Sun Hur:
  A note on varying the number of states in the arrival process of MR/GI/1 queue. 1113-1118
  
• D. K. Manna, V. Rajendra Prasad:
  Pseudopolynomial algorithms for CTV minimization in single machine scheduling. 1119-1128
  
• Charles M. Macal, Arthur P. Hurter:
  Dependence of bilevel mathematical programs on irrelevant constraints. 1129-1140
  
• Parag C. Pendharkar:
  A fuzzy linear programming model for production planning in coal mines. 1141-1149
  
• Erik W. Dravnieks, John W. Chinneck:
  Formulation assistance for global optimization problems. 1151-1168
  
• Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng:
  Two-stage flowshop scheduling with a common second-stage machine. 1169-1174
  
• Manuel Laguna, Rafael Martí, Vicente Valls:
  Arc crossing minimization in hierarchical digraphs with tabu search. 1175-1186
  
• Linet Özdamar, Hakan Dündar:
  A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows. 1187-1200
  

Last update Thu May 23 18:30:56 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page