Sciweavers

908 search results - page 102 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
ATAL
2007
Springer
16 years 10 days ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
IEEEPACT
2007
IEEE
16 years 14 days ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
16 years 3 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
ICCS
1997
Springer
15 years 9 months ago
Uncovering the Conceptual Models in Ripple Down Rules
: The need for analysis and modeling of knowledge has been espoused by many researchers as a prerequisite to building knowledge based systems (KBS). This approach has done little t...
Debbie Richards, Paul Compton