An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem

DOI10.1080/02522667.2003.10699561MaRDI QIDQ4469137zbMATH OpenOpenAlexFDO

Authors Huan Neng Chiu, Deng-Maw Tsai

Publication date 14 June 2004

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.2003.10699561

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A comparison of stochastic scheduling rules for maximizing project net present value
• Dynamic version of the economic lot size model
• Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
• Heuristics for resource-constrained scheduling†
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Optimization by simulated annealing
• Project bidding under deterministic and probabilistic activity durations
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows
• Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
• Solving resource-constrained project scheduling problems by a* search
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(1)

• Knowledge integration using problem spaces: A study in resource-constrained project scheduling

This page was built for publication: An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4469137)