Volume 28, Number 1, January 2000

• 
  Jeffery K. Cochran, Arvindh Murugan, Vijayalakshmi Krishnamurthy: Generic Markov models for availability estimation and failure characterization in petroleum refineries. 1-12
• 
  Guisseppi A. Forgionne: Determining the financial feasibility of privatized military housing initiatives with DSS-delivered quantitative models. 13-32
• 
  Francesca Fumero: A modified subgradient algorithm for Lagrangean relaxation. 33-52
• 
  Prakash L. Abad: Optimal price and order size for a reseller under partial backordering. 53-65
• 
  Kun-Jen Chung, Chuan-Neng Lin: Optimal inventory replenishment models for deteriorating items taking account of time discounting. 67-83
• 
  Sharmila Shah, John E. Mitchell, Michael Kupferschmid: An ellipsoid algorithm for equality-constrained nonlinear programs. 85-92

Volume 28, Number 2, February 2001

• 
  Chi Chiang: A note on optimal policies for a periodic inventory system with emergency orders. 93-103
• 
  James R. Swisher, Sheldon H. Jacobson, J. Brian Jun, Osman Balci: Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation. 105-125
• 
  Scott Webster, Meral Azizoglu: Dynamic programming algorithms for scheduling parallel machines with family setup times. 127-137
• 
  Antonio Sedeño-Noda, Carlos González-Martín: An algorithm for the biobjective integer minimum cost flow problem. 139-156
• 
  Wing-Kwan Yeung, Ceyda Oguz, T. C. Edwin Cheng: Single-machine scheduling with a common due window. 157-175
• 
  Wei-Chang Yeh: Search for MC in modified networks. 177-184
• 
  W. J. Hurley: The analytic hierarchy process: a note on an approach to sensitivity which preserves rank order. 185-188
• 
  Arie Tamir: Emanuel Melachrinoudis and Frank GuangSheng Zhang, "An O(mn) algorithm for the 1-maximin problem on a network". Computers and Operations Research 26 (1999) 849-869. 189
• 
  Gone Awry: A note from the editor. 191

Volume 28, Number 3, March 2001

• 
  Marcos Singer: Decomposition methods for large job shops. 193-207
• 
  Gianfranco Corradi: Higher-order derivatives in linear and quadratic programming. 209-222
• 
  J. Leon Zhao, Hsing Kenneth Cheng: Graph indexing for spatial data traversal in road map databases. 223-241
• 
  E. Mijangos, Narcís Nabona: On the first-order estimation of multipliers from Kuhn-Tucker systems. 243-270
• 
  Julia A. Bennell, Kathryn A. Dowsland, William B. Dowsland: The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. 271-287

Volume 28, Number 4, April 2001

• 
  Alex Van Breedam: Comparing descent heuristics and metaheuristics for the vehicle routing problem. 289-315
• 
  Micha Mandel, Gur Mosheiov: Minimizing maximum earliness on parallel identical machines. 317-327
• 
  Shine-Der Lee: On solving unreliable planar location problems. 329-344
• 
  Kun-Nyeong Chang, Dongwoo Kim: Optimal prioritized channel allocation in cellular mobile systems. 345-356
• 
  B. P. M. Duarte: The expected utility theory applied to an industrial decision problem - what technological alternative to implement to treat industrial solid residuals. 357-380
• 
  G. Peter Zhang, B. Eddy Patuwo, Michael Y. Hu: A simulation study of artificial neural networks for nonlinear time-series forecasting. 381-396

Volume 28, Number 5, April 2001

• 
  Yun Seong Eum, Kyung Sam Park, Soung Hie Kim: Establishing dominance and potential optimality in multi-criteria analysis with imprecise weight and value. 397-409
• 
  Cem Canel, Basheer M. Khumawala, Japhett Law, Anthony Loh: An algorithm for the capacitated, multi-commodity multi-period facility location problem. 411-427
• 
  Oded Berman, K. P. Sapna: Optimal control of service for facilities holding inventory. 429-441
• 
  I. M. Premachandra: An approximation of the activity duration distribution in PERT. 443-452
• 
  S. Kalpakam, S. Shanthi: A perishable inventory system with modified (S-1, S) policy and arbitrary processing times. 453-471
• 
  Mani K. Agrawal, Salah E. Elmaghraby: On computing the distribution function of the sum of independent random variables. 473-483
• 
  Jae Kyeong Kim, Sang Hyun Choi: A utility range-based interactive group support system for multiattribute decision making. 485-503

Volume 28, Number 6, May 2001

• 
  Jianzhong Zhang, Chao Yang, Yixun Lin: A class of bottleneck expansion problems. 505-519
• 
  Hong-fei Teng, Shou-lin Sun, De-quan Liu, Yan-zhao Li: Layout optimization for the objects located within a rotating vessel - a three-dimensional packing problem with behavioral constraints. 521-535
• 
  James E. Falk, Vladimir E. Karlov: Robust separation of finite sets via quadratics. 537-561
• 
  Tariq A. Aldowaisan: A new heuristic and dominance relations for no-wait flowshops with setups. 563-584
• 
  Ling Wang, Da-Zhong Zheng: An effective hybrid optimization strategy for job-shop scheduling problems. 585-596
• 
  Jaejin Jang, Jungdae Suh, C. Richard Liu: A new procedure to estimate waiting time in GI/G/2 system by server observation. 597-611

Volume 28, Number 7, June 2001

• 
  Bertrand M. T. Lin, T. C. Edwin Cheng: Batch scheduling in the no-wait two-machine flowshop to minimize the makespan. 613-624
• 
  Min-Sheng Lin, Ming-Sang Chang, Deng-Jyi Chen, Kuo-Lung Ku: The distributed program reliability analysis on ring-type topologies. 625-635
• 
  Sheng-Pen Wang: Shape-preserving computation in economic growth models. 637-647
• 
  Sakib A. Mondal, Anup K. Sen: Single machine weighted earliness-tardiness penalty problem with a common due date. 649-669
• 
  Herbert Dawid, Johannes König, Christine Strauss: An enhanced rostering model for airline crews. 671-688
• 
  Christos Koulamas, George J. Kyparisis: The three-stage assembly flowshop scheduling problem. 689-704
• 
  Jatinder N. D. Gupta, Johnny C. Ho: Minimizing makespan subject to minimum flowtime on two identical parallel machines. 705-717

Volume 28, Number 8, July 2001

• 
  Gur Mosheiov: A common due-date assignment problem on parallel identical machines. 719-732
• 
  Chiun-Ming Liu: Primal-dual methods for sustainable harvest scheduling problems. 733-749
• 
  Chia-Shin Chung, James Flynn: A newsboy problem with reactive production. 751-765
• 
  Cüneyt F. Bazlamaçci, Khalil S. Hindi: Minimum-weight spanning tree algorithms A survey and empirical study. 767-785
• 
  Dirk Biskup, Martin Feldmann: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. 787-801
• 
  Yupo Chan, William B. Carter, Michael D. Burnes: A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. 803-826
• 
  Jacinto González-Pachón, Carlos Romero: Aggregation of partial ordinal rankings: an interval goal programming approach. 827-834

Volume 28, Number 9, August 2001

• 
  In Lee: Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs. 835-852
• 
  M. I. Vidalis, H. T. Papadopoulos: A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks. 853-883
• 
  Veronique Inghelbrecht, Bart Steyaert, Herwig Bruneel, Sabine Wittevrongel: Buffer contents and cell delay in a rate adaptation buffer with Markovian arrivals. 885-898
• 
  N. C. Simpson: Questioning the relative virtues of dynamic lot sizing rules. 899-914
• 
  Kun-Jen Chung, Sui-Fu Tsai: Inventory systems for deteriorating items with shortages and a linear trend in demand-taking account of time value. 915-934

Volume 28, Number 10, September 2001

• 
  Ching-Wu Chu, B. Eddy Patuwo, Abraham Mehrez, Gadi Rabinowitz: A dynamic two-segment partial backorder control of (r, Q) inventory system. 935-953
• 
  Shengxiang Yang, Dingwei Wang: A new adaptive neural network and heuristics hybrid approach for job-shop scheduling. 955-971
• 
  A. Krishnamoorthy, P. V. Ushakumari: k-out-of-n: G system with repair: the D-policy. 973-981
• 
  Peter Preston, Erhan Kozan: An approach to determine storage locations of containers at seaport terminals. 983-995
• 
  Toshitsugu Otake, K. Jo Min: Inventory and investment in quality improvement under return on investment maximization. 997-1012
• 
  Lawrence David Drees, Wilbert E. Wilhelm: Scheduling experiments on a nuclear reactor using mixed integer programming. 1013-1037
• 
  Andrew J. Higgins: A dynamic tabu search for large-scale generalised assignment problems. 1039-1048

Volume 28, Number 11, September 2001

• 
  Hanif D. Sherali, Burak Özdaryal, Warren P. Adams, Naguib Attia: On using exterior penalty approaches for solving linear programming problems. 1049-1074
• 
  Jacques A. Ferland, Soumia Ichoua, Alain Lavoie, Éric Gagné: Scheduling using tabu search methods with intensification and diversification. 1075-1092
• 
  Chih-Hsiung Wang, Shey-Huei Sheu: Simultaneous determination of the optimal production-inventory and product inspection policies for a deteriorating production system. 1093-1110
• 
  Jason Chao-Hsien Pan, Jen-Shiang Chen, Hung-Liang Cheng: A heuristic approach for single-machine scheduling with due dates and class setups. 1111-1130
• 
  (paper retracted).
• 
  K. F. Lam, H. W. Mui, H. K. Yuen: A note on minimizing absolute percentage error in combined forecasts. 1141-1147

Volume 28, Number 12, October 2001

• 
  Roman Novak, Joze Rugelj, Gorazd Kandus: A note on distributed multicast routing in point-to-point networks. 1149-1164
• 
  Jamal Ouenniche, Fayez F. Boctor: The multi-product, economic lot-sizing problem in flow shops: the powers-of-two heuristic. 1165-1182
• 
  Guoqiang Peter Zhang: An investigation of neural networks for linear time-series forecasting. 1183-1202
• 
  S. Kar, A. K. Bhunia, M. Maiti: Inventory of multi-deteriorating items sold from two shops under single management with constraints on space and investment. 1203-1221
• 
  Umar Al-Turki, C. Fedjki, Abdulbasit Andijani: Tabu search for a class of single-machine scheduling problems. 1223-1230
• 
  Raymond L. Major, Cliff T. Ragsdale: Aggregating expert predictions in a networked environment. 1231-1244
• 
  Han-Lin Li, Jung-Fa Tsai: A fast algorithm for assortment optimization problems. 1245-1252

Volume 28, Number 13, November 2001

• 
  Ingo Hofacker, Rudolf Vetschera: Algorithmical approaches to business process design. 1253-1275
• 
  Yi-Kuei Lin: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. 1277-1285
• 
  Rafael Martí, Vicente Estruch: Incremental bipartite drawing problem. 1287-1298
• 
  Dieter Fiems, Bart Steyaert, Herwig Bruneel: Performance evaluation of CAI and RAI transmission modes in a GI-G-1 queue. 1299-1313
• 
  S. Kar, A. K. Bhunia, M. Maiti: Deterministic inventory model with two levels of storage, a linear trend in demand and a fixed time horizon. 1315-1331
• 
  Stan Lipovetsky, W. Michael Conklin: Multiobjective regression modifications for collinearity. 1333-1345
• 
  Hong Suk Choi, Heesoo Lee, Ki-Dong Lee, Sehun Kim, Jong Hyup Lee: Optimal locations of switches and interconnections for ATM LANs. 1347-1366

Volume 28, Number 14, December 2001

• 
  Young H. Chun: Optimal partitioning of groups in selecting the best choice. 1367-1386
• 
  M. Reza Zamani: A high-performance exact method for the resource-constrained project scheduling problem. 1387-1401
• 
  Adil Baykasoglu, Nabil N. Z. Gindy: A simulated annealing algorithm for dynamic layout problem. 1403-1426
• 
  Eiji Takeda: A method for multiple pseudo-criteria decision problems. 1427-1439
• 
  Ming-Jong Yao: The peak load minimization problem in cyclic production. 1441-1460

last updated on Thu May 23 04:01:30 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page