Sciweavers

2582 search results - page 308 / 517
» Scheduling in a Planning Environment
Sort
View
COR
2008
88views more  COR 2008»
13 years 11 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
SQJ
2008
89views more  SQJ 2008»
13 years 10 months ago
Cost estimation for cross-organizational ERP projects: research perspectives
There are many methods for estimating size, effort, schedule and other cost aspects of IS projects, but only one specifically developed for Enterprise Resource Planning (ERP) [67]...
Maya Daneva, Roel Wieringa
DEBU
2002
105views more  DEBU 2002»
13 years 10 months ago
Data Integration: Where Does the Time Go?
We present a modular breakdown of data integration tasks and the results of a survey on the distribution of effort among those tasks. The modularization aids in project planning a...
Leonard J. Seligman, Arnon Rosenthal, Paul E. Lehn...
IPSN
2010
Springer
13 years 8 months ago
i-MAC - a MAC that learns
Traffic patterns in manufacturing machines exhibit strong temporal correlations due to the underlying repetitive nature of their operations. A MAC protocol can potentially learn t...
Krishna Kant Chintalapudi
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 5 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...