Journal: Computers & OR

Volume 29, Issue 9

1115 -- 1127Francisco J. Arcelus, T. P. M. Pakkala, Gopalan Srinivasan. A myopic policy for the gradual obsolescence problem with price-dependent demand
1129 -- 1141Jacques Renaud, Fayez F. Boctor, Gilbert Laporte. Perturbation heuristics for the pickup and delivery traveling salesman problem
1143 -- 1156Eugene J. Zak. Row and column generation technique for a multistage cutting stock problem
1157 -- 1172Chae Y. Lee, Hee K. Cho. Port partitioning and dynamic queueing for IP forwarding
1173 -- 1193Siddhartha S. Syam. A model and methodologies for the location problem with logistical components
1195 -- 1206Konstantin Kogan, Sheldon X. C. Lou. Scheduling one-part-type serial manufacturing system under periodic demand: a solvable case
1207 -- 1220Miro Gradisar, Gortan Resinovic, Miroljub Kljajic. Evaluation of algorithms for one-dimensional cutting
1221 -- 1235Mauricio Solar, Víctor Parada, Rodrigo Urrutia. A parallel genetic algorithm to solve the set-covering problem
1237 -- 1250Jaques Reifman, Earl E. Feldman. Multilayer perceptron for nonlinear programming
1251 -- 1266Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen. The total completion time open shop scheduling problem with a given sequence of jobs on one machine
1267 -- 1281Kyung Sang Lee, Kyung-Sam Park, Soung Hie Kim. Dominance, potential optimality, imprecise information, and hierarchical structure in multi-criteria analysis

Volume 29, Issue 8

951 -- 969Bruce Curry, Peter Morgan, Mick Silver. Neural networks and non-linear statistical methods: an application to the modelling of price-quality relationships
971 -- 994Ali Allahverdi, Fawaz S. Al-Anzi. Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
995 -- 1007C. S. Sung, Y. I. Choung, J. M. Hong, Y.-H. Kim. Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
1009 -- 1024Youngshin Park, Sooyoung Kim, Chi-Hyuck Jun. Mean value analysis of re-entrant line with batch machines and multi-class jobs
1025 -- 1030James S. Finan, William J. Hurley. The analytic hierarchy process: can wash criteria be ignored?
1031 -- 1039Clark D. Jeffries. Design rules for application specific dynamical systems
1041 -- 1058Gordian Schilling, Michael C. Georgiadis. An algorithm for the determination of optimal cutting patterns
1059 -- 1079M. Selim Akturk, Siraceddin Onen. Dynamic lot sizing and tool management in automated manufacturing systems
1081 -- 1098Herbert F. Lewis, Susan A. Slotnick. Multi-period job selection: planning work loads to maximize profit
1099 -- 1113Sung A. Cho, Chae-Bogk Kim, Dong-Hoon Lee. Single machine MAD/::::T::::::max:: problem with a common due date

Volume 29, Issue 7

781 -- 806Zhi-Long Chen, Shanling Li, Devanath Tirupati. A scenario-based stochastic programming approach for technology and capacity planning
807 -- 819Lionel Dupont, Clarisse Dhaenens-Flipo. Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure
821 -- 839Krzysztof Fleszar, Khalil S. Hindi. New heuristics for one-dimensional bin-packing
841 -- 848Kunihiko Hiraishi, Eugene Levner, Milan Vlach. Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
849 -- 868Chat Srivaree-ratana, Abdullah Konak, Alice E. Smith. Estimation of all-terminal network reliability using an artificial neural network
869 -- 885Jason Chao-Hsien Pan, Jen-Shiang Chen, Chii-Ming Chao. Minimizing tardiness in a two-machine flow-shop
887 -- 903Angel Corberán, Rafael Martí, Eulalia Martínez, David Soler. The Rural Postman Problem on mixed graphs with turn penalties
905 -- 924Chu-Fu Wang, Chun-Teng Liang, Rong-Hong Jan. Heuristic algorithms for packing of multiple-group multicasting
925 -- 947Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

Volume 29, Issue 6

