On-line Scheduling for Jobs with Arbitrary Release Times

Li, R.; Huang, Haibo

doi:10.1007/s00607-004-0067-1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction5

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2007

2022

Publication Types

Select...

Article7

Book2

Relationship

Self Cite0

Independent9

Authors

Journals

Cited by 15 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, this kind of online model was first proposed by Li and Huang [8]. In their paper, each job has a release time and a processing time; jobs cannot be scheduled before their release time.…”

Section: Introductionmentioning

confidence: 99%

Online bin packing with arbitrary release times

Shi

2008

Theoretical Computer Science

View full text Add to dashboard Cite

We study a new variant of the online bin-packing problem, in which each item a i is associated with a size a i and also a release time r i so that it must be placed at least r i above the bottom of a bin. Items arrive in turn and must be assigned without any knowledge of subsequent items. The goal is to pack all items into unit-size bins using the minimum number of bins. We study the problem with all items have equal size. First, we show that the ANY FIT algorithm cannot be approximated within any constant. Then we present a best possible online algorithm with asymptotic competitive ratio of two.

show abstract

Section: Introductionmentioning

confidence: 99%

Online bin packing with arbitrary release times

Shi

2008

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Motivated by air cargo import terminal problem, a generalization of the Graham's classical on-line scheduling problem was proposed by Li and Huang [8] [9]. They describe the requests of all jobs in terms of order, where for any job list…”

Section: Introductionmentioning

confidence: 99%

Better Algorithm for Order On-Line Scheduling on Uniform Machines

Li¹,

Yun-xia²

2019

IJIS

View full text Add to dashboard Cite

show abstract

“…In this online situation, the jobs' release times are assumed to be arbitrary. If all jobs' release times are zero, then the problem in Li and Huang [2] becomes the same as the Graham's classical on-line scheduling problem.…”

Section: Introductionmentioning

confidence: 99%