Sciweavers

3433 search results - page 232 / 687
» Heuristics for a bidding problem
Sort
View
ANOR
2005
56views more  ANOR 2005»
15 years 6 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng
TON
2012
13 years 9 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
DIS
2000
Springer
15 years 11 months ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
AAAI
2004
15 years 8 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle
CIC
2004
118views Communications» more  CIC 2004»
15 years 8 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng