This paper reports on new insights derived from computational results obtained with an updated version of the branch-and-bound procedure previously developed by Demeulemeester and Herroelen (Demeulemeester, E., W. Herroelen. 1992. A branch-and-bound procedure for the multiple...

Some of the legitimacy of Hoffmann's (1992) Eureka is gained from his statement that "Eureka ... would seem to be approximately six times as fast (as Johnson's (1988) FABLE on the literature set). However, Eureka had one problem for which its solution was one station over the optimal, whereas...

We consider the resource-constrained project scheduling problem. The purpose of this paper is to direct the focus to a branch-and-bound concept that can, by simple adaptations, operate on a wide range of problem settings. The general approach can, e.g., deal with multimode problems, resource...

We present a new algorithm for the optimal solution of the 0-1 Knapsack problem, which is particularly effective for large-size problems. The algorithm is based on determination of an appropriate small subset of items and the solution of the corresponding "core problem": from this we derive a...

OptPack (Nourie and Venta [Nourie, Francis J., E. R. Venta. 1991. Finding optimal line balances with OptPack. Oper. Res. Letters 10(April) 165--171.]) was published between the publication times of FABLE and EUREKA. This communication reports microcomputer computational experience with OptPack...

We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery...

In this paper a branch-and-bound procedure is described for scheduling the activities of a project of the PERT/CPM variety subject to precedence and resource constraints where the objective is to minimize project duration. The procedure is based on a depth-first solution strategy in which nodes...

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in addition, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted....

In this paper, we present a novel quantitative analysis for the strategic planning decision problem of allocating certain available prevention and protection resources to, respectively, reduce the failure probabilities of system safety measures and the total expected loss from a sequence of...