A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem | Zendy

Erik Demeulemeester | Zendy; Willy S. Herroelen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

Author(s) -

Erik Demeulemeester,

Willy S. Herroelen

Publication year - 1997

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.45.2.201

Subject(s) - scheduling (production processes) , branch and bound , mathematical optimization , computer science , upper and lower bounds , search tree , tree (set theory) , node (physics) , dominance (genetics) , operations research , mathematics , search algorithm , mathematical analysis , biochemistry , chemistry , structural engineering , engineering , gene

In this paper a branch-and-bound procedure is described for scheduling project activities subject to precedence diagramming type of precedence relations, ready times, due dates, and variable multip...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research