Computers & Operations Research, Volume 25

Volume 25, Number 1, January 1998

• Bert De Reyck, Willy Herroelen:
  An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. 1-17
  
• James R. Soltys, James P. Ignizio:
  Boundary search procedure for the design and training of an ontogenic neural network classifier. 19-29
  
• Alexander Tuzikov, Mikhail Makhaniok, Reinhard Männer:
  Bicriterion scheduling of identical processing time jobs by uniform processors. 31-35
  
• Víctor Parada, Mauricio Sepúlveda, Mauricio Solar, Arlindo Gómes:
  Solution for the constrained guillotine cutting problem by simulated annealing. 37-47
  
• Kun-Jen Chung:
  A theorem on the determination of economic order quantity under conditions of permissible delay in payments. 49-52
  
• Konstantin Kogan, Eugene Levner:
  A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots. 53-62
  
• Lakdere Benkherouf:
  Note on a deterministic lot-size inventory model for deteriorating items with shortages and a declining market. 63-65
  
• Frederico R. B. Cruz, James MacGregor Smith, Geraldo Robson Mateus:
  Solving to optimality the uncapacitated fixed-charge network flow problem. 67-81
  

Volume 25, Number 2, February 1998

• Christos Koulamas:
  A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem. 83-89
  
• Shigeru Tsubakitani, James R. Evans:
  Optimizing tabu list size for the traveling salesman problem. 91-97
  
• Yong Ju Kim, Yeo Keun Kim, Yongkyun Cho:
  A heuristic-based genetic algorithm for workload smoothing in assembly lines. 99-111
  
• Ho Woo Lee, Boo Yong Ahn:
  A queueing model for optimal control of partial buffer sharing in ATM. 113-126
  
• David Wright:
  Analysis of the market for access to broadband telecommunications in the year 2000. 127-138
  
• Adli Mustafa, Mark Goh:
  Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS. 139-157
  
• Qidong Cao, Mark A. McKnew:
  Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems. 159-168
  

Volume 25, Number 3, March 1998

• James A. Chismant:
  Using discrete simulation modeling to study large-scale system reliability/availability. 169-174
  
• Hoon-Shik Woo, Dong-Soon Yim:
  A heuristic algorithm for mean flowtime objective in flowshop scheduling. 175-182
  
• Tayfur Alfok, C. Vu Duy, Melike Baykal-Gursoy:
  Two load sharing processors with failures. 183-189
  
• Ho Woo Lee, J. G. Park, B. K. Kim, Seung Hyun Yoon, Boo Yong Ahn, No Ik Park:
  Queue length and waiting time analysis of a batch arrival queue with bilevel control. 191-205
  
• Moon-Won Park, Yeong-Dae Kim:
  A systematic procedure for setting parameters in simulated annealing algorithms. 207-217
  
• Sehun Kim, Jaehyun Yeo:
  Optimal scheduling in cdma packet radio networks. 219-228
  
• Gengui Zhou, Mitsuo Gen:
  An effective genetic algorithm approach to the quadratic minimum spanning tree problem. 229-237
  
• A. J. Orman, A. K. Shahani, A. R. Moore:
  Modelling for the control of a complex radar system. 239-249
  

Volume 25, Number 4, April 1998

• Ina S. Markham, Terry R. Rakes:
  The effect of sample size and variability of data on the comparative performance of artificial neural networks and regression. 251-263
  
• M. Selim Akturk, M. Bayram Yildirim:
  A new lower bounding scheme for the total weighted tardiness problem. 265-278
  
• Willy Herroelen, Bert De Reyck, Erik Demeulemeester:
  Resource-constrained project scheduling: A survey of recent developments. 279-302
  
• Masood A. Badri, Donald L. Davis, Donna F. Davis, John Hollingsworth:
  A multi-objective course scheduling model: Combining faculty preferences for courses and times. 303-316
  
• Kemal Altinkemer, Indranil Bose, Raktim Pal:
  Average waiting time of customers in an M/D/k queue with nonpreemptive priorities. 317-328
  
• Lawrence M. Seiford, Joe Zhu:
  An acceptance system decision rule with data envelopment analysis. 329-332
  
• Chih-Hang Wu, Jose A. Ventura, Sharon Browning:
  Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. 333-349
  

Volume 25, Number 5, May 1998

• Roger Z. Ríos-Mercado, Jonathan F. Bard:
  Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. 351-366
  
• Wai-Ki Ching:
  An inventory model for manufacturing systems with delivery time guarantees. 367-377
  
• Lioubov Dombrovskaia, Patricio Rodríguez, Miguel Nussbaum:
  Knowledge-based language for modeling linear programming problems. 379-388
  
• Lawrence M. Seiford, Joe Zhu:
  On piecewise loglinear frontiers and log efficiency measures. 389-395
  
• Eleni Pratsini:
  Learning complementarity and setup time reduction. 397-405
  
• Patricio Rodríguez, Miguel Nussbaum, Rodrigo Baeza, Gerardo León, Marcos Sepúlveda, Agustín Cobián:
  Using global search heuristics for the capacity vehicle routing problem. 407-417
  

Volume 25, Number 6, June 1998

• Guisseppi A. Forgionne:
  Delivering complex decision rules to top level managers through decision support systems: a case study in army housing management. 419-429
  
• Mak A. Kaboudan:
  A dynamic-server queuing simulation. 431-439
  
• Angelo Monfroglio:
  Hybrid heuristic algorithms for set covering. 441-455
  
• Yu Gang, Yang Jian:
  On the robust shortest path problem. 457-468
  
• Reinaldo Morabito, Valdir Garcia:
  The cutting stock problem in a hardboard industry: a case study. 469-485
  
• Hor Chan Gin, Ung Choo Eng:
  Extensions of simple eyeballing dynamic lot sizing heuristics. 487-497
  
• Martine Labbé, Gilbert Laporte, Patrick Soriano:
  Covering a graph with cycles. 499-504
  
• Hsiao-Fan Wang, Yi-Chun Liao:
  A hybrid approach to resolving a differentiable integer program. 505-517
  

Volume 25, Numbers 7-8, July 1998

• Chih-Chien Tu, Hsuanjen Cheng:
  Spectral methods for graph bisection problems. 519-530
  
• Shirish S. Joshi, Hanif D. Sherali, Jeffrey D. Tew:
  An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. 531-541
  
• C. J. Willits, D. C. Dietz:
  Rapid, efficient analysis of the lambda(n)/C_k/r/N queue, with application to decomposition of closed queuing networks. 543-556
  
• Vaidyanathan Jayaraman, Rajesh Srivastava, W. C. Benton:
  A joint optimization of product variety and ordering approach. 557-566
  
• J. E. Beasley, B. Cao:
  A dynamic programming based algorithm for the crew scheduling problem. 567-582
  
• Jasmit Singh Kochhar, Bryce T. Foster, Sunderesh S. Heragu:
  Hope: A genetic algorithm for the unequal area facility layout problem. 583-594
  
• Chae Y. Lee, Seok Joo Koh:
  A design of self-healing ATM networks based on backup virtual paths. 595-609
  
• Natalie C. Simpson, S. Selçuk Erengüç:
  Improved heuristic methods for multiple stage production planning. 611-623
  
• Maria Teresa Almeida, Mário Centeno:
  A composite heuristic for the single machine early/tardy job scheduling problem. 625-635
  
• Jonathan M. Thompson, Kathryn A. Dowsland:
  A robust simulated annealing based examination timetabling system. 637-648
  
• T. Chakrabarty, Bibhas Chandra Giri, K. S. Chaudhuri:
  An EOQ model for items with weibull distribution deterioration, shortages and trended demand: an extension of philip's model. 649-657
  
• Renata Mansini, Maria Grazia Speranza:
  A linear programming model for the separate refuse collection service. 659-673
  
• Ju Hyun Chul, Kim Yeongho, Keun Kim Yeo:
  A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. 675-690
  

Volume 25, Number 9, September 1998

• Amit Monga, J. Zuo Ming:
  Optimal system design considering maintenance and warranty. 691-705
  
• Martin J. Fischer, Carl M. Harris:
  Approximating by enhanced interpolation in queueing analyses. 707-717
  
• K. Cheng Hsing, Marshall L. Freimer, William B. Richmond, Ushio Sumita:
  Optimal repair of degrading computers under asymmetric information and incentive incompatibility. 719-728
  
• Mauro Dell'Amico, Francesco Maffioli, Marco Trubian:
  New bounds for optimum traffic assignment in satellite communication. 729-743
  
• S. Mathies, P. Mevert:
  A hybrid algorithm for solving network flow problems with side constraints. 745-756
  
• Tariq A. Aldowaisan, Ali Allahverdi:
  Total flowtime in no-wait flowshops with separated setup times. 757-765
  
