Journal: Computers & OR

Volume 31, Issue 13

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