Sciweavers

388 search results - page 5 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 9 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
CCE
2004
13 years 8 months ago
Modeling and solving real-time scheduling problems by stochastic integer programming
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
Guido Sand, Sebastian Engell
WSC
2007
13 years 11 months ago
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...
Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean...
CP
2005
Springer
14 years 2 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
HPCN
1995
Springer
14 years 8 days ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck