Algorithm performance and problem structure for flow-shop scheduling
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Lagrangian bounds for just-in-time job-shop scheduling
Computers and Operations Research
A memetic algorithm for the job-shop with time-lags
Computers and Operations Research
A fast hybrid tabu search algorithm for the no-wait job shop problem
Computers and Industrial Engineering
Solution-guided multi-point constructive search for job shop scheduling
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Lazy clause generation reengineered
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Generalized disjunctive constraint propagation for solving the job shop problem with time lags
Engineering Applications of Artificial Intelligence
Solving production scheduling with earliness/tardiness penalties by constraint programming
Journal of Intelligent Manufacturing
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Recently, a variety of constraint programming and Boolean satisfiability approaches to scheduling problems have been introduced. They have in common the use of relatively simple propagation mechanisms and an adaptive way to focus on the most constrained part of the problem. In some cases, these methods compare favorably to more classical constraint programming methods relying on propagation algorithms for global unary or cumulative resource constraints and dedicated search heuristics. In particular, we described an approach that combines restarting, with a generic adaptive heuristic and solution guided branching on a simple model based on a decomposition of disjunctive constraints. In this paper, we introduce an adaptation of this technique for an important subclass of job shop scheduling problems (JSPs), where the objective function involves minimization of earliness/tardiness costs.We further show that our technique can be improved by adding domain specific information for one variant of the JSP (involving time lag constraints). In particular we introduce a dedicated greedy heuristic, and an improved model for the case where the maximal time lag is 0 (also referred to as no-wait JSPs).