The algorithms for dynamic scheduling

被引：0
|
作者：
Zhou, ZY [1 ]
Zhang, J [1 ]
Wang, H [1 ]
机构：
[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
来源：
COMPUTERS AND THEIR APPLICATIONS | 2000年
关键词：
dynamic; schedule; software; process; algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A dynamic schedule procedure and relative algorithms are designed and realized, based on P-F Methods for software processes supporting environment. It is employed as a complementary effort to static scheduling, as the process goes on, some unexpected events may occur, which lead to the disturbance to the original schedule. The concept of this approach is shrinking and extending the rescheduling objects based on the dynamic programming. The core algorithms are described.
引用
收藏
页码：280 / 283
页数：4
相关论文
共 50 条
  • [31] The study of optimized models and algorithms of dynamic fleet scheduling problem
    Wu, Yaohua
    Zhang, Wumei
    Liao, Li
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 176 - 181
  • [32] Static and dynamic scheduling algorithms for scalable Web server farm
    Casalicchio, E
    Tucci, S
    NINTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 2001, : 369 - 376
  • [33] Dynamic scheduling of manufacturing job shops using genetic algorithms
    Chryssolouris, G
    Subramaniam, V
    JOURNAL OF INTELLIGENT MANUFACTURING, 2001, 12 (03) : 281 - 293
  • [34] Dynamic Phenotype Mapping in Evolutionary Algorithms for Energy Hub Scheduling
    Poppenborg, Rafael
    Phipps, Kaleb
    Beichter, Maximilian
    Foerderer, Kevin
    Mikut, Ralf
    Hagenmeyer, Veit
    ENERGY INFORMATICS, PT II, EI.A 2024, 2025, 15272 : 205 - 223
  • [35] A contribution to shift algorithms for resource-constrained scheduling with dynamic changes
    Seda, Milos
    PROCEEDINGS OF THE 11TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS, VOL 2: SYSTEMS THEORY AND APPLICATIONS, 2007, : 401 - +
  • [36] Dynamic programming algorithms for scheduling parallel machines with family setup times
    Webster, S
    Azizoglu, M
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (02) : 127 - 137
  • [37] Complexity, bounds and dynamic programming algorithms for single track train scheduling
    Harbering, Jonas
    Ranade, Abhiram
    Schmidt, Marie
    Sinnen, Oliver
    ANNALS OF OPERATIONS RESEARCH, 2019, 273 (1-2) : 479 - 500
  • [38] A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
    Qiu, Jiaming
    Sharkey, Thomas C.
    OPTIMIZATION LETTERS, 2014, 8 (04) : 1201 - 1212
  • [39] A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
    Jiaming Qiu
    Thomas C. Sharkey
    Optimization Letters, 2014, 8 : 1201 - 1212
  • [40] Adaptive dynamic programming algorithms for sequential appointment scheduling with patient preferences
    Wang, Jin
    Fung, Richard Y. K.
    ARTIFICIAL INTELLIGENCE IN MEDICINE, 2015, 63 (01) : 33 - 40
12345