Extension of rescheduling based on minimal graph cut

被引：0
|
作者：
Lekavy, Marian [1 ]
Navrat, Pavel [1 ]
机构：
[1] Slovak Tech Univ Bratislava, Fac Informat & Informat Technol, Bratislava 84216, Slovakia
来源：
SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE | 2008年 / 4910卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：340 / 351
页数：12
相关论文
共 50 条
  • [41] Graph cut based image segmentation with connectivity priors
    Vicente, Sara
    Kolmogorov, Vladimir
    Rother, Carsten
    2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, : 767 - +
  • [42] Iterative Min Cut Clustering Based on Graph Cuts
    Liu, Bowen
    Liu, Zhaoying
    Li, Yujian
    Zhang, Ting
    Zhang, Zhilin
    SENSORS, 2021, 21 (02) : 1 - 10
  • [43] A graph clustering algorithm based on minimum and normalized cut
    Wang, Jiabing
    Peng, Hong
    Hu, Jingsong
    Yang, Chuangxin
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 1, PROCEEDINGS, 2007, 4487 : 497 - +
  • [44] Complex Scene Text Binarization based on Graph Cut
    Huang Jian
    Liu Xiao-Pei
    Zhao Qian
    2016 IEEE INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC), 2016, : 691 - 695
  • [45] EXHAUSTIVE GRAPH CUT-BASED VASCULATURE RECONSTRUCTION
    Unberath, Mathias
    Achenbach, Stephan
    Fahrig, Rebecca
    Maier, Andreas
    2016 IEEE 13TH INTERNATIONAL SYMPOSIUM ON BIOMEDICAL IMAGING (ISBI), 2016, : 1143 - 1146
  • [46] Clustering based on local density peaks and graph cut
    Long, Zhiguo
    Gao, Yang
    Meng, Hua
    Yao, Yuqin
    Li, Tianrui
    INFORMATION SCIENCES, 2022, 600 : 263 - 286
  • [47] Gabor filter and graph cut based texture analysis
    Jirík, M.
    Ryba, T.
    Zelezný, M.
    Pattern Recognition and Image Analysis, 2012, 22 (01) : 215 - 220
  • [48] Deep Q-Network Approach for Train Timetable Rescheduling Based on Alternative Graph
    Kim, Kyung-Min
    Rho, Hag-Lae
    Park, Bum-Hwan
    Min, Yun-Hong
    APPLIED SCIENCES-BASEL, 2023, 13 (17):
  • [49] Extension without cut
    Strassburger, Lutz
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (12) : 1995 - 2007
  • [50] ONE ALGORITHM FOR DETERMINATION OF THE MINIMAL CUT SETS OF EDGES OF A GRAPH REPRESENTING A COMMUNICATION-NETWORK
    PAVNITJEV, PK
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1981, (02): : 62 - 64
12345