Volume 31, Number 1, January 2004

• 
  John M. Mulvey, Bala Shetty: Financial planning via multi-stage stochastic optimization. 1-20
• 
  Dong Cao, Mingyuan Chen: Using penalty function and Tabu search to solve cell formation problems with fixed cell cost. 21-37
• 
  Giovanni Celano, Antonio Costa, Sergio Fichera, Giovanni Perrone: Human factor policy testing in the sequencing of manual mixed model assembly lines. 39-59
• 
  Xian Liu, Wilsun Xu: A new filled function applied to global optimization. 61-80
• 
  Peixia Gao, Sabine Wittevrongel, Herwig Bruneel: Discrete-time multiserver queues with geometric service times. 81-99
• 
  Marcelo Gomes de Queiroz, Carlos Humes Jr., Joaquim Júdice: On finding global optima for the hinge fitting problem. 101-122
• 
  Duncan K. H. Fong, Haizhen Fu, Zhaolin Li: Efficiency in shortage reduction when using a more expensive common component. 123-138
• 
  A. Teeninga, A. Volgenant: Improved heuristics for the traveling purchaser problem. 139-150
• 
  Abraham P. Punnen: On bottleneck assignment problems under categorization. 151-154
• 
  Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco: Erratum to "An interactive procedure dedicated to a bicriteria plant location model": [Computers & Operations Research 30 (2003) 1977-2002]. 155

Volume 31, Number 2, February 2004

• 
  Ali Allahverdi: A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. 157-180
• 
  Eugenio Mijangos: An implementation of Newton-like methods on nonlinearly constrained networks. 181-199
• 
  Oded Berman, Richard C. Larson: A queueing control model for retail services having back room operations and cross-trained workers. 201-222
• 
  Zaid T. Balkhi, Lakdere Benkherouf: On an inventory model for deteriorating items with stock dependent and time-varying demand rates. 223-240
• 
  Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma: Branch and peg algorithms for the simple plant location problem. 241-255
• 
  Yuri Levin, Adi Ben-Israel: A heuristic method for large-scale multi-facility location problems. 257-272
• 
  Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd: Towards the real time solution of strike force asset allocation problems. 273-291
• 
  L. Mikhailov: Group prioritization in the AHP by fuzzy preference programming method. 293-301
• 
  Saul I. Gass, Sasirekha Vinjamuri: Cycling in linear programming problems. 303-311
• 
  Adil Baykasoglu, Nabil N. Z. Gindy: Erratum to "A simulated annealing algorithm for dynamic layout problem": [Computers & Operations Research 28 (2001) 1367-1460]. 313-315

Volume 31, Number 3, March 2004

• 
  Volker Lauff, Frank Werner: On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties. 317-345
• 
  Michel Gendreau, Gilbert Laporte, Frédéric Semet: Heuristics and lower bounds for the bin packing problem with conflicts. 347-358
• 
  Thomas Yew Sing Lee: The effect of workers with different capabilities on customer delay. 359-381
• 
  Herminia I. Calvete: The quickest path problem with interval lead times. 383-395
• 
  Ümit Bilge, Furkan Kiraç, Müjde Kurtulan, Pelin Pekgün: A tabu search algorithm for parallel machine total tardiness problem. 397-414
• 
  C. J. Liao, W. J. Chen: Scheduling under machine breakdown in a continuous process industry. 415-428
• 
  Konstantin Kogan: Scheduling parallel machines by the dynamic newsboy problem. 429-443
• 
  James V. Hansen: Genetic search methods in air traffic control. 445-459
• 
  Belén Melián-Batista, Manuel Laguna, José A. Moreno-Pérez: Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis. 461-472
• 
  Motty Birman, Gur Mosheiov: A note on a due-date assignment on a two-machine flow-shop. 473-480

Volume 31, Number 4, April 2004

• 
  Parag C. Pendharkar, James A. Rodger: An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification. 481-498
• 
  Yen-Liang Chen, Hsu-Hao Yang: Finding the first K shortest paths in a time-window network. 499-513
