Journal ArticleDOI
Project scheduling with resource constraints: A branch and bound approach
Reads0
Chats0
TLDR
A branch and bound algorithm for project scheduling with resource constraints based on the idea of using disjunctive arcs for resolving conflicts that are created whenever sets of activities have to be scheduled whose total resource requirements exceed the resource availabilities in some periods is described.About:
This article is published in European Journal of Operational Research.The article was published on 1987-06-01. It has received 387 citations till now. The article focuses on the topics: Branch and cut & Linear programming relaxation.read more
Citations
More filters
Journal ArticleDOI
Resource-constrained project scheduling: Notation, classification, models, and methods
TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.
Sequencing and scheduling: algorithms and complexity
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Journal ArticleDOI
PSPLIB - A project scheduling problem library
Rainer Kolisch,Arno Sprecher +1 more
TL;DR: In this paper, the authors present a set of benchmark instances for the evaluation of solution procedures for single and multi-mode resource-constrained project scheduling problems, which are systematically generated by the standard project generator ProGen.
Journal ArticleDOI
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
TL;DR: It is shown that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling improves the performance of single- pass scheduling significantly, and that the parallel method cannot be generally considered as superior.
Journal ArticleDOI
A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
TL;DR: Problems requiring large amounts of computer time using existing approaches for solving this problem type are rapidly solved with the procedure using the dominance rules described, resulting in a significant reduction in the variability in solution times.
References
More filters
Journal ArticleDOI
Validation of subgradient optimization
TL;DR: It is concluded that the “relaxation” procedure for approximately solving a large linear programming problem related to the traveling-salesman problem shows promise for large-scale linear programming.
Journal ArticleDOI
Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach
TL;DR: A zero-one 0-1 linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations.
Journal ArticleDOI
A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling
TL;DR: A comparison of eight different heuristic scheduling rules, including those found most effective in previous research on this problem, to find the rules most effective relative to an optimum solution.
Journal ArticleDOI
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
TL;DR: This paper describes an implicit enumeration procedure that solves the problem by generating a sequence of circuit-free graphs and solving a slightly amended critical-path problem for each graph in the sequence.
Journal ArticleDOI
An Algorithm for the Line Balancing Problem
TL;DR: An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem and the algorithm is compared with prior analytical methods of line balancing.