A new approach to the maximum-flow problem
Journal of the ACM (JACM)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling projects with labor constraints
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Scheduling under Labour Resource Constraints
Constraints
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
SIAM Journal on Computing
On project scheduling with irregular starting time costs
Operations Research Letters
Optimal automatic multi-pass shader partitioning by dynamic programming
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
INFORMS Journal on Computing
Lagrangian bounds for just-in-time job-shop scheduling
Computers and Operations Research
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Journal of Scheduling
Computers and Operations Research
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
A random key based genetic algorithm for the resource constrained project scheduling problem
Computers and Operations Research
A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling
Computers and Industrial Engineering
Chemical-reaction-inspired metaheuristic for optimization
IEEE Transactions on Evolutionary Computation
A simple dual-RAMP algorithm for resource constraint project scheduling
Proceedings of the 48th Annual Southeast Regional Conference
IEEE Transactions on Evolutionary Computation
A Lagrangian heuristic for satellite range scheduling with resource constraints
Computers and Operations Research
Explanations for the cumulative constraint: an experimental study
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Biased random-key genetic algorithms for combinatorial optimization
Journal of Heuristics
Computers and Operations Research
A simple distribution-free approach to the max k-armed bandit problem
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
A constraint integer programming approach for resource-constrained project scheduling
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maximising the net present value of large resource-constrained projects
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A-Team for solving the resource availability cost problem
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
A New Genetic Algorithm for the RCPSP in Large Scale
International Journal of Applied Evolutionary Computation
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several notoriously hard test sets, including practical problem instances from chemical production planning.