2930 search results - page 423 / 586 » The optimal sequence compression |
174
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
134
click to vote
EOR
2006
15 years 6 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
175
click to vote
CCE
2004
15 years 6 months ago
2004
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
182
click to vote
ORL
2000
15 years 6 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
157
click to vote
JAIR
1998
15 years 6 months ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...