Skip to Main content Skip to Navigation

Search, propagation, and learning in sequencing and scheduling problems

Abstract : Sequencing and scheduling involve the organization in time of operations subject to capacity and resource constraints. We propose in this dissertation several improvements to the constraint satisfaction and combinatorial optimization methods for solving these problems. These contributions concern three different aspects: how to choose the next node to explore (search)? how much, and how efficiently, one can reduce the search space (propagation)? and what can be learnt from previous failures (learning)? Our contributions start with an empirical study of search heuristics for the well known car-sequencing problem. This evaluation characterizes the key aspects of a good heuristic and shows that the search strategy is as important as the propagation aspect in this problem. Second, we carefully investigate the propagation aspect in a class of sequencing problems. In particular, we propose an algorithm for filtering a type of sequence constraints which worst case time complexity is lower than the best known upper bound, and indeed optimal. Third, we investigate the impact of clause learning for solving the car-sequencing problem. In particular, we propose reduced explanations for the new filtering. The experimental evaluation shows compelling evidence supporting the importance of clause learning for solving efficiently this problem. Next, we revisit the general approach of lazy generation for the Boolean variables encoding the domains. Our proposition avoids a classical redundancy issue without computational overhead. Finally, we investigate conflict analysis algorithms for solving disjunctive scheduling problems. In particular, we introduce a novel learning procedure tailored to this family of problems. The new conflict analysis differs from conventional methods by learning clauses whose size are not function of the scheduling horizon. Our comprehensive experimental study with traditional academic benchmarks demonstrates the impact of the novel learning scheme that we propose. In particular, we find new lower bounds for a well known scheduling benchmark
Document type :
Complete list of metadata

Cited literature [126 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, June 24, 2015 - 10:37:10 AM
Last modification on : Thursday, June 10, 2021 - 3:05:22 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 5:46:41 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01164291, version 2


Mohamed Siala. Search, propagation, and learning in sequencing and scheduling problems. Artificial Intelligence [cs.AI]. INSA de Toulouse, 2015. English. ⟨NNT : 2015ISAT0008⟩. ⟨tel-01164291v2⟩



Record views


Files downloads