Abstract
The paper presents a performance prediction and optimisation tool MAK€that allows users to model enterprises in a visually rich and intuitive way. The tool automatically generates a scheduling model describing all choices that users can do when optimising production. This model then goes to the Optimiser Module that generates schedules optimising on-time-in-full performance criterion while meeting the constraints of the firm and the customer demand. Finally, the Performance Manager Module shows the decision maker what is the best possible outcome for the firm given the inputs from the Enterprise Modeller. The Optimiser Module, which is the main topic of this paper, is implemented using constraint-based solving techniques with specific search heuristics for this type of problems. It demonstrates practical applicability of constraint-based scheduling – one of the killer application areas of constraint programming, a technology originated from AI research.
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
Bae, J., Bae, H., Kang, S.-H., Kim, Z.: Automatic Control of Workflow Processes Using ECA Rules. IEEE Transactions on Knowledge and Data Engineering 16(8), 1010–1023 (2004)
Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling: Applying Constraints to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
Barták, R.: Visopt ShopFloor: On the Edge of Planning and Scheduling. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 587–602. Springer, Heidelberg (2002)
Barták, R.: Search Strategies for Scheduling Problems with Optional Activities. In: Proceedings of CSCLP 2008 Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, Rome (2008)
Barták, R., Čepek, O.: Temporal Networks with Alternatives: Complexity and Model. In: Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), pp. 641–646. AAAI Press (2007)
Barták, R., Čepek, O.: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. In: Dochev, D., Pistore, M., Traverso, P. (eds.) AIMSA 2008. LNCS (LNAI), vol. 5253, pp. 235–246. Springer, Heidelberg (2008)
Barták, R., Čepek, O., Hejna, M.: Temporal Reasoning in Nested Temporal Networks with Alternatives. In: Fages, F., Rossi, F., Soliman, S. (eds.) CSCLP 2007. LNCS (LNAI), vol. 5129, pp. 17–31. Springer, Heidelberg (2008)
Barták, R., Little, J., Manzano, O., Sheahan, C.: From Enterprise Models to Scheduling Models: Bridging the Gap. Journal of Intelligent Manufacturing 21(1), 121–132 (2010)
Beck, J.C., Fox, M.S.: Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence (121), 211–250 (2000)
Brucker, P.: Scheduling algoritms. Springer, Heidelberg (2001)
Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 742–747. AAAI Press (2000)
Godard, D., Laborie, P., Nuijten, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: Proceedings of the 15th International Conference of Automated Planning and Scheduling (ICAPS), pp. 81–89. AAAI Press (2005)
Delgado, A., Jensen, R.M., Schulte, C.: Generating Optimal Stowage Plans for Container Vessel Bays. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 6–20. Springer, Heidelberg (2009)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence (49), 61–95 (1991)
Kuster, J., Jannach, D., Friedrich, G.: Handling Alternative Activities in Resource-Constrained Project Scheduling Problems. In: Proceedings of Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1960–1965 (2007)
Laborie, P.: IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 148–162. Springer, Heidelberg (2009)
Laborie, P., Rogerie, J.: Reasoning with Conditional Time-intervals. In: Proceedings of the Twenty-First International Florida AI Research Society Conference (FLAIRS), pp. 555–560. AAAI Press (2008)
Rabenau, E., Donati, A., Denis, M., Policella, N., Schulster, J., Cesta, A., Cortellessa, G., Fratini, S., Oddi, A.: The RAXEM Tool on Mars Express - Uplink Planning Optimisation and Scheduling Using AI Constraint Resolution. In: Proceedings of the 10th International Conference on Space Operations, SpaceOps 2008, Heidelberg, Germany (2008)
Smith, S.F., Cheng, C.-C.: Slack-Based Heuristics for Constraint Satisfaction Scheduling. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 139–144. AAAI Press (1993)
Vilím, P., Barták, R., Čepek, O.: Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. Constraints 10(4), 403–425 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R., Sheahan, C., Sheahan, A. (2012). MAK€– A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-27660-6_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27659-0
Online ISBN: 978-3-642-27660-6
eBook Packages: Computer ScienceComputer Science (R0)