Sciweavers

6455 search results - page 99 / 1291
» Research problems
Sort
View
122
Voted
KES
2005
Springer
15 years 9 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
113
Voted
SC
1995
ACM
15 years 7 months ago
Parallel Implementations of the Power System Transient Stability Problem on Clusters of Workstations
Power system transient stability analysis computes the response of the rapidly changing electrical components of a power system to a sequence of large disturbances followed by ope...
Monika ten Bruggencate, Suresh Chalasani
129
Voted
STRINGOLOGY
2004
15 years 5 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
120
Voted
INFORMS
2000
54views more  INFORMS 2000»
15 years 3 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
145
Voted
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 7 months ago
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
In this work, we consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process,...
Zizhuo Wang, Shiming Deng, Yinyu Ye