Abstract
We consider the scheduling problem of minimizing the weighted sum of late jobs on a single machine (1| r j | sumw 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baptiste, P., Jouglet, A., Le Pape, C., Nuijten, W.: A constraint-based approach to minimize the weighted number of late jobs on parallel machines. Research Report UTC 2000/288 (2000)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems. Kluwer Academic Publishers, Dordrecht (2001)
Bockmayr, A., Pisaruk, N.: Detecting infeasibility and generating cuts for MIP using CP. In: 5th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, CPAI- OR 2003, Montreal, Canada (2003)
Carlier, J.: The one machine sequencing problem. European J. of Oper. Res. 11, 42–47 (1982)
Colombani, Y., Heipcke, T.: Mosel: an extensible environment for modeling and programming solutions. In: 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR, Le Croisic, France, pp. 277–290 (2002)
Dauzère-Pérès, S., Sevaux, M.: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Res. Logistics 50(3), 273–288 (2003)
Jain, V., Grossman, I.E.: Algorithms for hybrid MILP/CLP models for a class of optimization problems. INFORMS Journal on Computing 13(4), 258–276 (2001)
Péridy, L., Pinson, E., Rivraux, D.: Using short-term memory to minimize the weighted number of late jobs on a single machine. European J. of Oper. Res. 148, 591–603 (2003)
Sadykov, R., Wolsey, L.: Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem with Deadlines and Release Dates. CORE Discussion Paper 2003/81 (2003)
Sevaux, M., Dauzère-Pérès, S.: Genetic algorithms to minimize the weighted number of late jobs on a single machine. European J. of Oper. Res. 151, 296–306 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadykov, R. (2004). A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive