Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 32
Volume 32, Number 1, January 2005
- Chuda B. Basnet
, Janny Leung:
Inventory lot-sizing with supplier selection. 1-14
- Roberto D. Galvão, Fernando Y. Chiyoshi, Reinaldo Morabito:
Towards unified formulations and extensions of two classical probabilistic location models. 15-33 - Brunilde Sansò, André Girard, Florent Mobiot:
Integrating reliability and quality of service in networks with switched virtual circuits. 35-58 - István Gódor, Gábor Magyar:
Cost-optimal topology planning of hierarchical access networks. 59-86 - Han-Lin Li, Han-Ying Kao:
Constrained abductive reasoning with fuzzy parameters in Bayesian networks. 87-105 - Alan R. McKendall Jr., James S. Noble, Cerry M. Klein:
Simulated annealing heuristics for managing resources during planned outages at electric power plants. 107-125 - Christopher W. Zobel, William T. Scherer:
An empirical study of policy convergence in Markov decision process value iteration. 127-142 - Yaodong Cui:
Generating optimal T-shape cutting patterns for circular blanks. 143-152 - Jeffery K. Cochran, Hung-Nan Chen:
Fuzzy multi-criteria selection of object-oriented simulation software for production system analysis. 153-168 - Patrik Björklund, Peter Värbrand, Di Yuan:
Optimized planning of frequency hopping in cellular networks. 169-186 - Nidhi Gupta, Manu Pratap Singh:
Estimation of software reliability with execution time model using the pattern mapping technique of artificial neural network. 187-199
Volume 32, Number 2, February 2005
- Chefi Triki, Patrizia Beraldi, George Gross:
Optimal capacity allocation in multi-auction electricity markets under uncertainty. 201-217 - Gianpaolo Ghiani, Roberto Musmanno, Giuseppe Paletta, Chefi Triki:
A heuristic for the periodic rural postman problem. 219-228 - Ali Derbala:
Priority queuing in an operating system. 229-238 - Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe:
Heuristic and exact algorithms for the spanning tree detection problem. 239-255 - Yian-Kui Liu, Baoding Liu:
On minimum-risk problems in fuzzy random decision systems. 257-283 - Peter Chu, Kuo-Lung Yang, Patrick S. Chen:
Improved inventory models with service level and lead time. 285-296 - Jinn-Tsair Teng, Chun-Tao Chang:
Economic production quantity models for deteriorating items with price- and stock-dependent demand. 297-308 - Marcos Colebrook, Jose Gutiérrez, Joaquin Sicilia:
A new bound and an O(mn) algorithm for the undesirable 1-median problem (maxian) on networks. 309-325 - Imelda C. Perez, John W. Fowler, W. Matthew Carlyle:
Minimizing total weighted tardiness on a single batch process machine with incompatible job families. 327-341 - Scott L. Rosen, Catherine M. Harmonosky:
An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. 343-358 - Ronald G. McGarvey, Tom M. Cavalier:
Constrained location of competitive facilities in the plane. 359-378 - Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi:
Designing radio-mobile access networks based on synchronous digital hierarchy rings. 379-394
Volume 32, Number 3, March 2005
- Jean-Marie Bourjolly, Vianney Rebetez:
An analysis of lower bound procedures for the bin packing problem. 395-405 - Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández:
A compact model and tight bounds for a combined location-routing problem. 407-428 - Ignacio Castillo, Tapio Westerlund:
An epsilon-accurate model for optimal unequal-area block layout design. 429-447 - Satheesh Ramachandran, Dursun Delen:
Performance analysis of a kitting process in stochastic assembly systems. 449-463 - Peter I. Cowling, Ralf Keuthen:
Embedded local search approaches for routing optimization. 465-490 - Mohamed Naceur Azaiez, S. S. Al Sharif:
A 0-1 goal programming model for nurse scheduling. 491-507 - Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
An algorithm for ranking quickest simple paths. 509-520 - Andy An-Kai Jeng, Bertrand M. T. Lin:
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs. 521-536 - Murali Sambasivan, Salleh Yahya:
A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. 537-555 - Jorge M. S. Valente, Rui A. F. S. Alves:
Improved heuristics for the early/tardy scheduling problem with no idle time. 557-569 - Hsu-Hao Yang, Yen-Liang Chen:
Finding K shortest looping paths in a traffic-light network. 571-581 - Maghsud Solimanpur, Prem Vrat, Ravi Shankar:
An ant algorithm for the single row layout problem in flexible manufacturing systems. 583-598 - Samuel Guirchoun, Patrick Martineau, Jean-Charles Billaut:
Total completion time minimization in a computer system with a server and two parallel processors. 599-611 - Chung-Chi Hsieh, Yi-Ting Chen:
Reliable and economic resource allocation in an unreliable flow network. 613-628 - Madhu Jain, G. C. Sharma, Chandra Shekhar:
Processor-shared service systems with queue-dependent processors. 629-645 - Ahmet Bolat, Ibrahim Al-Harkan, Bandar Al-Harbi:
Flow-shop scheduling for three serial stations with the last two duplicate. 647-667 - Bermawi Priyatna Iskandar, D. N. Prabhakar Murthy, Nat Jack:
A new repair-replace strategy for items sold with a two-dimensional warranty. 669-682 - Refael Hassin, Mati Shani:
Machine scheduling with earliness, tardiness and non-execution penalties. 683-705 - Gang Li, Shouyang Wang, Hong Yan, Gang Yu:
Information transformation in a supply chain: a simulation study. 707-725
Volume 32, Number 4, April 2005
- Diwakar Gupta, Thorkell Magnusson:
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. 727-747 - Sancho Salcedo-Sanz, José Luis Fernández-Villacañas, María Jesús Segovia-Vargas, Carlos Bousoño-Calzón:
Genetic programming for the prediction of insolvency in non-life insurance companies. 749-765 - Bara Kim:
Maximizing service of carousel storage. 767-772 - Yann Collette, Patrick Siarry:
Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization. 773-792 - Lusine Yepremyan, James E. Falk:
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems. 793-812 - Wade D. Cook, Rodney H. Green:
Evaluating power plant efficiency: a hierarchical model. 813-823 - Vincent Chi-Wei Li, Guy L. Curry:
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search. 825-848 - T. C. Edwin Cheng, Jinjiang Yuan, A. F. Yang:
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. 849-859 - Jean-Luc Marichal, Patrick Meyer, Marc Roubens:
Sorting multi-attribute alternatives: The TOMASO method. 861-877 - Kyu-Yeul Lee, Myung-Il Roh, Hyuk-Su Jeong:
An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages. 879-899 - Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen:
Scheduling two-machine no-wait open shops to minimize makespan. 901-917 - Frederico R. B. Cruz, James MacGregor Smith, R. O. Medeiros:
An M/G/C/C state-dependent network simulation model. 919-941 - Karabi Sikdar, U. C. Gupta:
Analytic and numerical aspects of batch service queues with single vacation. 943-966 - Haluk Topcuoglu, Fatma Corut, Murat Ermis, Gülsah Yilmaz:
Solving the uncapacitated hub location problem using genetic algorithms. 967-984 - Jully Jeunet, Nicolas Jonard:
Single-point stochastic search algorithms for the multi-level lot-sizing problem. 985-1006 - Suh-Wen Chiou:
A combinatorial approximation algorithm for concurrent flow problem and its application. 1007-1035 - Gholam Reza Jahanshahloo, Majid Soleimani-Damaneh:
A note on simulating weights restrictions in DEA: an improvement of Thanassoulis and Allen's method. 1037-1044
Volume 32, Number 5, May 2005
- Sang-Ho Kwon, Hun-Tae Kim, Maing-Kyu Kang:
Determination of the candidate arc set for the asymmetric traveling salesman problem. 1045-1057 - Kin Keung Lai, Wan-Lung Ng:
A stochastic approach to hotel revenue optimization. 1059-1072 - Steven Chamberland, Désiré Oulaï Khyda, Samuel Pierre:
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths. 1073-1087 - Víctor Suñé, Juan A. Carrasco:
Efficient implementations of the randomization method with control of the relative error. 1089-1114 - Liang Liang, Desheng Wu:
An application of pattern recognition on scoring Chinese corporations financial conditions based on backpropagation neural network. 1115-1129 - Jeffrey P. Kharoufeh, Jeffrey A. Sipe:
Evaluating failure time probabilities for a Markovian wear process. 1131-1145 - Nong Ye, Esma Senturk Gel, Xueping Li, Toni Farley, Ying-Cheng Lai:
Web server QoS models: applying scheduling rules from production planning. 1147-1164 - Feiyue Li, Bruce L. Golden, Edward A. Wasil:
Very large-scale vehicle routing: new test problems, algorithms, and results. 1165-1179 - Chinho Lin, Yihsu Lin:
The production size and inventory policy for a manufacturer in a two-echelon inventory model. 1181-1196 - Jason Chao-Hsien Pan, Jen-Shiang Chen:
Mixed binary integer programming formulations for the reentrant job shop scheduling problem. 1197-1212 - Akhil Jain, Udatta S. Palekar:
Aggregate production planning for a continuous reconfigurable manufacturing process. 1213-1236 - Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano:
Comparison of heuristics for flowtime minimisation in permutation flowshops. 1237-1254 - Paul R. Harper, Valter de Senna, Israel T. Vieira, Arjan K. Shahani:
A genetic algorithm for the project assignment problem. 1255-1265 - Jianghua Wu:
Quantity flexibility contracts under Bayesian updating. 1267-1288 - Hans L. Trinkaus, Thomas Hanne:
knowCube: a visual and interactive support for multicriteria decision making. 1289-1309 - Mhand Hifi, Hedi M'Halla, Slim Sadfi:
An exact algorithm for the knapsack sharing problem. 1311-1324 - Joaquín A. Pacheco:
A scatter search approach for the minimum sum-of-squares clustering problem. 1325-1335 - Mohamed Naceur Azaiez, Moncer Hariga, Ibrahim Al-Harkan:
A chance-constrained multi-period model for a special multi-reservoir system. 1337-1351 - Nil Aras:
Erratum to "The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon"[Computers and Operations Research 28 (2001) 271-287]. 1353-
Volume 32, Number 6, June 2005
- Christian Blum, Maria J. Blesa:
New metaheuristic approaches for the edge-weighted k-cardinality tree problem. 1355-1377 - Hao Tang, Elise Miller-Hooks:
A TABU search heuristic for the team orienteering problem. 1379-1407 - Tzung-Nan Chuang, Jung-Yuan Kung:
The fuzzy shortest path length and the corresponding shortest path in a network. 1409-1428 - Alysson M. Costa:
A survey on benders decomposition applied to fixed-charge network design problems. 1429-1450 - Anne Mercier, Jean-François Cordeau, François Soumis:
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. 1451-1476 - Lars Relund Nielsen, Kim Allan Andersen, Daniele Pretolani:
Finding the K shortest hyperpaths. 1477-1497 - Haralambos Sarimveis, Athanassios Nikolakopoulos:
A line up evolutionary algorithm for solving nonlinear constrained optimization problems. 1499-1514 - Yahong Hu, Shell-Ying Huang, Chuanyu Chen, Wen-Jing Hsu, Ah Cheong Toh, Chee Kit Loh, Tiancheng Song:
Travel time analysis of a new automated storage and retrieval system. 1515-1544 - Frederico R. B. Cruz, James MacGregor Smith, D. C. Queiroz:
Service and capacity allocation in M/G/c/c state-dependent queueing networks. 1545-1563 - Christian Blum:
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. 1565-1591 - David I. Mester, Olli Bräysy:
Active guided evolution strategies for large-scale vehicle routing problems with time windows. 1593-1614 - Samir Elhedhli, Frank Xiaolong Hu:
Hub-and-spoke network design with congestion. 1615-1632 - Chao-Chung Kang, Cheng-Min Feng, Haider A. Khan:
Risk assessment for build-operate-transfer projects: a dynamic multi-objective programming approach. 1633-1654 - Edson Luiz França Senne, Luiz Antonio Nogueira Lorena, Marcos Antonio Pereira:
A branch-and-price approach to p-median location problems. 1655-1664
Volume 32, Number 7, July 2005
- Ali Emrouznejad:
Measurement efficiency and productivity in SAS/OR. 1665-1683 - Alexandre Le Bouthillier, Teodor Gabriel Crainic:
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. 1685-1708 - Yaodong Cui:
A cutting stock problem and its solution in the manufacturing industry of large electric generators. 1709-1721 - Seok Bong Jeong, Sehun Kim, Heesoo Lee:
Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users. 1723-1737 - Malcolm J. Beynon, Nigel Driffield:
An illustration of variable precision rough sets model: an analysis of the findings of the UK Monopolies and Mergers Commission. 1739-1759 - Ricardo Santiago-Mozos, Sancho Salcedo-Sanz, Mario de Prado-Cumplido, Carlos Bousoño-Calzón:
A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university. 1761-1776 - Qian Wang, Rajan Batta, Robert J. Szczerba:
Sequencing the processing of incoming mail to match an outbound truck delivery schedule. 1777-1791 - Miro Gradisar, Peter Trkman:
A combined approach to the solution to the general one-dimensional cutting stock problem. 1793-1807 - Christopher W. Zobel, Loren Paul Rees, Terry R. Rakes:
Automated merging of conflicting knowledge bases, using a consistent, majority-rule approach with knowledge-form maintenance. 1809-1829 - Talel Ladhari, Mohamed Haouari:
A computational study of the permutation flow shop problem based on a tight lower bound. 1831-1847 - Francis Sourd:
Earliness-tardiness scheduling with setup considerations. 1849-1865 - H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
The over-constrained airport gate assignment problem. 1867-1880 - Malcolm J. Beynon:
A method of aggregation in DS/AHP for group decision-making with the non-equivalent importance of individuals in the group. 1881-1896 - Bojan Srdjevic:
Combining different prioritization methods in the analytic hierarchy process synthesis. 1897-1919 - Jaehwan Yang:
The complexity of customer order scheduling problems on parallel machines. 1921-1939
Volume 32, Number 8, August 2005
- De-Fu Zhang, An-sheng Deng:
An effective hybrid algorithm for the problem of packing circles into a larger containing circle. 1941-1951 - Carlos A. S. Oliveira, Panos M. Pardalos:
A survey of combinatorial optimization problems in multicast routing. 1953-1981 - Hélcio Vieira Jr., Marcos Pereira Estellita Lins:
An improved initial basis for the Simplex algorithm. 1983-1993 - Dong Cao, Mingyuan Chen, Guohua Wan:
Parallel machine selection and job scheduling to minimize machine cost and job tardiness. 1995-2012 - Chinyao Low:
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. 2013-2025 - Ying-Ming Wang, Jian-Bo Yang, Dong-Ling Xu:
A preference aggregation method through the estimation of utility intervals. 2027-2049 - Soo Y. Chang, Hark-Chin Hwang, Sanghyuck Park:
A two-dimensional vector packing model for the efficient use of coil cassettes. 2051-2058 - Anil Kukreja, Charles P. Schmidt:
A model for lumpy demand parts in a multi-location inventory system with transshipments. 2059-2075 - Cameron G. Walker, Jody N. Snowdon, David M. Ryan:
Simultaneous disruption recovery of a train timetable and crew roster in real time. 2077-2094 - Layek L. Abdel-Malek, Roberto Montanari:
On the multi-product newsboy problem with two constraints. 2095-2116 - Peng-Sheng You, Ta-Cheng Chen:
An efficient heuristic for series-parallel redundant reliability problems. 2117-2127 - Der-Chiang Li, Chih-Sen Wu, Fengming M. Chang:
Determination of the parameters in the dynamic weighted Round-Robin method for network load balancing. 2129-2145 - Chung-Lun Li, Guohua Wan:
Improved algorithm for maximizing service of carousel storage. 2147-2150 - Kua-Ping Liao, Robert Fildes:
The accuracy of a procedural approach to specifying feedforward neural networks for forecasting. 2151-2169 - Wade D. Cook, Joe Zhu:
Allocation of shared costs among decision making units: a DEA approach. 2171-2178