For most computationally intractable problems there exists no heuristic which performs best on all instances. Usually …, a heuristic characterized as best will perform good on the majority of instances but leave a minority on which other … heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority …

-called randomized regret based heuristic. …

This contribution presents two heuristic approaches for multi-level, single-machine lot sizing and scheduling. The … first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method … shows that these two methods are complementary, i.e. the randomized regret based heuristic performs good in those cases in …

In this paper we propose a new heuristic to solve the well-known multiple resource-constrained project scheduling … this new heuristic on a set of widely used benchmark-instances we show that it derives superior results than all other …

-scheduling heuristic is proposed and evaluated on a set of benchmark instances. …

-to-order products. Based on a list scheduling procedure which has been proposed in Kolisch [19] we introduce three efficient heuristic …

individuals use simple rules of thumb (heuristics) to forecast the future inflation and output gap. We compare this model with the … rational expectations version of the same underlying model. We find that the dynamics predicted by the heuristic model differs …