A Semi-Online Algorithm for Single Machine Scheduling with Rejection-Reference-Cited by-同舟云学术

A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Published:2021-03-09 Issue:05 Volume:38 Page:
ISSN:0217-5959
Container-title:Asia-Pacific Journal of Operational Research
language:en
Short-container-title:Asia Pac. J. Oper. Res.

Author:

Guo Sainan¹,Ma Ran²,Zhang Yuzhong³,Fan Baoqiang⁴

Affiliation:

1. School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, P. R. China

2. School of Management Engineering, Qingdao University of Technology, Qingdao 266525, P. R. China

3. Institute of Operations Research, School of Management, Qufu Normal University, Rizhao 276826, P. R. China

4. Department of Mathematics and Information, Ludong University, Yantai 264025, P. R. China

Abstract

In this paper, a single-machine semi-online scheduling problem with rejection is addressed. In this model, “semi-online” implies that [Formula: see text], where [Formula: see text] and [Formula: see text] are the maximum processing time and the minimum one among all jobs, respectively, [Formula: see text]. In this setting, each job arrives online over time, and rejection is allowable. Our goal is minimizing the total penalty cost of rejected jobs plus the total completion time of processed jobs. The seminal result of this study is that we offer an algorithm with competitive ratio [Formula: see text], which matches the result of the problem without rejection.

Publisher

World Scientific Pub Co Pte Ltd

Subject

Management Science and Operations Research,Management Science and Operations Research

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0217595921400030

Reference28 articles.

1. Multiprocessor Scheduling with Rejection

2. An exact composite lower bound strategy for the resource-constrained project scheduling problem

3. A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

4. On-line scheduling of unit time jobs with rejection: minimizing the total completion time

5. Competitive analysis of algorithms

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-Agent Single Machine Scheduling with Deteriorating Jobs and Rejection;Mathematical Problems in Engineering;2022-11-28

2. Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence;Journal of Combinatorial Optimization;2022-06-30