0 -- 0Horst A. Eiselt, John R. Current. Special issue on location analysis
541 -- 562Richard L. Church. Geographical information systems and location science
563 -- 581Oded Berman, Dmitry Krass. The generalized maximal covering location problem
583 -- 592Vedat Verter. An integrated model for facility location and technology acquisition
593 -- 607Nicoletta Ricciardi, Roberto Tadei, Andrea Grosso. Optimal facility location with random throughput costs
609 -- 623José Fernández, Pascual Fernández, Blas Pelegrín. Estimating actual distances by norm functions: a comparison between the ::::l::::::::::k::::, ::::p::::, theta::-norm and the ::::l::::::::::b::::::1::, ::::b::::::2::, theta::-norm and a study about the selection of the data set
625 -- 636Jack Brimberg, George O. Wesolowsky. Locating facilities by minimax relative to closest points of demand areas
637 -- 650Zvi Drezner, Stefan Steiner, George O. Wesolowsky. On the circle closest to a set of points
651 -- 665Luce Brotcorne, Gilbert Laporte, Frédéric Semet. Fast heuristics for large scale covering-location problems
667 -- 684Steven J. D Amico, Shoou-Jiun Wang, Rajan Batta, Christopher M. Rump. A simulated annealing approach to police district design
685 -- 699Shoou-Jiun Wang, Joyendu Bhadury, Rakesh Nagi. Supply facility and input/output point locations in the presence of barriers
701 -- 713Rex K. Kincaid, Sharon L. Padula. D-optimal designs for sensor and actuator locations
715 -- 739Gabriela Mayer, Bernd Wagner. HubLocator: an exact solution method for the multiple allocation hub location problem
741 -- 759Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega. Locating stations on rapid transit lines
761 -- 779Jorge H. Jaramillo, Joy Bhadury, Rajan Batta. On the use of genetic algorithms to solve location problems

Volume 29, Issue 5

423 -- 431Lawrence Leemis. Computing the nonparametric estimator of the survivor function when all observations are either left- or right-censored with tied observation times
433 -- 440So Young Sohn. Robust design of server capability in M/M/1 queues with both partly random arrival and service rates
441 -- 458Francis J. Vasko, Robert S. Barbieri, Brian Q. Rieksts, Kenneth L. Reitmeyer, Kenneth L. Stott Jr.. The cable trench problem: combining the shortest path and minimum spanning tree problems
459 -- 470Moshe Eben-Chaime, Abraham Mehrez, Gad Markovich. Capacitated location-allocation problems on a line
471 -- 487Liang-Yuh Ouyang, Jing-Shing Yao. A minimax distribution free procedure for mixed inventory model involving variable lead time with fuzzy demand
489 -- 504Yi-Kuang Chen, Shih-Wei Lin, Shuo-Yan Chou. An efficient two-staged approach for generating block layouts
505 -- 527Kurt M. Bretthauer, Bala Shetty. A pegging algorithm for the nonlinear resource allocation problem
529 -- 540Jeffery K. Cochran, Theodore P. Lewis. Computing small-fleet aircraft availabilities including redundancy and spares

Volume 29, Issue 4

317 -- 326Tongryeol Seol, Soondal Park. Solving linear systems in interior-point methods
327 -- 339Indranil Bose, Raktim Pal. Average waiting time of customers in a priority M/D/k queue with finite buffers
341 -- 363Shangyao Yan, Tuntai Tung, Yu-Ping Tu. Optimal construction of airline individual crew pairings
365 -- 386Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi. A new method for solving capacitated location problems based on a set partitioning approach
387 -- 402Mohamed A. Ahmed, Talal M. Alkhamis. Simulation-based optimization using simulated annealing with ranking and selection
403 -- 422K. Rajashree Kamath, T. P. M. Pakkala. A Bayesian approach to a dynamic inventory model under an unknown demand distribution

Volume 29, Issue 3

205 -- 219Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost ::::s::::-::::t:::: cutsets
221 -- 241Gue-woong Jeong, Kyungsik Lee, Sungsoo Park, Kyungchul Park. A branch-and-price algorithm for the Steiner tree packing problem
243 -- 259Christos Valouxis, Efthymios Housos. Combined bus and driver scheduling
261 -- 274Richard Y. K. Fung, Jiafu Tang, Dingwei Wang. Extension of a hybrid Genetic Algorithm for nonlinear programming problems with equality and inequality constraints
275 -- 294Chang Sup Sung, Young-Hwan Kim. Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
295 -- 315Amir H. Abdekhodaee, Andrew Wirth. Scheduling parallel machines with a single server: some solvable cases and heuristics

Volume 29, Issue 2

103 -- 121Ming-Guang Huang, Pao-Long Chang, Ying-Chyi Chou. Buffer allocation in flow-shop-type production systems with general arrival and service patterns
123 -- 149Jatinder N. D. Gupta, Karsten Hennig, Frank Werner. Local search heuristics for two-stage flow shop problems with secondary criterion
151 -- 169Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong. Fast parallel heuristics for the job shop scheduling problem
171 -- 193Yongwon Seo, Sungwon Jung, Juho Hahm. Optimal reorder decision utilizing centralized stock information in a two-echelon distribution system
195 -- 203Hsing Luh, Ray Tsaih. An efficient search direction for linear programming problems

Volume 29, Issue 14

1941 -- 1955Gautam Choudhury. A batch arrival queue with a vacation time under single vacation policy
1957 -- 1967T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich. Common due date assignment and scheduling with ready times
1969 -- 2001Chian-Son Yu. A GP-AHP method for solving group decision-making fuzzy AHP problems
2003 -- 2021Behnam Malakooti, Jumah E. Al-alwani. Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming problems
2023 -- 2041L. Douglas Smith, Robert M. Nauss, Robert J. Banis, Ronald Beck. Staffing geographically distributed service facilities with itinerant personnel
2043 -- 2051Sheng-Pen Wang. An inventory replenishment policy for deteriorating items with shortages and partial backlogging
2053 -- 2072B. W. Conolly, P. R. Parthasarathy, N. Selvaraju. Double-ended queues with impatience
2073 -- 2085Sakib A. Mondal. Minimization of squared deviation of completion times about a common due date
2087 -- 2091T. C. Edwin Cheng, Mikhail Y. Kovalyov. An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note

Volume 29, Issue 13

1773 -- 1791Walter J. Gutjahr, Gabriele Uchida. A branch-and-bound approach to the optimization of redundant software under failure correlation
1793 -- 1806Jaehyun Yeo, Heesoo Lee, Sehun Kim. An efficient broadcast scheduling algorithm for TDMA ad-hoc networks
1807 -- 1818Chung-Chi Hsieh. Smoothness in frame reduction
1819 -- 1825Sheng-Pen Wang. On inventory replenishment with non-linear increasing demand
1827 -- 1842Peter Chu, Patrick S. Chen. A note on inventory replenishment policies for deteriorating items in an exponentially declining market
1843 -- 1858Wei-Chang Yeh. Search for all ::::d::::-Mincuts of a limited-flow network
1859 -- 1872Matthew J. Katz, Klara Kedem, Michael Segal. Improved algorithms for placing undesirable facilities
1873 -- 1901Anant Singh Jain, Sheik Meeran. A multi-level hybrid framework applied to the general flow-shop scheduling problem
1903 -- 1912Gianpaolo Ghiani, Francesca Guerriero, Roberto Musmanno. The capacitated plant location problem with multiple facilities in the same site
1913 -- 1925S. Reza Hejazi, Azizollah Memariani, Gholam Reza Jahanshahloo, Mohammad Mehdi Sepehri. Linear bilevel programming solution by genetic algorithm
1927 -- 1939Yi-Kuei Lin. Two-commodity reliability evaluation for a stochastic-flow network with node failure

Volume 29, Issue 12

1611 -- 1620A. Krishnamoorthy, T. G. Deepak. Modified ::::N::::-policy for ::::M::::/::::G::::/1 queues
1621 -- 1640Cheng-Shuo Wang, Reha Uzsoy. A genetic algorithm to minimize maximum lateness on a batch processing machine
1641 -- 1659Ko-Hsin Liang, Xin Yao, Charles S. Newton, David Hoffman. A new evolutionary approach to cutting stock problems with and without contiguity
1661 -- 1676Yong Kyoon Lee, Kyung-Sam Park, Soung Hie Kim. Identification of inefficiencies in an additive model based IDEA (imprecise data envelopment analysis)
1677 -- 1700Salvador Nieto Sánchez, Evangelos Triantaphyllou, Jianhua Chen, T. Warren Liao. An incremental learning algorithm for constructing Boolean functions from positive and negative examples
1701 -- 1717Liang-Yuh Ouyang, Cheng-Kang Chen, Hung-Chi Chang. Quality improvement, setup cost and lead-time reductions in lot size reorder point models with an imperfect production process
1719 -- 1737Ue-Pyng Wen, Tsung-Lin Wu, Ching-Chir Shyur. Bi-directional self-healing ring network planning
1739 -- 1757Maria Jesus Lopez-Herrero. On the number of customers served in the ::::M::::/::::G::::/1 retrial queue: first moments and maximum entropy approach
1759 -- 1772Alexandre Linhares, Horacio Hideki Yanasse. Connections between cutting-pattern sequencing, VLSI design, and flexible machines

Volume 29, Issue 11

1447 -- 1463Jiafu Tang, Richard Y. K. Fung, Baodong Xu, Dingwei Wang. A new approach to quality function deployment planning with financial consideration
1465 -- 1473Joseph Kreimer. Real-time system with homogeneous servers and nonidentical channels in steady-state
1475 -- 1493R. J. Kuo, L. M. Ho, Clark M. Hu. Integration of self-organizing feature map and ::::K::::-means algorithm for market segmentation
1495 -- 1535Jing-Shing Yao, Teng-San Shih. Fuzzy revenue for fuzzy demand quantity based on interval-valued fuzzy sets
1537 -- 1558Rafael Caballero, Trinidad Gómez, Mariano Luque, Francisca Miguel, Francisco Ruiz. Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
1559 -- 1581Shangyao Yan, Chich-Hwang Tseng. A passenger demand model for airline flight scheduling and fleet routing
1583 -- 1602Amy Hing Ling Lau, Hon-Shiang Lau. The effects of reducing demand uncertainty in a manufacturer-retailer channel for single-period products
1603 -- 0Samuel J. Raff. Editorial
1605 -- 1608Din-Horng Yeh. A note on "a simple heuristic for maximizing service of carousel storage"
1609 -- 1610Elkafi Hassini. Comments on a note by Jacobs, Peck and Davis

Volume 29, Issue 10

1283 -- 1300William G. Ferrell Jr., Aman Chhoker. Design of economically optimal acceptance sampling plans with inspection error
1301 -- 1315Suk-Hun Yoon, Jose A. Ventura. Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
1317 -- 1330Kenneth E. Rosing, M. John Hodgson. Heuristic concentration for the ::::p::::-median: an example demonstrating how and why it works
1331 -- 1341Umesh Chandra Gupta, V. Goswami. Performance analysis of finite buffer discrete-time queue with bulk service
1343 -- 1352Giuseppe Paletta. The period traveling salesman problem: a new heuristic algorithm
1353 -- 1374Marcos Escobar, Amedeo R. Odoni, Emily Roth. Approximate solution for multi-server queueing systems with Erlangian service times
1375 -- 1391Anito Joseph. A concurrent processing framework for the set partitioning problem
1393 -- 1415Tai-Hsi Wu, Chinyao Low, Jiunn-Wei Bai. Heuristic solutions to multi-depot location-routing problems
1417 -- 1439Jatinder N. D. Gupta, Karin Krüger, Volker Lauff, Frank Werner, Yuri N. Sotskov. Heuristics for hybrid flow shops with controllable processing times and assignable due dates
1441 -- 1446Edward Yu-Hsien Lin, Dennis L. Bricker. Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

Volume 29, Issue 1

1 -- 12Giuseppe Bruno, Michel Gendreau, Gilbert Laporte. A heuristic for the location of a rapid transit line
13 -- 31Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst. Finding all ::::k::::-cliques in ::::k::::-partite graphs, an application in textile engineering
33 -- 51I-Ming Chao. A tabu search method for the truck and trailer routing problem
53 -- 66Elham Ghashghai, Ronald L. Rardin. Using a hybrid of exact and genetic algorithms to design survivable networks
67 -- 86Said Salhi. Defining tabu list size and aspiration criterion within tabu search methods
87 -- 102Montaz M. Ali, Aimo A. Törn, Sami Viitanen. A direct search variant of the simulated annealing algorithm for optimization involving continuous variables