Single-machine online scheduling of jobs with non-delayed processing constraint
Authors: 
Wenjie Li, Jinjiang YuanAuthors Info & Claims
Wenjie Li, Jinjiang YuanAuthors Info & ClaimsPages 830 - 843
Abstract
This paper introduces a new environment of online scheduling in which jobs are scheduled under the non-delayed processing (NDP) constraint, where NDP means that the available jobs cannot be delayed for processing when some machine is idle. We study in this paper the single-machine online scheduling to minimize the maximum weighted completion time () or the maximum delivery completion time () under the NDP constraint. For the first problem, we establish a lower bound 2 and provide an online algorithm which has a competitive ratio of . We present a 3/2-competitive best possible online algorithm for the second problem.
References
[1]
Akker MVD, Hoogeveen H, and Vakhania N Restarts can help in the online minimization of the maximum delivery time on a single machine J Sched 2003 3 333-341
[2]
Allahverdi A A survey of scheduling problems with no-wait in process Eur J Oper Res 2016 255 665-686
[3]
Chai X, Lu LF, Li WH, and Zhang LQ Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time Asia Pac J Oper Res 2018 35 1850048
[4]
Chen RB and Yuan JJ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices 4OR 2020 18 177-196
[5]
Fang Y, Liu PH, and Lu XW Optimal on-line algorithms for one batch machine with grouped processing times J Comb Optim 2011 22 509-516
[6]
Hoogeveen JA and Vestjens APA A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine SIAM J Discrete Math 2000 13 56-63
[7]
Kalczynski PJ and Kamburowski J On no-wait and no-idle flow shops with makespan criterion Eur J Oper Res 2007 178 677-685
[8]
Li WJ A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion Time Asia Pac J Oper Res 2015 32 1550030
[9]
Li WH and Chai X Online scheduling on bounded batch machines to minimize the maximum weighted completion time J Oper Res Soc China 2018 6 455-465
[10]
Liu M, Chu CB, Xu YF, and Zheng FF An optimal online algorithm for single machine scheduling with bounded delivery times Eur J Oper Res 2010 201 693-700
[11]
Oron D, Shabtay D, and Steiner G Single machine scheduling with two competing agents and equal job processing times Eur J Oper Res 2015 244 86-99
[12]
Pruhs K, Sgall J, and Tong E Leung JY-T Online scheduling Handbook of scheduling: algorithm, model, and pertormance analysis 2004 Boca Raton Chapman and Hall/CRC Press
[13]
Samarghandi H A particle swarm optimization for the no-wait flow shop problem with due date constraints Int J Prod Res 2015 53 9 2853-2870
[14]
Tan ZY, Zhang A, et al. Pardalos PM et al. Online and semi-online scheduling Handbook of combinatorial optimization 2013 New York Springer
[15]
Tang LX, Feng L, and Zhen ZL integrated scheduling of production and two-stage delivery of make-to-order products: offline and online algorithms Informs J Comput 2019 31 9 493-514
[16]
Tian J, Fu RY, and Yuan JJ On-line scheduling with delivery time on a single batch machine Theor Comput Sci 2007 374 49-57
[17]
Tian J, Fu RY, and Yuan JJ A best on-line algorithm for single machine scheduling with small delivery times Theor Comput Sci 2008 393 287-293
[18]
Tian J, Fu RY, and Yuan JJ An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times Inf Process Lett 2011 111 1048-1053
[19]
Tian J, Cheng TCE, Ng CT, and Yuan JJ An improved on-line algorithm for single parallel-batch machine scheduling with delivery times Discrete Appl Math 2012 160 1191-1210
[20]
Tian J, Fu RY, and Yuan JJ Online over time scheduling on parallel-batch machines: a survey J Oper Res Soc China 2014 2 445-454
[21]
Vestjeans APA (1997) On-line machine scheduling. Ph.D. Thesis, Eindhove University of Technology, Netherlands
[22]
Yuan JJ, Ng CT, and Cheng TCE Scheduling with release dates and preemption to minimize multiple max-form objective functions Eur J Oper Res 2020 280 860-875
[23]
Yuan JJ, Li SS, Tian J, and Fu RY A best possible on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times J Comb Optim 2009 17 206-213
[24]
Zhao QL and Yuan JJ Bicriteria scheduling of equal length jobs on uniform parallel machines J Comb Optim 2020 39 637-661
Index Terms
- Single-machine online scheduling of jobs with non-delayed processing constraint
Index terms have been assigned to the content through auto-classification.
Recommendations
Online scheduling on a single machine with linear deteriorating processing times and delivery times
AbstractThis paper considers a class of problems with linear deteriorating jobs. Jobs are released over time and become known to the online scheduler until their release times. Jobs are with deteriorating processing times or deteriorating delivery times. ...
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
We consider preemptive online and semi-online scheduling of unit jobs on two uniformly related machines. Jobs are presented one by one to an algorithm, and each job has a rejection penalty associated with it. A new job can either be rejected, in which ...
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
In this paper we study the problems of scheduling jobs with agreeable processing times and due dates on a single batch processing machine to minimize total tardiness, and weighted number of tardy jobs. We prove that the problem of minimizing total ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 May 2021
Accepted: 02 March 2021
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Dec 2024