On the on-line maintenance scheduling problem

被引：2
|
作者：
Shamsaei, Fahimeh [1 ]
Telha, Claudio [1 ]
Van Vyve, Mathieu [1 ]
机构：
[1] Catholic Univ Louvain, Ctr Operat Res & Econometr, Voie Roman Pays 34, B-1348 Louvain La Neuve, Belgium
来源：
OPTIMIZATION LETTERS | 2018年 / 12卷 / 02期
关键词：
Maintenance scheduling; Competitive analysis; Randomized algorithms;
D O I：
10.1007/s11590-017-1198-6
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
A machine instantly serves requests but needs to undergo maintenance after serving a maximum of L requests. We want to maximize the number of requests served. In the on-line version, we prove that serving L requests before placing a maintenance is 0.5-competitive and is best possible for deterministic algorithms. We describe a 0.585-competitive randomized algorithm and show an upper bound of . We also analyze the empirical performance of various on-line algorithms on specific arrival distributions.
引用
收藏
页码：387 / 397
页数：11
相关论文
共 50 条
  • [1] On the on-line maintenance scheduling problem
    Fahimeh Shamsaei
    Claudio Telha
    Mathieu Van Vyve
    [J]. Optimization Letters, 2018, 12 : 387 - 397
  • [2] AN ON-LINE SCHEDULING PROBLEM OF PARALLEL MACHINES WITH COMMON MAINTENANCE TIME
    FENG Qi
    LI Wenjie
    SHANG Weiping
    CAI Yuhua
    [J]. Journal of Systems Science & Complexity, 2013, 26 (02) : 201 - 208
  • [3] An on-line scheduling problem of parallel machines with common maintenance time
    Qi Feng
    Wenjie Li
    Weiping Shang
    Yuhua Cai
    [J]. Journal of Systems Science and Complexity, 2013, 26 : 201 - 208
  • [4] An on-line scheduling problem of parallel machines with common maintenance time
    Feng Qi
    Li Wenjie
    Shang Weiping
    Cai Yuhua
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2013, 26 (02) : 201 - 208
  • [5] On an on-line scheduling problem for parallel jobs
    Naroska, E
    Schwiegelshohn, U
    [J]. INFORMATION PROCESSING LETTERS, 2002, 81 (06) : 297 - 304
  • [6] Scheduling for on-line taxi problem on a real line and competitive algorithms
    Xin, CL
    Ma, WM
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3078 - 3083
  • [7] The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
    E. Angelelli
    Á.B. Nagy
    M.G. Speranza
    Zs. Tuza
    [J]. Journal of Scheduling, 2004, 7 : 421 - 428
  • [8] The on-line multiprocessor scheduling problem with known sum of the tasks
    Angelelli, E
    Nagy, AB
    Speranza, MG
    Tuza, Z
    [J]. JOURNAL OF SCHEDULING, 2004, 7 (06) : 421 - 428
  • [9] Integrated staffing and scheduling for an aircraft line maintenance problem
    Belien, Jeroen
    Demeulemeester, Erik
    De Bruecker, Philippe
    Van den Bergh, Jorne
    Cardoen, Brecht
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 1023 - 1033
  • [10] On-line scheduling
    Sgall, J
    [J]. ONLINE ALGORITHMS: THE STATE OF THE ART, 1998, 1442 : 196 - 231
12345