Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness

被引：2
|
作者：
Liu, Qijia [1 ,2 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Henan Agr Univ, Coll Informat & Management Sci, Zhengzhou 450003, Henan, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2016年 / 32卷 / 02期
关键词：
Single machine scheduling; Online algorithms; Competitive ratio; Bicriteria optimization; TIME;
D O I：
10.1007/s10878-015-9918-2
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the following single machine online tradeoff scheduling problem. A set of n independent jobs arrive online over time. Each job has a release date , a processing time and a delivery time . The characteristics of a job are unknown until it arrives. The goal is to find a schedule that minimizes the makespan and the maximum lateness , where . For the problem, we present a nondominated -competitive online algorithm for each with 1 <= rho <=root 2 + 1/2.
引用
收藏
页码：385 / 395
页数：11
相关论文
共 50 条
  • [1] Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
    Qijia Liu
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2016, 32 : 385 - 395
  • [2] Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 234 - 240
  • [3] Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time
    Ma, Ran
    Yuan, Jinjiang
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 158 : 114 - 119
  • [4] Rescheduling for machine disruption to minimize makespan and maximum lateness
    Liu, Zhixin
    Ro, Young K.
    [J]. JOURNAL OF SCHEDULING, 2014, 17 (04) : 339 - 352
  • [5] Rescheduling for machine disruption to minimize makespan and maximum lateness
    Zhixin Liu
    Young K. Ro
    [J]. Journal of Scheduling, 2014, 17 : 339 - 352
  • [6] Single-machine scheduling to stochastically minimize maximum lateness
    Xiaoqiang Cai
    Liming Wang
    Xian Zhou
    [J]. Journal of Scheduling, 2007, 10 : 293 - 301
  • [7] Single-machine scheduling to stochastically minimize maximum lateness
    Cai, Xiaoqiang
    Wang, Liming
    Zhou, Xian
    [J]. JOURNAL OF SCHEDULING, 2007, 10 (4-5) : 293 - 301
  • [8] Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 570 : 22 - 29
  • [9] Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
    Liron Yedidsion
    [J]. Journal of Scheduling, 2012, 15 : 665 - 679
  • [10] Scheduling an unbounded batch machine to minimize maximum lateness
    Bai, Shuyan
    Zhang, Fuzeng
    Li, Shuguang
    Liu, Qiming
    [J]. FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 172 - +
12345