Graphs and algorithms
The shifting bottleneck procedure for job shop scheduling
Management Science
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
An algorithm for solving the job-shop problem
Management Science
Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A branch and bound algorithm for the job-shop scheduling problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Intelligent scheduling
Improved CLP scheduling with task intervals
Proceedings of the eleventh international conference on Logic programming
Evolution based learning in a job shop scheduling environment
Computers and Operations Research - Special issue on genetic algorithms
A fast taboo search algorithm for the job shop problem
Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A time-oriented approach to computing optimal schedules for the job-shop scheduling problem
A time-oriented approach to computing optimal schedules for the job-shop scheduling problem
Constraints
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
A Constraint-Based Method for Project Scheduling with Time Windows
Journal of Heuristics
TimeNetManager - A Software Tool for Generating Random Temporal Networks
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Scheduling for multi-threaded real-time programs via path planning
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Models for Global Constraint Applications
Constraints
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
AI Communications - Constraint Programming for Planning and Scheduling
A Position-Based Propagator for the Open-Shop Problem
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
An iterative sampling procedure for resource constrained project scheduling ith time windows
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
An event driven decision support algorithm for command and control of UAV fleets
ACC'09 Proceedings of the 2009 conference on American Control Conference
Scheduling for cellular manufacturing
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A hybrid constraint programming/local search approach to the job-shop scheduling problem
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Better propagation for non-preemptive single-resource constraint problems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
| Hi-index | 0.00 |
We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using {\sc Ilog\ Scheduler}. A new way of calculating lower bounds on the makespan of the job shop scheduling problemis presented and we show how such results can be used within a constraint-based approach. An empirical performance analysis shows that the algorithm we developed performs well. Finally, taking the job shop scheduling problem as a start point, we discuss how constraint-based scheduling can beused to solve more general scheduling problems.