Abstract
Visopt ShopFloor is a complete system for solving real-life scheduling problems in complex industries. In particular, the system is intended to problem areas where traditional scheduling methods failed. In the paper we describe the heart of the Visopt system, a generic scheduling engine. This engine goes beyond traditional scheduling by offering some planning capabilities. We achieved this integrated behaviour by applying Constraint Logic Programming in a less standard way - the definition of a constraint model is dynamic and introduction of constraints interleaves with search.
The research is supported by the Grant Agency of the Czech Republic under the contract no. 201/01/0942.
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.
Similar content being viewed by others
References
Baptiste, P. and Le Pape, C: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996).
Barták, R.: Conceptual Models for Combined Planning and Scheduling. Electronic Notes in Discrete Mathematics, Volume 4, Elsevier (1999).
Barták, R.: Dynamic Constraint Models for Planning and Scheduling Problems. Proceedings of the ERCIM/CompulogNet Workshop on Constraint Programming, LNAI Series, Springer Verlag (2000).
Barták, R.: Filtering Algorithms for Tabular Constraints, in Proceedings of CP2001 Workshop CICLOPS, Paphos, Cyprus (2001), 168–182.
Barták, R.: Dynamic Global Constraints in Backtracking Based Environments, in Annals of Operations Research, Kluwer (2002), to appear.
Barták, R.: Modelling Transition Constraints. The ECAI Workshop on Modelling and Solving Problems with Constraints (2002).
Beck, J.Ch. and Fox, M.S.: Scheduling Alternative Activities. Proceedings of AAAI-99, USA (1999), 680–687.
Brusoni, V., Console, L., Lamma. E., Mello, P., Milano, M., Terenziani, P.: Resource-based vs. Task-based Approaches for Scheduling Problems. Proceedings of the 9 th ISMIS96, LNCS Series, Springer Verlag (1996).
Gallaire, H.: Logic Programming: Further Developments, in: IEEE Symposium on Logic Programming, Boston, IEEE (1985).
Joslin, D. and Pollack M.E.: Passive and Active Decision Postponement in Plan Generation. Proceedings of the Third European Conference on Planning (1995).
Laborie P.: Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results. In Proceedings of 6 th European Conference on Planning, Toledo, Spain (2001), 205–216.
Mittal, S. and Falkenhainer, B.: Dynamic Constraint Satisfaction Problems. Proceedings ofAAAI-90, USA (1990), 25–32.
Nareyek, A.: Structural Constraint Satisfaction. Proceedings of AAAI-99 Workshop on Configuration (1999).
Nareyek, A.: AI Planning in a Constraint Programming Framework. Proceedings of the Third International Workshop on Communication-Based Systems (2000).
Pegman, M.: Short Term Liquid Metal Scheduling. Proceedings of PAPPACT98 Conference, London (1998), 91–99.
van Hentenryck, P.: Constraint Satisfaction in Logic Programming, The MIT Press, Cambridge, Mass. (1989).
Van Hentenryck, P., Deville, Y.: The Cardinality Operator: A new Logical Connective for Constraint Logic Programming. Proceedings of the International Conference on Logic Programming (1991), 745–759.
Wallace, M.: Applying Constraints for Scheduling, in: Constraint Programming, Mayoh B. and Penjaak J. (eds.), NATO ASI Series, Springer Verlag (1994).
Zhou, J.: A Permutation-Based Approach for Solving the Job-Shop Problem. Constraints, vol. 2 no. 2 (1997), 185–213.
Visopt B.V. http://www.visopt.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R. (2002). Visopt ShopFloor: On the Edge of Planning and Scheduling. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_39
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive