Sciweavers

2544 search results - page 216 / 509
» Process pipeline scheduling
Sort
View
ESANN
2003
15 years 8 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
IPCO
1998
99views Optimization» more  IPCO 1998»
15 years 8 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
WSC
1997
15 years 8 months ago
Creating a Flexible, Simulation-Based Finite Scheduling Tool
Today's business climate for manufacturers requires low inventory, quick response systems that turn out a wide variety of products. Since many companies are reaching physical...
Barbara W. Mazziotti, Richard E. Horne Jr.
JAIR
2006
121views more  JAIR 2006»
15 years 6 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
JSAC
2007
87views more  JSAC 2007»
15 years 6 months ago
Performance Analysis of Scheduling in Multiuser MIMO Systems with Zero-Forcing Receivers
— Despite its low-complexity, the zero-forcing receiver is known to suffer from noise enhancement to restore the spatially multiplexed data in a single-user MIMO system. Neverthe...
Chiung-Jang Chen, Li-Chun Wang