A Horizon-Varying, Zero-One Approach to Project Scheduling

DOI10.1287/MNSC.20.6.990MaRDI QIDQ4058461zbMATH OpenOpenAlexFDO

Authors James H. Patterson, Walter D. Huber

Publication date 1974

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.20.6.990

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(26)

• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
• A Multiobjective Resource-Constrained Project-Scheduling Problem
• A multiple-tree search procedure for the resource-constrained project scheduling problem
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• Hierarchical models for multi-project planning and scheduling
• Project scheduling and equipment planning with random breakdowns
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure
• Going to the core of hard resource-constrained project scheduling instances
• Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks
• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• Resource-constrained project scheduling by simulated annealing
• Improved tabu search heuristics for the dynamic space allocation problem
• Resource constrained project scheduling: Modelling with multiple alternatives
• A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
• A robust time-cost-quality-energy-environment trade-off with resource-constrained in project management: a case study for a bridge construction project
• A neurogenetic approach for the resource-constrained project scheduling problem
• A constraint-based perspective in resource constrained project scheduling
• Branch-and-cut-and-price algorithms for the preemptive RCPSP
• A comparative study of computational procedures for the resource constrained project scheduling problem
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Resource-constrained project scheduling: A survey of recent developments.
• MIP heuristics for a resource constrained project scheduling problem with workload stability constraints
• A new mathematical model for hybrid flow shop under time-varying resource and exact time-lag constraints
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Reducing the feasible solution space of resource-constrained project instances

This page was built for publication: A Horizon-Varying, Zero-One Approach to Project Scheduling

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