64 search results - page 3 / 13 » A Constraint-Based Method for Project Scheduling with Time W... |
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
COR
2011
13 years 9 days ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
Recently, a novel approach to pattern matching was introduced, which reduces time complexity by two orders of magnitude over traditional approaches. It uses an efficient projectio...
ICPP
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space Jn onto a k-dimensional one, called the projected sp...