A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

Theoretical Computer Science

Volumn 457, Issue , 2012, Pages 174-180

  Yuan, Junling ^a,b   Li, Wenhua ^a   Yuan, Jinjiang ^a  

^a ZHENGZHOU UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

Author keywords

Chain precedence constraints; Competitive ratio; Equal length jobs; Online algorithm; Parallel machine scheduling

Indexed keywords

COMPETITIVE RATIO; CONSTRAINED TASKS; EQUAL-LENGTH JOBS; IDENTICAL PARALLEL MACHINES; IDENTICAL PROCESSING TIME; MAKESPAN; ON-LINE ALGORITHMS; ONLINE SCHEDULING; PRECEDENCE CONSTRAINTS; TWO MACHINES;

BUSINESS MACHINES;

SCHEDULING ALGORITHMS;

EID: 84865517303     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.07.009     Document Type: Article

References (13)

1. A. Agnetis, M. Flamini, G. Nicosia, and A. Pacifici Scheduling three chains on two parallel machines European Journal of Operational Research 202 2010 669 674
2. P. Brucker, J. Hurink, and W. Kubiak Scheduling identical jobs with chain precedence constraints on two uniform machines Mathematical Methods of Operations Research 49 1999 211 219
3. B. Chen, and A.P.A. Vestjens Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters 21 1997 165 169
4. T.C.E. Cheng, J.J. Yuan, and A.F. Yang Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times Computers and Operations Research 32 2005 849 859
5. E.G. Coffman Jr., and R.L. Graham Optimal scheduling for two-processor systems Acta Informatica 1 1972 200 213
6. J. Du, J.Y.T. Leung, and G.H. Young Scheduling chain-structured tasks to minimize makespan and mean flow time Information and Computation 2 1991 219 236
7. T.C. Hu Parallel sequencing and assembly line problems Operations Research 9 1961 841 848
8. Y. Huo, and J.Y.-T. Leung Online scheduling of precedence constrained tasks SIAM Journal on Computing 34 2005 743 762
9. Y. Huo, J.Y.-T. Leung, and X. Wang Online scheduling of equal-processing-time task systems Theoretical Computer Science 401 2008 85 95
10. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys Sequencing and scheduling: algorithms and complexity S.C. Graves, P.H. Zipkin, A.H.G. Rinnooy Kan, Logistics of Production and Inventory Handbooks Operation Research Management Science vol. 4 1993 North-Holland Amsterdam 445 522
11. P.H. Liu, X.W. Lu, and Y. Fang A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines Journal of Scheduling 15 2012 77 81
12. J. Noga, and S.S. Seiden An optimal online algorithm for scheduling two machines with release times Theoretical Computer Science 268 2001 133 143
13. J. Tian, T.C.E. Cheng, C.T. Ng, and J.J. Yuan Online scheduling on unbounded parallel-batch machines to minimize the makespan Information Processing Letters 109 2009 1211 1215