Search Results - subject:"branch and bound"

Scheduling of project networks by job assignment

Drexl, Andreas - 1990

costs. For solving this time-resource-cost-tradeoff problem we present a hybrid branch and bound / dynamic programming …

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

On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints

Vanhoucke, Mario; Demeulemeester, Erik; Herroelen, Willy - In: Management Science 47 (2001) 8, pp. 1113-1121

features the financial aspects of project management are taken into account.We introduce a depth-first branch-and-bound …

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

Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

Pastor, Rafael; Corominas, Albert - In: TOP: An Official Journal of the Spanish Society of … 8 (2000) 1, pp. 111-134

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

PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

Klein, Robert; Scholl, Armin - In: Computational Statistics 52 (2000) 3, pp. 467-488

This paper deals with the generalized resource-constrained project scheduling problem (GRCPSP) which extends the well-known resource-constrained project scheduling problem (RCPSP) by considering job specific release and due dates, non-negative minimum start-to-start time lags as well as...

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

PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

Klein, Robert; Scholl, Armin - In: Mathematical Methods of Operations Research 52 (2000) 3, pp. 467-488

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

Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements

Sprecher, Arno - In: Management Science 46 (2000) 5, pp. 710-723

branch-and-bound concept that can, by simple adaptations, operate on a wide range of problem settings. The general approach …

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

Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies

Bertazzi, Luca; Speranza, Maria Grazia; Ukovich, Walter - In: Management Science 46 (2000) 7, pp. 973-988

efficiency of a known branch-and-bound algorithm. Moreover, we present some heuristics and compare them with two different …

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

A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Dorndorf, Ulrich; Pesch, Erwin; Phan-Huy, Toàn - In: Management Science 46 (2000) 10, pp. 1365-1384

applications in areas such as make-to-order production planning. We describe a time-oriented branch-and-bound algorithm that uses …

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

Note on an improved branch-and-bound algorithm to solve n/m/P/F<Subscript>max</Subscript> problems

Companys, Ramón - In: TOP: An Official Journal of the Spanish Society of … 7 (1999) 1, pp. 25-31

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

Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

Kang, Sungmin; Malik, Kavindra; Thomas, L. Joseph - In: Management Science 45 (1999) 2, pp. 273-289

schedule into subsequences, leading to tractable subproblems. An optimization approach based on a column generation/branch and … bound methodology is developed, and heuristically adapted to test problems including five real-world problem instances …

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