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 条

[31] Online scheduling on a single machine with one restart for all jobs to minimize the weighted makespan
Liang, Xiaoxiao
Lu, Lingfa
Sun, Xueke
Yu, Xue
Zuo, Lili
[J]. AIMS MATHEMATICS, 2024, 9 (01): : 2518 - 2529
[32] Stochastic scheduling to minimize expected maximum lateness
Wu, Xianyi
Zhou, Xian
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (01) : 103 - 115
[33] Vehicle scheduling on a tree to minimize maximum lateness
Karuno, Y
Nagamochi, H
Ibaraki, T
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996, 39 (03) : 345 - 355
[34] Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Yuan, J. J.
Ng, C. T.
Cheng, T. C. E.
[J]. JOURNAL OF SCHEDULING, 2015, 18 (02) : 147 - 153
[35] A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
Yuan, JJ
Yang, AF
Cheng, TCE
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (02) : 525 - 528
[36] Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Allahverdi, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (10) : 909 - 916
[37] Scheduling a two-machine flowshop with travel times to minimize maximum lateness
Stevens, JW
Gemmill, DD
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (01) : 1 - 15
[38] Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
J. J. Yuan
C. T. Ng
T. C. E. Cheng
[J]. Journal of Scheduling, 2015, 18 : 147 - 153
[39] A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
Hinder, Oliver
Mason, Andrew J.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (02) : 411 - 423
[40] Single-machine scheduling with periodic maintenance to minimize makespan
Ji, Min
He, Yong
Cheng, T. C. E.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (06) : 1764 - 1770

← 1 2 3 4 5 →