Solving Project Scheduling Problems by Minimum Cut Computations
From MaRDI portal
Publication:3114838
DOI10.1287/mnsc.49.3.330.12737zbMath1232.90213OpenAlexW2111185171MaRDI QIDQ3114838
Frederik Stork, Rolf H. Möhring, Marc Uetz, Andreas S. Schulz
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.49.3.330.12737
Related Items
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling ⋮ A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ An integer programming approach to the multimode resource-constrained multiproject scheduling problem ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ Variants of Multi-resource Scheduling Problems with Equal Processing Times ⋮ A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Linear programming based algorithms for preemptive and non-preemptive RCPSP ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ A game theoretical approach to sharing penalties and rewards in projects ⋮ A hybrid metaheuristic for the resource-constrained project scheduling problem ⋮ An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations ⋮ Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs ⋮ Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements ⋮ A hybrid genetic algorithm for the resource-constrained project scheduling problem ⋮ Lagrangian bounds for just-in-time job-shop scheduling ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem ⋮ Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem ⋮ Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates ⋮ An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ Justification and RCPSP: a technique that pays ⋮ On project scheduling with irregular starting time costs ⋮ A Lagrangian heuristic for satellite range scheduling with resource constraints ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ Scheduling two chains of unit jobs on one machine: A polyhedral study ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
Uses Software
