The Stability Box for Minimizing Total Weighted Flow Time under Uncertain Data

被引:1
|
作者
Sotskov, Yuri N. [1 ]
Lai, Tsung-Chyan [2 ]
Werner, Frank [3 ]
机构
[1] Natl Acad Sci Belarus, United Inst Informat Problems, Surganova Str 6, Minsk, BELARUS
[2] Natl Taiwan Univ, Dept Business Adm, Taipei, Taiwan
[3] Otto Guericke Univ, Fac Math, Magdeburg, Germany
关键词
Single-machine scheduling; Uncertain data; Total weighted flow time; Stability analysis; REGRET;
D O I
10.1007/978-3-642-34336-0_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value from a given closed interval. The criterion is to minimize the sum of weighted completion times of the n jobs, a weight being associated with each job. For a job permutation, we study the stability box, which is a subset of the stability region. We derive an O(n log n) algorithm for constructing a job permutation with the largest dimension and volume of a stability box. The efficiency of such a permutation is demonstrated via a simulation on a set of randomly generated instances with 1000 <= n <= 2000. If several permutations have the largest dimension and volume of a stability box, the developed algorithm selects one of them due to a mid-point heuristic.
引用
收藏
页码:39 / +
页数:3
相关论文
共 50 条
  • [1] Minimizing total weighted flow time under uncertainty using dominance and a stability box
    Sotskov, Yu N.
    Lai, T. -C.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (06) : 1271 - 1289
  • [2] Minimizing Total Weighted Completion Time with Uncertain Data: A Stability Approach
    Sotskov, Yu. N.
    Egorova, N. G.
    Werner, F.
    [J]. AUTOMATION AND REMOTE CONTROL, 2010, 71 (10) : 2038 - 2057
  • [3] Minimizing total weighted completion time with uncertain data: A stability approach
    Yu. N. Sotskov
    N. G. Egorova
    F. Werner
    [J]. Automation and Remote Control, 2010, 71 : 2038 - 2057
  • [4] Minimizing Total Weighted Flow Time with Calibrations
    Chau, Vincent
    Li, Minming
    McCauley, Samuel
    Wang, Kai
    [J]. PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 67 - 76
  • [5] THE STABILITY BOX IN INTERVAL DATA FOR MINIMIZING THE SUM OF WEIGHTED COMPLETION TIMES
    Sotskov, Yuri N.
    Egorova, Natalja G.
    Lai, Tsung-Chyan
    Werner, Frank
    [J]. SIMULTECH 2011: PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON SIMULATION AND MODELING METHODOLOGIES, TECHNOLOGIES AND APPLICATIONS, 2011, : 14 - 23
  • [6] Minimizing Weighted Flow Time
    Bansal, Nikhil
    Dhamdhere, Kedar
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (04)
  • [7] Minimizing weighted flow time
    Bansal, N
    Dhamdhere, K
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 508 - 516
  • [8] Minimizing total weighted flow time of a set of jobs with interval processing times
    Sotskov, Yu. N.
    Egorova, N. G.
    Lai, T-C
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 2009, 50 (3-4) : 556 - 573
  • [9] Minimizing the total weighted flow time in a single machine with controllable processing times
    Shabtay, D
    Kaspi, M
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (13) : 2279 - 2289
  • [10] Minimizing the total weighted completion time on a single machine under linear deterioration
    Wu, Chin-Chia
    Lee, Wen-Chiung
    Shiau, Yau-Ren
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 33 (11-12): : 1237 - 1243