Dynamic scheduling and analysis of real time systems with multiprocessors  

作　　者：M.D. Nashid Anjum Honggang Wang 

机构地区：[1]University of Massachusetts Dartmouth, 285 Old Westport Rd, Dartmouth, MA 02747, USA

出　　处：《Digital Communications and Networks》2016年第3期130-138,共9页数字通信与网络（英文版）

摘　　要：This research work considers a scenario of cloud computing job-shop scheduling problems. We consider rn realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize netprofit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

关 键 词：Job-shop scheduling problemsJSPLPTSPTLSEDDTube-tapMINLP 

分 类 号：TN929.53[电子电信—通信与信息系统]