AAAAAA
Results: 1-25/549
Authors:
RIDLEY D
Citation: D. Ridley, OPTIMAL ANTITHETIC WEIGHTS FOR LOGNORMAL TIME-SERIES FORECASTING, Computers & operations research, 26(3), 1999, pp. 189-209
Authors:
ABDALLAH H
MARIE R
SERICOLA B
Citation: H. Abdallah et al., POINT AND EXPECTED INTERVAL AVAILABILITY ANALYSIS WITH STATIONARITY DETECTION, Computers & operations research, 26(3), 1999, pp. 211-218
Authors:
ARMENTANO VA
RONCONI DP
Citation: Va. Armentano et Dp. Ronconi, TABU SEARCH FOR TOTAL TARDINESS MINIMIZATION IN FLOWSHOP SCHEDULING PROBLEMS, Computers & operations research, 26(3), 1999, pp. 219-235
Authors:
WEE HM
WANG WT
Citation: Hm. Wee et Wt. Wang, A VARIABLE PRODUCTION SCHEDULING POLICY FOR DETERIORATING ITEMS WITH TIME-VARYING DEMAND, Computers & operations research, 26(3), 1999, pp. 237-254
Authors:
BARBAROSOGLU G
OZGUR D
Citation: G. Barbarosoglu et D. Ozgur, A TABU SEARCH ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM, Computers & operations research, 26(3), 1999, pp. 255-270
Authors:
GHOSH D
CHAKRAVARTI N
Citation: D. Ghosh et N. Chakravarti, A COMPETITIVE LOCAL SEARCH HEURISTIC FOR THE SUBSET SUM PROBLEM, Computers & operations research, 26(3), 1999, pp. 271-279
Authors:
KLINE DM
MEHREZ A
STEINBERG GE
Citation: Dm. Kline et al., INFORMATION-AVAILABILITY VS. SOLUTION SPACE SIZE IN A KNOWLEDGE ACQUISITION PROBLEM, Computers & operations research, 26(3), 1999, pp. 281-292
Authors:
WITTEVRONGEL S
BRUNEEL H
Citation: S. Wittevrongel et H. Bruneel, DISCRETE-TIME QUEUES WITH CORRELATED ARRIVALS AND CONSTANT SERVICE TIMES, Computers & operations research, 26(2), 1999, pp. 93-108
Authors:
LIAW CF
Citation: Cf. Liaw, A TABU SEARCH ALGORITHM FOR THE OPEN SHOP SCHEDULING PROBLEM, Computers & operations research, 26(2), 1999, pp. 109-126
Authors:
BALAKRISHNAN N
KANET JJ
SRIDHARAN V
Citation: N. Balakrishnan et al., EARLY TARDY SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS ON UNIFORM PARALLEL MACHINES/, Computers & operations research, 26(2), 1999, pp. 127-141
HEURISTICS FOR PARALLEL-MACHINE FLEXIBLE-RESOURCE SCHEDULING PROBLEMSWITH UNSPECIFIED JOB ASSIGNMENT
Authors:
DANIELS RL
HUA SY
WEBSTER S
Citation: Rl. Daniels et al., HEURISTICS FOR PARALLEL-MACHINE FLEXIBLE-RESOURCE SCHEDULING PROBLEMSWITH UNSPECIFIED JOB ASSIGNMENT, Computers & operations research, 26(2), 1999, pp. 143-155
Authors:
GORDON VS
STRUSEVICH VA
Citation: Vs. Gordon et Va. Strusevich, EARLINESS PENALTIES ON A SINGLE-MACHINE SUBJECT TO PRECEDENCE CONSTRAINTS - SLK DUE-DATE ASSIGNMENT, Computers & operations research, 26(2), 1999, pp. 157-177
THE CRITICAL CUTOFF VALUE APPROACH FOR DYNAMIC LOT-SIZING PROBLEMS WITH TIME-VARYING COST PARAMETERS
Authors:
CHAN GH
XIA ZH
CHOO EU
Citation: Gh. Chan et al., THE CRITICAL CUTOFF VALUE APPROACH FOR DYNAMIC LOT-SIZING PROBLEMS WITH TIME-VARYING COST PARAMETERS, Computers & operations research, 26(2), 1999, pp. 179-188
Authors:
DREZNER Z
WESOLOWSKY GO
Citation: Z. Drezner et Go. Wesolowsky, ALLOCATION OF DEMAND WHEN COST IS DEMAND-DEPENDENT, Computers & operations research, 26(1), 1999, pp. 1-15
Authors:
FINK A
VOSS S
Citation: A. Fink et S. Voss, APPLICATIONS OF MODERN HEURISTIC-SEARCH METHODS TO PATTERN SEQUENCINGPROBLEMS, Computers & operations research, 26(1), 1999, pp. 17-34
Authors:
VOLGENANT A
TEERHUIS E
Citation: A. Volgenant et E. Teerhuis, IMPROVED HEURISTICS FOR THE N-JOB SINGLE-MACHINE WEIGHTED TARDINESS PROBLEM, Computers & operations research, 26(1), 1999, pp. 35-44
Authors:
BISKUP D
CHENG TCE
Citation: D. Biskup et Tce. Cheng, MULTIPLE-MACHINE SCHEDULING WITH EARLINESS, TARDINESS AND COMPLETION-TIME PENALTIES, Computers & operations research, 26(1), 1999, pp. 45-57
Authors:
KIM SH
PARK CG
PARK KS
Citation: Sh. Kim et al., AN APPLICATION OF DATA ENVELOPMENT ANALYSIS IN TELEPHONE OFFICES EVALUATION WITH PARTIAL DATA, Computers & operations research, 26(1), 1999, pp. 59-72
Authors:
LIU B
CAO JH
Citation: B. Liu et Jh. Cao, ANALYSIS OF A PRODUCTION-INVENTORY SYSTEM WITH MACHINE BREAKDOWNS ANDSHUTDOWNS, Computers & operations research, 26(1), 1999, pp. 73-91
Authors:
MONGA A
ZUO MJ
Citation: A. Monga et Mj. Zuo, OPTIMAL SYSTEM-DESIGN CONSIDERING MAINTENANCE AND WARRANTY, Computers & operations research, 25(9), 1998, pp. 691-705
Authors:
FISCHER MJ
HARRIS CM
Citation: Mj. Fischer et Cm. Harris, APPROXIMATING BY ENHANCED INTERPOLATION IN QUEUING ANALYSES, Computers & operations research, 25(9), 1998, pp. 707-717
Authors:
CHENG HK
FREIMER M
RICHMOND WB
SUMITA U
Citation: Hk. Cheng et al., OPTIMAL REPAIR OF DEGRADING COMPUTERS UNDER ASYMMETRIC INFORMATION AND INCENTIVE INCOMPATIBILITY, Computers & operations research, 25(9), 1998, pp. 719-728
Authors:
DELLAMICO M
MAFFIOLI F
TRUBIAN M
Citation: M. Dellamico et al., NEW BOUNDS FOR OPTIMUM TRAFFIC ASSIGNMENT IN SATELLITE COMMUNICATION, Computers & operations research, 25(9), 1998, pp. 729-743
Authors:
MATHIES S
MEVERT P
Citation: S. Mathies et P. Mevert, A HYBRID ALGORITHM FOR SOLVING NETWORK FLOW PROBLEMS WITH SIDE CONSTRAINTS, Computers & operations research, 25(9), 1998, pp. 745-756
Authors:
ALDOWAISAN T
ALLAHVERDI A
Citation: T. Aldowaisan et A. Allahverdi, TOTAL FLOWTIME IN NO-WAIT FLOWSHOPS WITH SEPARATED SETUP TIMES, Computers & operations research, 25(9), 1998, pp. 757-765