Abstract
An important role of a workflow system is to schedule and reschedule the workflow process and to allow the user to monitor and guide the overall progress of the workflow and its activities. This paper presents extensions of a rescheduling algorithm based on minimal graph cut. The initial approach allowed to find an optimal rescheduling, which changed the initial schedule by shortening and moving of activities. The new schedule had the lowest overall price, counted as the sum of prices of shortening activities. The extension presented in this paper allows several extensions, while keeping the optimality: handling several delayed activities, handling the price of moving an activity and handling the price of deadline violation. The rescheduling algorithm is used within an ontology-based workflow management system for the process of military exercise preparation in Centre of simulation technologies National Academy of Defence.
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
Bean, J.C., Birge, J.R., Mittenehal, J., Noon, C.E.: Match-up scheduling with multiple resources, release dates and disruption. Operations Research 39(3), 470–483 (1991)
Bing, W., Yu-Geng, X.: Rolling Partial Rescheduling with Dual Objectives for Single Machine Subject to Disruptions. Acta Automatica Sinica 32(5), 667–673 (2006)
Bonnal, P., De Jonghe, J., Ferguson, J.: A Deliverable-Oriented Evm System Suited to a Large-Scale Project. Project Management Journal (2006)
Corkill, D.D., Rubinstein, Z.B., Lander, S.E., Lesser, V.R.: Live-Representation Process Managment. In: Proc. 5th International Conference on Enterprise Information Systems, Angers, France (2003)
Chuda, D.: Evaluation and Security Features in e-learning. In: e-learning Conference 2007, Istanbul, Turkey, pp. 81–85 (2007)
Ford, L.R., Fulkerson, D.R.: Maximal Flow Through a Network. Canadian Journal of Mathematics 8, 399–404 (1956)
Forgac, R., Budinska, I., Gatial, E., Nguyen, G., Laclavik, M., Balogh, Z., Mokris, I., Hluchy, L., Ciglan, M., Babik, M.: Ontology based knowledge management for organizational learning. In: ISIM 2006. Proc. of 9-th Intl. Conf. Information Systems Implementation and Modelling, Brno, April, MARQ Ostrava, pp. 177–184 (2006)
Kim, K.: A Resource-constrained CPM (RCPM) Scheduling and Control Technique with Multiple Calendars. Dissertation, Faculty of Virginia Polytechnic Institute and State University, USA (2003)
Kučera, L.: Kombinatorické algoritmy. Praha, SNTL (1993)
Lekavý, M., Návrat, P.: Dynamic Workflow Schedule Adjusting. In: INFORMATICS 2007. Proceedings of the Ninth International Conference on Informatics, SSAKI, Bratislava, pp. 117–123 (2007) ISBN 978-80-969243-7-0
Lekavý, M., Návrat, P.: Dynamic Rescheduling as a Minimal Graph Cut Problem. In: Software Engineering in Progress: Work in Progress section of CEE-SET 2007, Poznań, pp. 141–153 (2007)
Lin, X., Janak, S.L., Floudas, C.: A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertainty. Computers and Chemical Engineering 28, 1069–1085 (2004)
Moder, J.J., Phillips, C.R., Davis, E.W.: Project management with CPM, PERT, and precedence diagramming. Van Nostrand Reinhold Company, NY (1983)
Pfeiffer, A., Kádár, B., Monostori, L.: Stability-oriented evaluation of hybrid rescheduling methods in a job-shop with machine breakdowns. In: 39th CIRP international seminar on manufacturing systems. The morphology of innovative manufacturing systems, Ljubljana, pp. 173–178 (2006)
Sabucuonglu, I., Bayiz, M.: Analysis of reactive scheduling problems in a job shop environment. European Journal of Operational Research 126, 567–586 (2000)
Sadeh, N.: Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling, Ph.D. Thesis. School of Computer Science, Carnegie Mellon University (1991)
Vin, J.P., Ierapetritou, M.G.: A new approach for efficient rescheduling of multiproduct batch plants. Industrial Engineering and Chemical Research 39, 4228–4238 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lekavý, M., Návrat, P. (2008). Extension of Rescheduling Based on Minimal Graph Cut. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)