Computers & Operations Research, Volume 26 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Computers & Operations Research

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 26, Number 1, January 1999

• 
  • 
  • 
  • 
  • 
    Zvi Drezner, George O. Wesolowsky:
    Allocation of demand when cost is demand-dependent. 1-15
• 
  • 
  • 
  • 
  • 
    Andreas Fink, Stefan Voß:
    Applications of modern heuristic search methods to pattern sequencing problems. 17-34
• 
  • 
  • 
  • 
  • 
    A. Volgenant, E. Teerhuis:
    Improved heuristics for the n-job single-machine weighted tardiness problem. 35-44
• 
  • 
  • 
  • 
  • 
    Dirk Biskup, T. C. Edwin Cheng:
    Multiple-machine scheduling with earliness, tardiness and completion time penalties. 45-57
• 
  • 
  • 
  • 
  • 
    Soung Hie Kim, Choong-Gyoo Park, Kyung Sam Park:
    An application of data envelopment analysis in telephone offices evaluation with partial data. 59-72
• 
  • 
  • 
  • 
  • 
    Bin Liu, Jinhua Cao:
    Analysis of a production-inventory system with machine breakdowns and shutdowns. 73-91

Volume 26, Number 2, February 1999

• 
  • 
  • 
  • 
  • 
    Sabine Wittevrongel, Herwig Bruneel:
    Discrete-time queues with correlated arrivals and constant service times. 93-108
• 
  • 
  • 
  • 
  • 
    Ching-Fang Liaw:
    A tabu search algorithm for the open shop scheduling problem. 109-126
• 
  • 
  • 
  • 
  • 
    Nagraj Balakrishnan, John J. Kanet, Sri V. Sridharan:
    Early/tardy scheduling with sequence dependent setups on uniform parallel machines. 127-141
• 
  • 
  • 
  • 
  • 
    Richard L. Daniels, Stella Y. Hua, Scott Webster:
    Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment. 143-155
• 
  • 
  • 
  • 
  • 
    Valery S. Gordon, Vitaly A. Strusevich:
    Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. 157-177
• 
  • 
  • 
  • 
  • 
    Gin Hor Chan, Z. H. Xia, Eng Ung Choo:
    The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters. 179-188

Volume 26, Number 3, March 1999

• 
  • 
  • 
  • 
  • 
    Dennis Ridley:
    Optimal antithetic weights for lognormal time series forecasting. 189-209
• 
  • 
  • 
  • 
  • 
    Haïscam Abdallah, Raymond A. Marie, Bruno Sericola:
    Point and expected interval availability analysis with stationarity detection. 211-218
• 
  • 
  • 
  • 
  • 
    Vinícius Amaral Armentano, Débora P. Ronconi:
    Tabu search for total tardiness minimization in flowshop scheduling problems. 219-235
• 
  • 
  • 
  • 
  • 
    Hui-Ming Wee, Wan-Tsu Wang:
    A variable production scheduling policy for deteriorating items with time-varying demand. 237-254
• 
  • 
  • 
  • 
  • 
    Gülay Barbarosoglu, Demet Özgür:
    A tabu search algorithm for the vehicle routing problem. 255-270
• 
  • 
  • 
  • 
  • 
    Diptesh Ghosh, Nilotpal Chakravarti:
    A competitive local search heuristic for the subset sum problem. 271-279
• 
  • 
  • 
  • 
  • 
    Douglas M. Kline, Abraham Mehrez, Geoffrey Steinberg:
    Information availability vs. solution space size in a knowledge acquisition problem. 281-292

Volume 26, Number 4, April 1999

• 
  • 
  • 
  • 
  • 
    Yash P. Aneja, Hichem Kamoun:
    Scheduling of parts and robot activities in a two machine robotic cell. 297-312
• 
  • 
  • 
  • 
  • 
    Gregory Z. Gutin:
    Exponential neighbourhood local search for the traveling salesman problem. 313-320
• 
  • 
  • 
  • 
  • 
    Gregory Z. Gutin, Anders Yeo:
    Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. 321-327
• 
  • 
  • 
  • 
  • 
    Santosh N. Kabadi, Md. Fazle Baki:
    Gilmore-Gomory type traveling salesman problems. 329-351
• 
  • 
  • 
  • 
  • 
    Md. Fazle Baki, Santosh N. Kabadi:
    Pyramidal traveling salesman problem. 353-369
• 
  • 
  • 
  • 
  • 
    Leyuan Shi, Sigurdur Ólafsson, Ning Sun:
    New parallel randomized algorithms for the traveling salesman problem. 371-394
• 
  • 
  • 
  • 
  • 
    Samerkae Somhom, Abdolhamid Modares, Takao Enkawa:
    Competition-based neural network for the multiple travelling salesmen problem with minmax objective. 395-407
• 
  • 
  • 
  • 
  • 
    Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen:
    Solving the _k_-best traveling salesman problem. 409-425
• 
  • 
  • 
  • 
  • 
    Steven E. Butt, David M. Ryan:
    An optimal solution procedure for the multiple tour maximum collection problem using column generation. 427-441

Volume 26, Number 5, April 1999

• 
  • 
  • 
  • 
  • 
    Paul Mangiameli, David West:
    An improved neural classification network for the two-group problem. 443-460
• 
  • 
  • 
  • 
  • 
    Chu-Fu Wang, Bo-Rong Lai, Rong-Hong Jan:
    Optimum multicast of multimedia streams. 461-480
• 
  • 
  • 
  • 
  • 
    James M. Varanelli, James P. Cohoon:
    A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems. 481-503
• 
  • 
  • 
  • 
  • 
    Jae-Dong Hong, Jack C. Hayya:
    On integrated production-replenishment policies in single-stage manufacturing. 505-523
• 
  • 
  • 
  • 
  • 
    Oded Berman, U. Dinesh Kumar:
    Optimization models for complex recovery block schemes. 525-544

Volume 26, Number 6, May 1999

• 
  • 
  • 
  • 
  • 
    Hui-Ming Wee, Sh-Tyan Law:
    Economic production lot size for deteriorating items taking account of the time-value of money. 545-558
• 
  • 
  • 
  • 
  • 
    Ho Woo Lee, S. H. Lee, Seung Hyun Yoon, Boo Yong Ahn, No Ik Park:
    A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM. 559-581
• 
  • 
  • 
  • 
  • 
    Faruk Güder, James L. Zydiak:
    Ordering policies for multi-item inventory systems subject to multiple resource constraints. 583-597
• 
  • 
  • 
  • 
  • 
    Shaw-Ping Lan, Peter Chu, Kun-Jen Chung, Wun-Jung Wan, Ricky Lo:
    A simple method to locate the optimal solution of the inventory model with variable lead time. 599-605
• 
  • 
  • 
  • 
  • 
    Tamie L. Veith, John E. Kobza, C. Patrick Koelling:
    Netsim: JavaTM-based simulation for the World Wide Web. 607-621
• 
  • 
  • 
  • 
  • 
    Ralf Östermark:
    Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm. 623-635
• 
  • 
  • 
  • 
  • 
    Noel Kweku-Muata Bryson, Anito Joseph:
    Generating consensus priority point vectors: a logarithmic goal programming approach. 637-643

Volume 26, Number 7, July 1999

• 
  • 
  • 
  • 
  • 
    Jihui Zhang, Xin-He Xu:
    An efficient evolutionary programming algorithm. 645-663
• 
  • 
  • 
  • 
  • 
    Tai-Yue Wang, Kuei-Bin Wu:
    A parameter set design procedure for the simulated annealing algorithm under the computational time constraint. 665-678
• 
  • 
  • 
  • 
  • 
    Ching-Fang Liaw:
    A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. 679-693
• 
  • 
  • 
  • 
  • 
    Bertrand M. T. Lin:
    The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine. 695-698
• 
  • 
  • 
  • 
  • 
    Michel Gendreau, Gilbert Laporte, Daniele Vigo:
    Heuristics for the traveling salesman problem with pickup and delivery. 699-714
• 
  • 
  • 
  • 
  • 
    T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah:
    One-operator-two-machine flowshop scheduling with setup and dismounting times. 715-730
• 
  • 
  • 
  • 
  • 
    Waldemar Czuchra:
    Optimizing budget spendings for software implementation and testing. 731-747

Volume 26, Number 8, July 1999

• 
  • 
  • 
  • 
  • 
    T. C. Edwin Cheng, Qing Ding:
    The time dependent machine makespan problem is strongly NP-complete. 749-754
• 
  • 
  • 
  • 
  • 
    Soung Hie Kim, Chang Hee Han:
    An interactive procedure for multi-attribute group decision making with incomplete information. 755-772
• 
  • 
  • 
  • 
  • 
    Funda Sivrikaya-Serifoglu, Gündüz Ulusoy:
    Parallel machine scheduling with earliness and tardiness penalties. 773-787
• 
  • 
  • 
  • 
  • 
    João Manuel Coutinho-Rodrigues, João C. N. Clímaco, John R. Current:
    An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. 789-798
• 
  • 
  • 
  • 
  • 
    Shouhong Wang:
    Nonlinear regression: a hybrid model. 799-817
• 
  • 
  • 
  • 
  • 
    Wen Lea Pearn, J. B. Chou:
    Improved solutions for the Chinese postman problem on mixed networks. 819-827
• 
  • 
  • 
  • 
  • 
    Alf Kimms:
    A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. 829-848

Volume 26, Number 9, August 1999

• 
  • 
  • 
  • 
  • 
    Emanuel Melachrinoudis, Frank GuangSheng Zhang:
    An O(mn) Algorithm for the 1-maximin problem on a network. 849-869
• 
  • 
  • 
  • 
  • 
    Peter M. Van den Bosch, Dennis C. Dietz, Edward A. Pohl:
    Choosing the best approach to matrix exponentiation. 871-882
• 
  • 
  • 
  • 
  • 
    Toshitsugu Otake, K. Jo Min, Cheng-Kang Chen:
    Inventory and investment in setup operations under return on investment maximization. 883-899
• 
  • 
  • 
  • 
  • 
    Won Jun Lee, Kun Chang Lee:
    PROMISE: a distributed DSS approach to coordinating production and marketing decisions. 901-920
• 
  • 
  • 
  • 
  • 
    Erik Rolland, Ali Amiri, Reza Barkhi:
    Queueing delay guarantees in bandwidth packing. 921-935

Volume 26, Numbers 10-11, September 1999

• 
  • 
  • 
  • 
  • 
    H. Edwin Romeijn, Robert L. Smith:
    Parallel algorithms for solving aggregated shortest-path problems. 941-953
• 
  • 
  • 
  • 
  • 
    Kurt Jørnsten, Rainer Leisten, Sverre Storøy:
    Convergence aspects of adaptive clustering in variable aggregation. 955-966
• 
  • 
  • 
  • 
  • 
    Igor S. Litvinchev, Socorro Rangel:
    Localization of the optimal solution and a posteriori bounds for aggregation. 967-988
• 
  • 
  • 
  • 
  • 
    Chiun-Ming Liu:
    Clustering techniques for stock location and order-picking in a distribution center. 989-1002
• 
  • 
  • 
  • 
  • 
    Susan K. Norman, David F. Rogers, Martin S. Levy:
    Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem. 1003-1014
• 
  • 
  • 
  • 
  • 
    Jishnu Hazra, Paul J. Schweitzer, Abraham Seidmann:
    Analyzing closed Kanban-controlled assembly systems by iterative aggregation-disaggregation. 1015-1039
• 
  • 
  • 
  • 
  • 
    Rajesh Tyagi, Chandrasekhar Das:
    Grouping customers for better allocation of resources to serve correlated demands. 1041-1058
• 
  • 
  • 
  • 
  • 
    Larry Weinstein, Chen-Hua Chung:
    Integrating maintenance and production decisions in a hierarchical production planning environment. 1059-1074
• 
  • 
  • 
  • 
  • 
    Erhan Erkut, Burçin Bozkaya:
    Analysis of aggregation errors for the _p_-median problem. 1075-1096
• 
  • 
  • 
  • 
  • 
    Robert L. Bowerman, Paul H. Calamai, G. Brent Hall:
    The demand partitioning method for reducing aggregation errors in _p_-median problems. 1097-1111
• 
  • 
  • 
  • 
  • 
    M. Brenda Rayco, Richard L. Francis, Arie Tamir:
    A _p_-center grid-positioning aggregation procedure. 1113-1124
• 
  • 
  • 
  • 
  • 
    Moshe Haviv:
    On censored Markov chains, best augmentations and aggregation/disaggregation procedures. 1125-1132
• 
  • 
  • 
  • 
  • 
    Gene Fliedner:
    An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation. 1133-1149

Volume 26, Number 12, October 1999

• 
  Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard:
  A tabu search heuristic for the heterogeneous fleet vehicle routing problem. 1153-1173
• 
  • 
  • 
  • 
  • 
    Ching-Chir Shyur, Ta-Chien Lu, Ue-Pyng Wen:
    Applying tabu search to spare capacity planning for network restoration. 1175-1194
• 
  • 
  • 
  • 
  • 
    Ruben Kirkeby Martinson, Jørgen Tind:
    An interior point method in Dantzig-Wolfe decomposition. 1195-1216
• 
  • 
  • 
  • 
  • 
    Manuel Laguna, Rafael Martí, Vicente Campos:
    Intensification and diversification with elite tabu search solutions for the linear ordering problem. 1217-1230
• 
  • 
  • 
  • 
  • 
    Gary R. Reeves, Randall C. Reid:
    A military reserve manpower planning model. 1231-1242

Volume 26, Number 13, November 1999

• 
  • 
  • 
  • 
  • 
    Edward M. Condon, Bruce L. Golden, Edward A. Wasil:
    Predicting the success of nations at the Summer Olympics using neural networks. 1243-1265
• 
  • 
  • 
  • 
  • 
    Ayse Kavusturucu, Surendra M. Gupta:
    Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy. 1267-1292
• 
  • 
  • 
  • 
  • 
    Wei-Chang Yeh:
    A new branch-and-bound approach for the n/2/flowshop/alpha_F_+beta_C_ max flowshop scheduling problem. 1293-1310
• 
  • 
  • 
  • 
  • 
    Gary R. Reeves, Kenneth R. MacLeod:
    Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making. 1311-1321
• 
  • 
  • 
  • 
  • 
    David J. Robb, Dan Trietsch:
    Maximizing the number of mixed packages subject to variety constraints. 1323-1333

Volume 26, Number 14, December 1999

• 
  • 
  • 
  • 
  • 
    Zvi Drezner, George O. Wesolowsky:
    Allocation of discrete demand with changing costs. 1335-1349
• 
  • 
  • 
  • 
  • 
    Stefano Benati:
    The maximum capture problem with heterogeneous customers. 1351-1367
• 
  • 
  • 
  • 
  • 
    Maureen Kilkenny, Jacques-François Thisse:
    Economics of location: A selective survey. 1369-1394
• 
  • 
  • 
  • 
  • 
    Igor Averbakh, Oded Berman:
    Algorithms for path medi-centers of a tree. 1395-1409
• 
  • 
  • 
  • 
  • 
    Mihiro Sasaki, Atsuo Suzuki, Zvi Drezner:
    On the selection of hub airports for an airline hub-and-spoke system. 1411-1422
• 
  • 
  • 
  • 
  • 
    Mamnoon Jamil, Alok Baveja, Rajan Batta:
    The stochastic queue center problem. 1423-1436

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: