An algorithm for solving the job-shop problem
Management Science
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Scheduling Algorithms
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
A Tabu Search Approach for the Resource ConstrainedProject Scheduling Problem
Journal of Heuristics
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Tabu search techniques for large high-school timetabling problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Evolutionary Computation
Generalized disjunctive constraint propagation for solving the job shop problem with time lags
Engineering Applications of Artificial Intelligence
A Generic Framework for Distributed Multirobot Cooperation
Journal of Intelligent and Robotic Systems
New model and heuristics for safety stock placement in general acyclic supply chain networks
Computers and Operations Research
| Hi-index | 0.06 |
The resource-constrained project-scheduling problem (RCPSP) and some of its generalizations are defined. Furthermore, constraint propagation techniques for these problems and related machine scheduling problems are introduced and possible applications of these techniques in connection with lower bound calculations, branch-and-bound methods, and heuristics are discussed.