) no more than twenty to fifty activities can be solved to optimality in reasonable amount of time. Hence, heuristics must … be employed to solve larger instances. To evaluate such heuristics, lower bounds are needed. The aim of this paper is to …

heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority …

. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized …

. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized … their effectiveness considerably. We extend this approach by integrating heuristics and case-based reasoning (CBR), an … performance similar or close to state-of-the-art heuristics. In addition, the analysis undertaken provides new insight into the …

. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics …

an NP-hard problem, it is unlikely that optimum solutions can be computed for large instances. Thus, heuristics have … evaluate their heuristics on the basis of a best known lower bound, but it is unclear how good the performance really is. With …