77 search results - page 10 / 16 » Using Genetic Algorithms to Solve the Tactical Fixed Interva... |
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
COR
2010
13 years 7 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
RTS
2008
13 years 5 months ago
2008
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
SIAMJO
2000
13 years 7 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...