• 
  Enrique Ballestero, José Alberto Maldonado: Objective measurement of efficiency: applying single price model to rank hospital activities. 515-532
• 
  Mayur Vamanan, Qian Wang, Rajan Batta, Robert J. Szczerba: Integration of COTS software products ARENA & CPLEX for an inventory/logistics problem. 533-547
• 
  Bor-Ren Chuang, Liang-Yuh Ouyang, Kai-Wayne Chuang: A note on periodic review inventory model with controllable setup cost and lead time. 549-561
• 
  Marc Reimann, Karl Doerner, Richard F. Hartl: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. 563-591
• 
  Srikanth K. Iyer, Barkha Saxena: Improved genetic algorithm for the permutation flowshop scheduling problem. 593-606
• 
  Alan Jessop: Sensitivity and robustness in selection problems. 607-622
• 
  Elizabeth M. Jewkes, Chulung Lee, Raymond G. Vickson: Product location, allocation and server home base location for an order picking line with multiple servers. 623-636
• 
  Saul I. Gass, Christoph Witzgall: On an approximate minimax circle closest to a set of points. 637-643

Volume 31, Number 5, April 2004

• 
  Gur Mosheiov, Daniel Oron: A note on the SPT heuristic for solving scheduling problems with generalized due dates. 645-655
• 
  Mhand Hifi: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. 657-674
• 
  Mhand Hifi, Rym M'Hallah: Approximate algorithms for constrained circular cutting problems. 675-694
• 
  George Kozanidis, Emanuel Melachrinoudis: A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints. 695-711
• 
  Miroslaw Kwiesielewicz, Ewa van Uden: Inconsistent and contradictory judgements in pairwise comparison method in the AHP. 713-719
• 
  Michel Denault, Jean-Louis Goffin: Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach. 721-743
• 
  So Young Sohn, Ki Yeol Oh: Simulation study for the optimal repair capacity of an IT maintenance center based on LRD failure distribution. 745-759
• 
  Uwe Aickelin, Kathryn A. Dowsland: An indirect Genetic Algorithm for a nurse-scheduling problem. 761-778
• 
  Cyril Duron, Jean-Marie Proth: Insertion of a random bitask in a schedule: a real-time approach. 779-790
• 
  Kuo-Ching Ying, Ching-Jong Liao: An ant colony system for permutation flow-shop sequencing. 791-801
• 
  Gholam R. Amin, Mehdi Toloo: A polynomial-time algorithm for finding epsilon in DEA models. 803-805

Volume 31, Number 6, May 2004

• 
  Juan A. Carrasco: Solving large interval availability models using a model transformation approach. 807-861
• 
  Luiz Antonio Nogueira Lorena, Edson Luiz França Senne: A column generation approach to capacitated p-median problems. 863-876
• 
  Chang-Chun Lin, An-Pin Chen: Fuzzy discriminant analysis with outlier detection by genetic algorithm. 877-888
• 
  Matthew J. Liberatore, Robert L. Nydick: Wash criteria and the analytic hierarchy process. 889-892
• 
  Eng Ung Choo, William C. Wedley: A common framework for deriving preference values from pairwise comparison matrices. 893-908
• 
  Kun-Jen Chung, Jui-Jung Liao: Lot-sizing decisions under trade credit depending on the ordering quantity. 909-928
• 
  Kuo-Ping Chang: Evaluating mutual fund performance: an application of minimum convex input requirement set approach. 929-940
• 
  Edgar K. Rugenstein, Michael Kupferschmid: Active set strategies in an ellipsoid algorithm for nonlinear programming. 941-962
• 
  Yongjian Li, Xiaoqiang Cai, Fengsheng Tu, Xiuli Shao: Optimization of tandem queue systems with finite buffers. 963-984

Volume 31, Number 7, June 2004

• 
  Dingfei Liu, Theodor J. Stewart: Object-oriented decision support system modelling for multicriteria decision making in natural resource management. 985-999
• 
  Wen Lea Pearn, Ying Chung Chang: Optimal management of the N-policy M/E_k/1 queuing system with a removable service station: a sensitivity investigation. 1001-1015
• 
  Kuang-Han Hsieh, Fang-Chih Tien: Self-organizing feature maps for solving location-allocation problems with rectilinear distances. 1017-1031
• 
  Jean-Yves Potvin, Patrick Soriano, Maxime Vallée: Generating trading rules on the stock markets with genetic programming. 1033-1047
• 
  An-Sing Chen, Mark T. Leung: Regression neural network for error correction in foreign exchange forecasting and trading. 1049-1068
• 
  Hsien-Chung Wu: Pricing European options based on the fuzzy pattern of Black-Scholes formula. 1069-1081
• 
  Les R. Foulds, John M. Wilson, Tadashi Yamaguchi: Modelling and solving central cycle problems with integer programming. 1083-1095
• 
  Toru Higuchi, Marvin D. Troutt: Dynamic simulation of the supply chain for a short life cycle product - Lessons from the Tamagotchi case. 1097-1114
• 
  Chae Y. Lee, Hee K. Cho: Multiple multicast tree allocation in IP network. 1115-1133
• 
  Yeu-Shiang Huang: A structural design of decision support systems for deteriorating repairable systems. 1135-1145
• 
  Madjid Tavana: A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making. 1147-1164

Volume 31, Number 8, July 2004

• 
  Kweku-Muata Osei-Bryson: Generating consistent subjective estimates of the magnitudes of causal relationships in fuzzy cognitive maps. 1165-1175
• 
  Jawad Abrache, Benoît Bourbeau, Teodor Gabriel Crainic, Michel Gendreau: A new bidding framework for combinatorial e-auctions. 1177-1203
• 
  Dragan Urosevic, Jack Brimberg, Nenad Mladenovic: Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. 1205-1213
• 
  Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza: An improved heuristic for the period traveling salesman problem. 1215-1222
• 
  M. Helena Correia, José F. Oliveira, J. Soeiro Ferreira: Reel and sheet cutting at a paper mill. 1223-1243
• 
  Wonjoon Choi, Robert H. Storer: Heuristic algorithms for a turbine-blade-balancing problem. 1245-1258
• 
  Yi-Chih Hsieh, Ta-Cheng Chen: Reliability lower bounds for two-dimensional consecutive-k-out-of-n: F systems. 1259-1272
• 
  Bibo Yang, Joseph Geunes, William J. O'Brien Jr.: A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling. 1273-1301
• 
  Dvir Shabtay: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. 1303-1315
• 
  Nashat Mansour, Hiba Tabbara, Tarek Dana: A genetic algorithm approach for regrouping service sites. 1317-1333
• 
  James Flynn, Chia-Shin Chung: A heuristic algorithm for determining replacement policies in consecutive k-out-of-n systems. 1335-1348
• 
  Ching-Fang Liaw: Scheduling two-machine preemptive open shops to minimize total completion time. 1349-1363

Volume 31, Number 9, August 2004

• 
  Herbert F. Lewis, Thomas R. Sexton: Network DEA: efficiency analysis of organizations with complex internal structure. 1365-1410
• 
  Yi Liao, Shu-Cherng Fang, Henry L. W. Nuttle: A neural network model with bounded-weights for pattern classification. 1411-1426
• 
  Morten Riis, Kim Allan Andersen: Multiperiod capacity expansion of a telecommunications connection with uncertain demand. 1427-1436
• 
  Francisco Aparisi, Juan Carlos García-Díaz: Optimization of univariate and multivariate exponentially weighted moving-average control charts using genetic algorithms. 1437-1454
• 
  Attahiru Sule Alfa, K. P. Sapna Isotupa: An M/PH/k retrial queue with finite number of sources. 1455-1464
• 
  Elliot Bendoly: Integrated inventory pooling for firms servicing both on-line and store demand. 1465-1480
• 
  Moshe Kaspi, Dvir Shabtay: Convex resource allocation for minimizing the makespan in a single machine with job release dates. 1481-1489
• 
  Rafael Martí, Abdellah El-Fallahi: Multilayer neural networks: an experimental evaluation of on-line training methods. 1491-1513
