1102 search results - page 53 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
ATMOS
2008
13 years 10 months ago
2008
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
SCHEDULING
2010
13 years 7 months ago
2010
This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break placement. Two particular ...
CP
2001
Springer
14 years 1 months ago
2001
Springer
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
EAAI
2008
13 years 9 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—With the power consumption issue of mobile handset taken into account, Single-carrier FDMA (SC-FDMA) has been selected for 3GPP Long-Term Evolution (LTE) uplink multiple access ...