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

DOI10.1080/02522667.2003.10699561zbMath1176.90277OpenAlexW2329958175MaRDI QIDQ4469137

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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Project bidding under deterministic and probabilistic activity durations
• A comparison of stochastic scheduling rules for maximizing project net present value
• Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Dynamic Version of the Economic Lot Size Model
• Heuristics for resource-constrained scheduling†
• Tabu Search—Part I
• Tabu Search—Part II
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
• Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows
• Solving resource-constrained project scheduling problems by a* search

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