A data intensive heuristic approach to the two-stage streaming scheduling problem

被引:4
|
作者
Liang, Wei [1 ,2 ]
Hu, Chunhua [1 ,2 ]
Wu, Min [3 ]
Jin, Qun [4 ]
机构
[1] Hunan Univ Commerce, Key Lab Hunan Prov Mobile Business Intelligence, Changsha, Hunan, Peoples R China
[2] Hunan Univ Commerce, Mobile E Busines Collaborat Innovat Ctr Hunan Pro, Changsha, Hunan, Peoples R China
[3] China Univ Geosci, Sch Automat, Wuhan, Hubei, Peoples R China
[4] Waseda Univ, Fac Human Sci, Tokorozawa, Saitama, Japan
关键词
Data intensive computing; Scheduling; Makespan; NP-hard; HYBRID FLOW-SHOPS; MANAGEMENT; ALGORITHM; SYSTEMS;
D O I
10.1016/j.jcss.2017.01.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Data intensive computing (DIC) provides a high performance computing approach to process large volume of data. In this study, a new formalization is introduced to present the two-stage DIC task execution in a stream manner. A novel heuristic algorithm is proposed for the scheduling problem due to the NP complexity. The theoretical approximation ratio bounds for the heuristic are analyzed and confirmed by the experimental evaluation. Overall, we observe that the proposed method conducts average 1.2 times makespan than the theoretic bound of the optimal solution. Besides, the proposed method outperforms the GA and FIFO scheduling schemes with overall improvements. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:64 / 79
页数:16
相关论文
共 50 条
  • [31] Lot streaming in a two-stage assembly hybrid flow shop scheduling problem with a work shift constraint
    Nejati, Mohsen
    Mahdavi, Iraj
    Hassanzadeh, Reza
    Mahdavi-Amiri, Nezam
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2016, 33 (07) : 459 - 471
  • [32] A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS
    Pilerood, A. E.
    Heydari, M.
    Mazdeh, M. M.
    SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, 2018, 29 (01): : 143 - 154
  • [33] A hybrid two-stage transportation and batch scheduling problem
    Tang, Lixin
    Gong, Hua
    APPLIED MATHEMATICAL MODELLING, 2008, 32 (12) : 2467 - 2479
  • [34] A discrete PSO for two-stage assembly scheduling problem
    Tian, Ye
    Liu, Dayou
    Yuan, Donghui
    Wang, Kunhao
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (1-4): : 481 - 499
  • [35] LAGRANGIAN HEURISTIC FOR THE TWO-STAGE CAPACITATED FACILITY LOCATION PROBLEM
    Litvinchev, I. S.
    Mata, M.
    Ozuna, L.
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2012, 11 (01) : 137 - 146
  • [36] A discrete PSO for two-stage assembly scheduling problem
    Ye Tian
    Dayou Liu
    Donghui Yuan
    Kunhao Wang
    The International Journal of Advanced Manufacturing Technology, 2013, 66 : 481 - 499
  • [37] Power system state scheduling with the two-stage problem
    Palamarchuk, SI
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1999, 14 (02) : 439 - 445
  • [38] A Two-Stage Multi-Objective Genetic Algorithm for a Flexible Job Shop Scheduling Problem with Lot Streaming
    Rooyani, Danial
    Defersha, Fantahun
    ALGORITHMS, 2022, 15 (07)
  • [39] Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm
    Pan, Quan-Ke
    Suganthan, Ponnuthurai N.
    Chua, Tay J.
    Cai, T. X.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 46 (9-12): : 1229 - 1237
  • [40] Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm
    Quan-Ke Pan
    Ponnuthurai N. Suganthan
    Tay J. Chua
    T. X. Cai
    The International Journal of Advanced Manufacturing Technology, 2010, 46 : 1229 - 1237