• Jiye Han, Jianjun Wen, Guochuan Zhang:
  A new approximation algorithm for UET-Scheduling with chain-type precedence constraints. 767-771
  
• Ho-Won Jung:
  A computing power allocation model in distributed database systems. 773-780
  
• Lea Friedman, Zilla Sinuany-Stern:
  Combining ranking scales and selecting variables in the DEA context: the case of industrial branches. 781-791
  

Volume 25, Number 10, October 1998

• Yen-Liang Chen, Kwei Tang:
  Minimum time paths in a network with mixed time constraints. 793-805
  
• Kao Chiang:
  Performance of several nonlinear programming software packages on microcomputers. 807-816
  
• Peter Chu, Kun-Jen Chung, Shaw-Ping Lan:
  Economic order quantity of deteriorating items under permissible delay in payments. 817-824
  
• Harvey H. Millar:
  The impact of rolling horizon planning on the cost of industrial fishing activity. 825-837
  
• L. Anand, Debasish Ghose, V. Mani:
  Probabilistic load scheduling with priorities in distributed computing systems. 839-856
  
• Oded Berman, Michal Cutler:
  Optimal software implementation considering reliability and cost. 857-868
  
• Hasan Pirkul, Vaidyanathan Jayaraman:
  A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. 869-878
  

Volume 25, Number 11, 1 November 1998

• Wen Lea Pearn, R. C. Chien:
  Improved solutions for the traveling purchaser problem. 879-885
  
• Sydney C. K. Chu, Edmond C. H. Chan:
  Crew scheduling of light rail transit in Hong Kong: from modeling to implementation. 887-894
  
• Sonja Novkovic, Davor Sverko:
  The minimal deceptive problem revisited: The role of "genetic waste". 895-911
  
• Hesham K. Alfares:
  An efficient two-phase algorithm for cyclic days-off scheduling. 913-923
  
• Mhand Hifi:
  Exact algorithms for the guillotine strip cutting/packing problem. 925-940
  
• Aliakbar Montazer-Haghighi:
  An analysis of the number of tasks in a parallel multi-processor system with task-splitting and feedback. 941-956
  
• G. V. Krishna Reddy, R. Nadarajan, R. Arumuganathan:
  Analysis of a bulk queue with N-policy multiple vacations and setup times. 957-967
  
• Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra:
  A local search template. 969-979
  
• William G. Bistline Sr., Snehamay Banerjee, Avijit Banerjee:
  RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. 981-995
  
• A. K. Bhunia, M. Maiti:
  Deterministic inventory model for deteriorating items with finite rate of replenishment dependent on inventory level. 997-1006
  
• Ilkyeong Moon, Sangjin Choi:
  A note on lead time and distributional assumptions in continuous review inventory models. 1007-1012
  

Volume 25, Number 12, December 1998

• Gautam Choudhury:
  On a batch arrival poisson queue with a random setup time and vacation period. 1013-1026
  
• Yi-Feng Hung, Yi-Cheng Hu:
  Solving mixed integer programming production planning problems with setups by shadow price information. 1027-1042
  
• Blas Pelegrín, Pascual Fernández:
  On the sum-max bicriterion path problem. 1043-1054
  
• George A. Vouros, H. T. Papadopoulos:
  Buffer allocation in unreliable production lines using a knowledge based system. 1055-1067
  
• Deborah Koucky Radasch, N. K. Kwak:
  An integrated mathematical programming model for offset planning. 1069-1083
  
• T. K. Roy, M. Maiti:
  Multi-objective inventory models of deteriorating items with some constraints in a fuzzy environment. 1085-1095
  
• Pedro Fernández de Córdoba, L. M. García Raffi, J. M. Sanchis:
  A heuristic algorithm based on Monte Carlo methods for the rural postman problem. 1097-1106
  
• Elise Miller-Hooks, Hani S. Mahmassani:
  Least possible time paths in stochastic, time-varying networks. 1107-1125
  
• Chen Xiong, Wan Weishui, Xu Xinhe:
  Modeling rolling batch planning as vehicle routing problem with time windows. 1127-1136
  
• Han-Lin Li:
  Solve least absolute value regression problems using modified goal programming techniques. 1137-1143
  
• John G. Klincewicz, Hanan Luss, Dicky C. K. Yan:
  Designing tributary networks with multiple ring families. 1145-1157
  
• G. V. Krishna Reddy, R. Anitha:
  Markovian bulk service queue with delayed vacations. 1159-1166
  

Last update Sat May 25 19:53:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page