Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement

DOI10.1155/2014/634649zbMath1407.90174OpenAlexW2033690669WikidataQ57424079 ScholiaQ57424079MaRDI QIDQ1718808

A. Shirzadeh Chaleshtarti, Yahya Fathi, Shahram Shadrokh

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/634649

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Uses Software

• CPLEX
• MPSPLib
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Differential evolution for solving multi-mode resource-constrained project scheduling problems
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• Project scheduling. A research handbook.
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• GRASP and path relinking for project scheduling under partially renewable resources
• A scatter search algorithm for project scheduling under partially renewable resources
• Allocation of partially renewable resources: Concept, capabilities, and applications
• Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences
• A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
• Project Scheduling Under Partially Renewable Resource Constraints
• An Algorithm for Solving the Job-Shop Problem
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A Dynamic Programming Algorithm for Decision CPM Networks
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
• Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

This page was built for publication: Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement