Search Results - subject:"branch and bound"

Project Scheduling Under Partially Renewable Resource Constraints

Böttcher, Jan; Drexl, Andreas; Kolisch, Rainer; … - In: Management Science 45 (1999) 4, pp. 543-559

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially renewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make,...

Persistent link: https://www.econbiz.de/10009191542

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Martello, Silvano; Pisinger, David; Toth, Paolo - In: Management Science 45 (1999) 3, pp. 414-424

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....

Persistent link: https://www.econbiz.de/10009198165

A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem

Park, June S.; Lim, Byung Ha; Lee, Youngho - In: Management Science 44 (1998) 12-Part-2, pp. 271-271

This paper develops a Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem … latter algorithm, when incorporated into a branch-and-bound algorithm as the lower bounding scheme, can accelerate the search … process. Computational results demonstrate the efficiency and robustness of this branch-and-bound algorithm not only for GMAPs …

Persistent link: https://www.econbiz.de/10009189688

Discrete Lotsizing and Scheduling by Batch Sequencing

Jordan, Carsten; Drexl, Andreas - In: Management Science 44 (1998) 5, pp. 698-713

The discrete lotsizing and scheduling problem for one machine with sequence-dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is...

Persistent link: https://www.econbiz.de/10009197449

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Mingozzi, Aristide; Maniezzo, Vittorio; Ricciardelli, … - In: Management Science 44 (1998) 5, pp. 714-729

In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new 0-1 linear programming formulation of the problem that requires an exponential number of variables, corresponding to all feasible subsets...

Persistent link: https://www.econbiz.de/10009197597

Exact Solution of the Two-Dimensional Finite Bin Packing Problem

Martello, Silvano; Vigo, Daniele - In: Management Science 44 (1998) 3, pp. 388-399

bound and determine its worst-case performance. We propose new lower bounds which are used within a branch-and-bound …

Persistent link: https://www.econbiz.de/10009208704

New Benchmark Results for the Resource-Constrained Project Scheduling Problem

Demeulemeester, Erik L.; Herroelen, Willy S. - In: Management Science 43 (1997) 11, pp. 1485-1492

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 … stronger lower bound. We compare the results obtained by a truncated branch-and-bound procedure with the results generated by …

Persistent link: https://www.econbiz.de/10009191189

Revised-Modified Penalties for Fixed Charge Transportation Problems

Lamar, Bruce W.; Wallace, Chris A. - In: Management Science 43 (1997) 10, pp. 1431-1436

Conditional penalties are used to obtain lower bounds to subproblems in a branch-and-bound procedure that can be … tighter than the LP relaxation of the subproblems. For the fixed charge transportation problem (FCTP), branch-and-bound …. 1984. Some branch-and-bound procedures for fixed-cost transportation problems. Naval Res. Logistics 31 145--154.), and …

Persistent link: https://www.econbiz.de/10009204440

Note: Microcomputer Performance of OptPack on Hoffmann's Data Sets: Comparison with Eureka and FABLE

Nourie, Francis J.; Venta, Enrique R. - In: Management Science 42 (1996) 2, pp. 304-306

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...

Persistent link: https://www.econbiz.de/10009197956

Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times

Schutten, J. M. J.; Velde, S. L. van de; Zijm, W. H. M. - In: Management Science 42 (1996) 8, pp. 1165-1174

and maximizing customers' satisfaction by completing jobs before their due dates. We develop a branch-and-bound algorithm …

Persistent link: https://www.econbiz.de/10009197980