• 
  Orhan Karasakal, Esra Köktener Karasakal: A maximal covering location model in the presence of partial coverage. 1515-1526
• 
  So Young Sohn, Seung Hwan Lee: Sensitivity analysis for output performance measures in long-range dependent queueing system. 1527-1536
• 
  Ivan Atencia, Pilar Moreno: The discrete-time Geo/Geo/1 queue with negative customers and disasters. 1537-1548
• 
  Asad Tavakoli, Constance Lightner: Implementing a mathematical model for locating EMS vehicles in fayetteville, NC. 1549-1563

Volume 31, Number 10, September 2004

• 
  Klaus Jansen, Monaldo Mastrolilli: Approximation schemes for parallel machine scheduling problems with controllable processing times. 1565-1581
• 
  Malachy Carey, Mark McCartney: An exit-flow model used in dynamic traffic assignment. 1583-1602
• 
  Chih-Ping Chiang, Shine-Der Lee: Joint determination of machine cells and linear intercell layout. 1603-1619
• 
  Jinchang Wang, Thomas Kämpke: Shortest route computation in distributed systems. 1621-1633
• 
  Önder Tombus, Taner Bilgiç: A column generation approach to the coalition formation problem in multi-agent systems. 1635-1653
• 
  Chien-Hung Lin, Ching-Jong Liao: Makespan minimization subject to flowtime optimality on identical parallel machines. 1655-1666
• 
  Roberto Montemanni, Luca Maria Gambardella: An exact algorithm for the robust shortest path problem with interval data. 1667-1680
• 
  Lev V. Utkin: Reliability models of m-out-of-n systems under incomplete information. 1681-1702
• 
  Montaz M. Ali, Aimo A. Törn: Population set-based global optimization algorithms: some modifications and numerical studies. 1703-1725
• 
  Ghaith Rabadi, Mansooreh Mollaghasemi, Georgios C. Anagnostopoulos: A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. 1727-1751
• 
  Thomas J. Candalino Jr., John E. Kobza, Sheldon H. Jacobson: Designing optimal aviation baggage screening strategies using simulated annealing. 1753-1767

Volume 31, Number 11, September 2004

• 
  Steven Chamberland: An efficient heuristic for the expansion problem of cellular wireless networks. 1769-1791
• 
  K. Das, Tapan Kumar Roy, Manoranjan Maiti: Multi-item stochastic and fuzzy-stochastic inventory models under two restrictions. 1793-1806
• 
  Yeh Lam, Yuan Lin Zhang: A shock model for the maintenance problem of a repairable system. 1807-1820
• 
  Rafael Caballero, Mónica Hernández: The controlled estimation method in the multiobjective linear fractional problem. 1821-1832
• 
  Ossama Kettani, Belaïd Aouni, Jean-Marc Martel: The double role of the weight factor in the goal programming model. 1833-1845
• 
  Oded Berman, Michal Cutler: Resource allocation during tests for optimally reliable software. 1847-1865
• 
  Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan: Equal processing and equal setup time cases of scheduling parallel machines with a single server. 1867-1889
• 
  Józef Grabowski, Mieczyslaw Wodecki: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. 1891-1909
• 
  Anthony C. Keys, Loren Paul Rees: A sequential-design metamodeling strategy for simulation optimization. 1911-1932
• 
  Kweku-Muata Osei-Bryson: Evaluation of decision trees: a multi-criteria approach. 1933-1945

Volume 31, Number 12, October 2004

• 
  Sin C. Ho, Dag Haugland: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. 1947-1964
• 
  Tsan-Ming Choi, Duan Li, Houmin Yan: Optimal single ordering policy with multiple delivery modes and Bayesian information updates. 1965-1984
• 
  Christian Prins: A simple and effective evolutionary algorithm for the vehicle routing problem. 1985-2002
• 
  Huan Neng Chiu, Jen-Huei Chang, Chia-Hsin Lee: Lot streaming models with a limited number of capacitated transporters in multistage batch production systems. 2003-2020
• 
  Chih-Hsiung Wang: The impact of a free-repair warranty policy on EMQ model for imperfect production systems. 2021-2035
• 
  Jean Berger, Mohamed Barkaoui: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. 2037-2053
• 
  Hark-Chin Hwang, Soo Y. Chang, Kangbok Lee: Parallel machine scheduling under a grade of service provision. 2055-2061
• 
  Masao Yokoyama: Scheduling for two-stage production system with setup and assembly operations. 2063-2078
• 
  Hung-Chi Chang: An application of fuzzy sets theory to the EOQ model with imperfect quality items. 2079-2092
• 
  Wenqi Huang, Aihua Yin: An improved shifting bottleneck procedure for the job shop scheduling problem. 2093-2110
• 
  Parthasarati Dileepan: A note on minimizing maximum lateness in a two-machine no-wait flowshop. 2111-2115

Volume 31, Number 13, November 2004

• 
  Mohan L. Chaudhry, Jin D. Kim: Complete analytic and computational analyses of the discrete-time bulk-arrival infinite-server system: GI^X/Geom/. 2119-2135
• 
  Mohan L. Chaudhry, Umesh Chandra Gupta, Veena Goswami: On discrete-time multiserver queues with finite buffer: GI/Geom/m/N. 2137-2150
• 
  Maghsud Solimanpur, Prem Vrat, Ravi Shankar: A neuro-tabu search heuristic for the flow shop scheduling problem. 2151-2164
• 
  Xinjian Lu, Franklin Lowenthal: Arranging fact table records in a data warehouse to improve query performance. 2165-2182
• 
  Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso: A generalization of the scaling max-flow algorithm. 2183-2198
• 
  Dae Sung Lee, Vassilios S. Vassiliadis, Jong Moon Park: A novel threshold accepting meta-heuristic for the job-shop scheduling problem. 2199-2213
• 
  Georgia Alexouda: An evolutionary algorithm approach to the share of choices problem in the product line design. 2215-2229
• 
  Gang Uk Hwang, Bong Dae Choi: Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy. 2231-2247
• 
  S. Ilker Birbil, Shu-Cherng Fang, Jiye Han: An entropic regularization approach for mathematical programs with equilibrium constraints. 2249-2262
• 
  Roberto Wolfler Calvo, Fabio de Luigi, Palle Haastrup, Vittorio Maniezzo: A distributed geographic information system for the daily car pooling problem. 2263-2278
• 
  Dvir Shabtay, Moshe Kaspi: Minimizing the total weighted flow time in a single machine with controllable processing times. 2279-2289

Volume 31, Number 14, December 2004

• 
  Theodor J. Stewart, Ron Janssen, Marjan van Herwijnen: A genetic algorithm approach to multiobjective land use planning. 2293-2313
• 
  José Carlos Becceneri, Horacio Hideki Yanasse, Nei Yoshihiro Soma: A method for solving the minimization of the maximum number of open stacks problem within a cutting process. 2315-2332
• 
  Stephen D. Patek: Policy iteration type algorithms for recurrent state Markov decision processes. 2333-2347
• 
  Chae Y. Lee, Young P. Moon, Young Joo Cho: A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics. 2349-2363
• 
  Attahiru Sule Alfa: Markov chain representations of discrete distributions applied to queueing models. 2365-2385
• 
  Massimiliano Caramia, Giovanni Felici, A. Pezzoli: Improving search results with data mining in a thematic search engine. 2387-2404
• 
  Chan-Kyoo Park, Sangwook Lee, Soondal Park: A label-setting algorithm for finding a quickest path. 2405-2418
• 
  Suryani Chao, John W. Chinneck, Rafik A. Goubran: Assigning service requests in Voice-over-Internet gateway multiprocessors. 2419-2437
• 
  Nader Azizi, Saeed Zolfaghari: Adaptive temperature control for simulated annealing: a comparative study. 2439-2451
• 
  Hsiao-Fan Wang, Kuang-Yao Wu: Hybrid genetic algorithm for optimization problems with permutation property. 2453-2471

last updated on Sun May 26 02:32:49 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page