Technology and system of constraint programming for industry production scheduling — Part I: A brief survey and potential directions
 Yarong Chen,
 Zailin Guan,
 Yunfang Peng,
 Xinyu Shao,
 Muhammad Hasseb
 … show all 5 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The use of techniques and system of constraint programming enables the implementation of precise, flexible, efficient, and extensible scheduling systems. It has been identified as a strategic direction and dominant form for the application into planning and scheduling of industrial production. This paper systematically introduces the constraint modeling and solving technology for production scheduling problems, including various realworld industrial applications based on the Chip system of Cosytec Company. We trend of some concrete technology, such as modeling, search, constraint propagation, consistency, and optimization of constraint programming for scheduling problems. As a result of the application analysis, a generic application framework for reallife scheduling based on commercial constraint propagation (CP) systems is proposed.
 Barták R. Constraint programming: in pursuit of the Holy Grail. In: Proceedings of the Week of Doctoral Students, Part IV, Prague, Czech Republic, 1999, 555–564
 Kumar, V. (1992) Algorithms for constraintsatisfaction problems: A survey. Artificial Intelligence 13: pp. 3244
 Pape, C. (1994) Constraintbased programming for scheduling: An historical perspective. Operation Research Society Seminar on Constraint Handling Techniques, London, United Kingdom
 Freuder, E. C. (1997) In pursuit of the Holy Grail. Constraints 2: pp. 5761 CrossRef
 Nuitjen, W. P. M., Aarts, E. H. L. (1996) A Computational study of constraint satisfaction for multiple capacitated jobshop scheduling. European Journal of Operational Research 90: pp. 269284 CrossRef
 Guéret, C., Jussien, N., Prins, C. (2000) Using intelligent backtracking to improve branchandbound methods: An application to openshop problems. European Journal of Operational Research 127: pp. 344354 CrossRef
 Zhang, X. H., Bard, J. F. (2006) A multiperiod machine assignment problem. European Journal of Operational Research 170: pp. 398415 CrossRef
 Le Pape C. Constraintbased scheduling: A tutorial. http://www.math.unipd.it/%7Efrossi/cpschool/lepape.pdf
 Bessière, C. Constraint Propagation (Ch 3). In: Rossi, F., Beek, P., Walsh, T. eds. (2006) Handbook of Constraint Programming. Elsevier Science Ltd, Amsterdam
 Pape, C. (1994) Implementation of resource constraints in ILOG schedule: A library for the development of constraintbased scheduling systems. Intelligent System Engineering 3: pp. 5566 CrossRef
 Baptiste, P., Pape, C. (1996) Disjunctive constraints for manufacturing scheduling: Principles and extensions. International Journal of Computer Integrated Manufacturing 9: pp. 306310 CrossRef
 Dash Optimization Ltd. XpressKalis Reference Manual, 2007
 ILOG Inc. ILOG Scheduler 6.2 Reference Manual, 2006
 Dubois, D., Fargier, H., Prade, H. (1995) Fuzzy constraints in jobshop scheduling. Journal of Intelligent Manufacturing 6: pp. 215234 CrossRef
 Barták, R. (2002) Modelling soft constraints: A survey. Neural Network World 12: pp. 110
 Sadeh, N., Sycara, K., Xiong, Y. L. (1995) Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence 76: pp. 455480 CrossRef
 Stergiou, K., Koubarakis, M. (2000) Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120: pp. 81117 CrossRef
 Wu H, Beek P. On universal restart strategies for backtracking search. In: Proceedings of the Thirteenth International Conference on Principles and Practice of Constraint Programming, 2007, 681–695
 Dcchter, R., Meiri, I. (1994) Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence 68: pp. 211241 CrossRef
 Minton, S., Johnston, M. D., Philips, A. B., Laird, P. (1992) Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58: pp. 161205 CrossRef
 Sadeh, N., Fox, M.S. (1996) Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence 86: pp. l41 CrossRef
 Cheng, C. C., Smith, S. F. (1997) Applying constraint satisfaction techniques to job shop scheduling. Annual of Operation Resource 70: pp. 327378 CrossRef
 Nuijten W P M. Time and resource constrained scheduling: A constraint satisfaction approach. Dissertation for the Doctoral Degree. Eindhoven University of Technology, 1994
 Beck, J. C., Fox, M. S. (2000) Dynamic problem structure analysis as a basis for constraintdirected scheduling heuristics. Artificial Intelligence 117: pp. 3181 CrossRef
 Tsang, E. (1993) Foundations of Constraint Satisfaction. Academic Press, London
 Beck, J. C. (2007) Solutionguided multipoint constructive search for job shop scheduling. Journal of Artificial Intelligence Research 29: pp. 4977
 Watson, J. P., Beck, J. C. (2008) A hybrid constraint programming/local search approach to the jobshop scheduling problem. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 5015: pp. 263277 CrossRef
 Baptiste P, Le Pape C. Edgefinding constraint propagation algorithms for disjunctive and cumulative scheduling. In: Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group, Liverpool, United Kingdom, 1996. Available from http://www.hds.utc.fr/baptiste/
 Baptiste P, Le Pape C. A Theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In: Proceedings of International Joint Conference on Artificial Intelligence, Montreal, Quebec, 1995
 Laborie, P. (2003) Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143: pp. 151188 CrossRef
 Dorndorf U, Pesch E, PhanHuy T. Solving the open shop scheduling problem. Journal of Schdeuling, 2001, (4): 157–174
 Jussien, N., Lhomme, O. (2002) Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence 139: pp. 2145 CrossRef
 Barták R. Practical Constraints: A Tutorial on Modeling with Constraints. In: Proceedings of 5th Workshop on Constraint Programming for Decision, Gliwice, Poland, 2003, 7–17
 Law, Y. C., Lee, J. H. M. (2007) Automatic generation of redundant models for permutation constraint satisfaction problems. Journal of Consrtraints 12: pp. 469505 CrossRef
 Barták, R. (2001) Theory and practice of constraint propagation. Proceedings of the third Workshop on Constraint Programming in Decision and Control. Silesian University, Poland, pp. 714
 Bessière, C., Régin, J. C., Yap, R. H. C., Zhang, Y. (2005) An optimal coarsegrained arc consistency algorithm. Artificial Intelligence 165: pp. 165185 CrossRef
 Brailsford, S. C., Potts, C. N., Smith, B. M. (1999) Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research 119: pp. 557581 CrossRef
 Bessière, C., Debruyne, R. (2008) Theoretical analysis of singleton arc consistency and its extensions. Artificial Intelligence 172: pp. 2941 CrossRef
 Baptiste P, Le Pape C, Nuijten W P M. Incorporating efficient operations research algorithms in constraintbased scheduling. In: Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, 1995
 Hooker, J. N. (2002) Logic, optimization and constraint programming. INFORMS Journal on Computing 14: pp. 295321 CrossRef
 Jain, V., Grossmann, I. E. (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing 13: pp. 258276 CrossRef
 Cambazard H, Jussien N. Integrating Benders decomposition within constraint programming. In: Proceedings of CP, Sitges, 2005, 752–756
 Milano, M., Wallace, M. (2005) Integrating operations research in constraint programming. Annals of Operations Research 4: pp. 175219
 Timpe, C. (2002) Solving planning and scheduling problems with combined integer and constraint programming. Operation Research Spectrum 24: pp. 431448
 Jahangirian, M., Conroy, G. V. (2000) Intelligent dynamic scheduling system: the application of genetic algorithms. Integrated Manufacturing Systems 11: pp. 247257 CrossRef
 Loudni, S., Boizumault, P. (2008) Combining VNS with constraint programming for solving anytime optimization problems. European Journal of Operational Research 191: pp. 705735 CrossRef
 Zupanic D. Optimal solution for a textile production unit. In: Proceedings of the Second International Conference, 1996
 Freuder, G., Wallace, M. (2000) Constraint technology and the commercial world. IEEE Intelligent Systems 15: pp. 2023 CrossRef
 Simonis, H. (2007) Building industrial applications with constraint programming. Principles and Practice of Constraint Programming 4741: pp. 271309
 Simonis, H., Charlier, P., Kay, P. (2000) Constraint handling in an integrated transportation problem. IEEE Intelligent Systems 15: pp. 2632 CrossRef
 Title
 Technology and system of constraint programming for industry production scheduling — Part I: A brief survey and potential directions
 Journal

Frontiers of Mechanical Engineering in China
Volume 5, Issue 4 , pp 455464
 Cover Date
 20101201
 DOI
 10.1007/s114650100106x
 Print ISSN
 16733479
 Online ISSN
 16733592
 Publisher
 SP Higher Education Press
 Additional Links
 Topics
 Keywords

 constraint programming
 production scheduling
 constraint propagation
 search
 consistency
 optimization
 Industry Sectors
 Authors

 Yarong Chen ^{(1)} ^{(2)}
 Zailin Guan ^{(1)}
 Yunfang Peng ^{(1)}
 Xinyu Shao ^{(1)}
 Muhammad Hasseb ^{(1)} ^{(3)}
 Author Affiliations

 1. State Key Lab of Digital Manufacturing Equipment & Technology, Huazhong University of Science and Technology, Wuhan, 430074, China
 2. Mechanical & Electrical Engineering College, Wenzhou University, Wenzhou, 325035, China
 3. Comsats Institute of Information Technology, Abbottabad, 22010, Pakistan