A hybrid branch-and-cut algorithm for the one-machine scheduling problem

Sadykov, Rouslan
(2004) 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems — Location: Nice(France) (20.April.2004)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 135.1 KB
Request a copy

Details

Authors
  • Sadykov, RouslanUCLouvain
    Author
Abstract
We consider the scheduling problem of minimizing the weighted sum of late jobs on a single machine (1 (j) Sigma w(j)U(j)). A hybrid Branch-and-Cut algorithm is proposed, where infeasibility cuts are generated using CP. Two ways are suggested to increase the strength of cuts. The proposed approach has been implemented in the Mosel modelling and optimization language. Numerical experiments showed that the algorithm performs at least as well as the best to our knowledge exact approach [8] on sets of public test instances.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Sadykov, R. (2004). A hybrid branch-and-cut algorithm for the one-machine scheduling problem. Lecture Notes in Computer Science, 3011, 409-414. https://doi.org/10.1007/978-3-540-24664-0_31 (Original work published 2004)