List scheduling for jobs with arbitrary release times and similar lengths
Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Rongheng [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2007 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of scheduling - Springer US, 1998, 10(2007), 6 vom: 20. Okt., Seite 365-373 |
|---|---|
| Übergeordnetes Werk: |
volume:10 ; year:2007 ; number:6 ; day:20 ; month:10 ; pages:365-373 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10951-007-0042-8 |
|---|
| Katalog-ID: |
OLC2070215229 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2070215229 | ||
| 003 | DE-627 | ||
| 005 | 20230503153448.0 | ||
| 007 | tu | ||
| 008 | 200819s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10951-007-0042-8 |2 doi | |
| 035 | |a (DE-627)OLC2070215229 | ||
| 035 | |a (DE-He213)s10951-007-0042-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 650 |q VZ |
| 084 | |a 3,2 |a 11 |2 ssgn | ||
| 084 | |a 85.03$jMethoden und Techniken der Betriebswirtschaft |2 bkl | ||
| 084 | |a 54.80$jAngewandte Informatik |2 bkl | ||
| 084 | |a 31.80$jAngewandte Mathematik |2 bkl | ||
| 100 | 1 | |a Li, Rongheng |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a List scheduling for jobs with arbitrary release times and similar lengths |
| 264 | 1 | |c 2007 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2007 | ||
| 520 | |a Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. | ||
| 650 | 4 | |a On-line scheduling | |
| 650 | 4 | |a List scheduling | |
| 650 | 4 | |a Competitive ratio | |
| 650 | 4 | |a Makespan | |
| 700 | 1 | |a Huang, Huei-Chuen |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of scheduling |d Springer US, 1998 |g 10(2007), 6 vom: 20. Okt., Seite 365-373 |w (DE-627)302724184 |w (DE-600)1492486-9 |w (DE-576)080987206 |x 1094-6136 |7 nnns |
| 773 | 1 | 8 | |g volume:10 |g year:2007 |g number:6 |g day:20 |g month:10 |g pages:365-373 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10951-007-0042-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4317 | ||
| 936 | b | k | |a 85.03$jMethoden und Techniken der Betriebswirtschaft |q VZ |0 106417320 |0 (DE-625)106417320 |
| 936 | b | k | |a 54.80$jAngewandte Informatik |q VZ |0 106417967 |0 (DE-625)106417967 |
| 936 | b | k | |a 31.80$jAngewandte Mathematik |q VZ |0 106419005 |0 (DE-625)106419005 |
| 951 | |a AR | ||
| 952 | |d 10 |j 2007 |e 6 |b 20 |c 10 |h 365-373 | ||
| author_variant |
r l rl h c h hch |
|---|---|
| matchkey_str |
article:10946136:2007----::itceuigojbwtabtayeestm |
| hierarchy_sort_str |
2007 |
| bklnumber |
85.03$jMethoden und Techniken der Betriebswirtschaft 54.80$jAngewandte Informatik 31.80$jAngewandte Mathematik |
| publishDate |
2007 |
| allfields |
10.1007/s10951-007-0042-8 doi (DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p DE-627 ger DE-627 rakwb eng 650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl Li, Rongheng verfasserin aut List scheduling for jobs with arbitrary release times and similar lengths 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. On-line scheduling List scheduling Competitive ratio Makespan Huang, Huei-Chuen aut Enthalten in Journal of scheduling Springer US, 1998 10(2007), 6 vom: 20. Okt., Seite 365-373 (DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 1094-6136 nnns volume:10 year:2007 number:6 day:20 month:10 pages:365-373 https://doi.org/10.1007/s10951-007-0042-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 54.80$jAngewandte Informatik VZ 106417967 (DE-625)106417967 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 10 2007 6 20 10 365-373 |
| spelling |
10.1007/s10951-007-0042-8 doi (DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p DE-627 ger DE-627 rakwb eng 650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl Li, Rongheng verfasserin aut List scheduling for jobs with arbitrary release times and similar lengths 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. On-line scheduling List scheduling Competitive ratio Makespan Huang, Huei-Chuen aut Enthalten in Journal of scheduling Springer US, 1998 10(2007), 6 vom: 20. Okt., Seite 365-373 (DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 1094-6136 nnns volume:10 year:2007 number:6 day:20 month:10 pages:365-373 https://doi.org/10.1007/s10951-007-0042-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 54.80$jAngewandte Informatik VZ 106417967 (DE-625)106417967 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 10 2007 6 20 10 365-373 |
| allfields_unstemmed |
10.1007/s10951-007-0042-8 doi (DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p DE-627 ger DE-627 rakwb eng 650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl Li, Rongheng verfasserin aut List scheduling for jobs with arbitrary release times and similar lengths 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. On-line scheduling List scheduling Competitive ratio Makespan Huang, Huei-Chuen aut Enthalten in Journal of scheduling Springer US, 1998 10(2007), 6 vom: 20. Okt., Seite 365-373 (DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 1094-6136 nnns volume:10 year:2007 number:6 day:20 month:10 pages:365-373 https://doi.org/10.1007/s10951-007-0042-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 54.80$jAngewandte Informatik VZ 106417967 (DE-625)106417967 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 10 2007 6 20 10 365-373 |
| allfieldsGer |
10.1007/s10951-007-0042-8 doi (DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p DE-627 ger DE-627 rakwb eng 650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl Li, Rongheng verfasserin aut List scheduling for jobs with arbitrary release times and similar lengths 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. On-line scheduling List scheduling Competitive ratio Makespan Huang, Huei-Chuen aut Enthalten in Journal of scheduling Springer US, 1998 10(2007), 6 vom: 20. Okt., Seite 365-373 (DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 1094-6136 nnns volume:10 year:2007 number:6 day:20 month:10 pages:365-373 https://doi.org/10.1007/s10951-007-0042-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 54.80$jAngewandte Informatik VZ 106417967 (DE-625)106417967 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 10 2007 6 20 10 365-373 |
| allfieldsSound |
10.1007/s10951-007-0042-8 doi (DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p DE-627 ger DE-627 rakwb eng 650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl Li, Rongheng verfasserin aut List scheduling for jobs with arbitrary release times and similar lengths 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. On-line scheduling List scheduling Competitive ratio Makespan Huang, Huei-Chuen aut Enthalten in Journal of scheduling Springer US, 1998 10(2007), 6 vom: 20. Okt., Seite 365-373 (DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 1094-6136 nnns volume:10 year:2007 number:6 day:20 month:10 pages:365-373 https://doi.org/10.1007/s10951-007-0042-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 85.03$jMethoden und Techniken der Betriebswirtschaft VZ 106417320 (DE-625)106417320 54.80$jAngewandte Informatik VZ 106417967 (DE-625)106417967 31.80$jAngewandte Mathematik VZ 106419005 (DE-625)106419005 AR 10 2007 6 20 10 365-373 |
| language |
English |
| source |
Enthalten in Journal of scheduling 10(2007), 6 vom: 20. Okt., Seite 365-373 volume:10 year:2007 number:6 day:20 month:10 pages:365-373 |
| sourceStr |
Enthalten in Journal of scheduling 10(2007), 6 vom: 20. Okt., Seite 365-373 volume:10 year:2007 number:6 day:20 month:10 pages:365-373 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
On-line scheduling List scheduling Competitive ratio Makespan |
| dewey-raw |
650 |
| isfreeaccess_bool |
false |
| container_title |
Journal of scheduling |
| authorswithroles_txt_mv |
Li, Rongheng @@aut@@ Huang, Huei-Chuen @@aut@@ |
| publishDateDaySort_date |
2007-10-20T00:00:00Z |
| hierarchy_top_id |
302724184 |
| dewey-sort |
3650 |
| id |
OLC2070215229 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2070215229</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503153448.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10951-007-0042-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2070215229</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10951-007-0042-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.80$jAngewandte Informatik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Rongheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">List scheduling for jobs with arbitrary release times and similar lengths</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">List scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive ratio</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Makespan</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Huei-Chuen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of scheduling</subfield><subfield code="d">Springer US, 1998</subfield><subfield code="g">10(2007), 6 vom: 20. Okt., Seite 365-373</subfield><subfield code="w">(DE-627)302724184</subfield><subfield code="w">(DE-600)1492486-9</subfield><subfield code="w">(DE-576)080987206</subfield><subfield code="x">1094-6136</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:6</subfield><subfield code="g">day:20</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:365-373</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10951-007-0042-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="q">VZ</subfield><subfield code="0">106417320</subfield><subfield code="0">(DE-625)106417320</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.80$jAngewandte Informatik</subfield><subfield code="q">VZ</subfield><subfield code="0">106417967</subfield><subfield code="0">(DE-625)106417967</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="q">VZ</subfield><subfield code="0">106419005</subfield><subfield code="0">(DE-625)106419005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2007</subfield><subfield code="e">6</subfield><subfield code="b">20</subfield><subfield code="c">10</subfield><subfield code="h">365-373</subfield></datafield></record></collection>
|
| author |
Li, Rongheng |
| spellingShingle |
Li, Rongheng ddc 650 ssgn 3,2 bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik misc On-line scheduling misc List scheduling misc Competitive ratio misc Makespan List scheduling for jobs with arbitrary release times and similar lengths |
| authorStr |
Li, Rongheng |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)302724184 |
| format |
Article |
| dewey-ones |
650 - Management & auxiliary services |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1094-6136 |
| topic_title |
650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl List scheduling for jobs with arbitrary release times and similar lengths On-line scheduling List scheduling Competitive ratio Makespan |
| topic |
ddc 650 ssgn 3,2 bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik misc On-line scheduling misc List scheduling misc Competitive ratio misc Makespan |
| topic_unstemmed |
ddc 650 ssgn 3,2 bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik misc On-line scheduling misc List scheduling misc Competitive ratio misc Makespan |
| topic_browse |
ddc 650 ssgn 3,2 bkl 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik misc On-line scheduling misc List scheduling misc Competitive ratio misc Makespan |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of scheduling |
| hierarchy_parent_id |
302724184 |
| dewey-tens |
650 - Management & public relations |
| hierarchy_top_title |
Journal of scheduling |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)302724184 (DE-600)1492486-9 (DE-576)080987206 |
| title |
List scheduling for jobs with arbitrary release times and similar lengths |
| ctrlnum |
(DE-627)OLC2070215229 (DE-He213)s10951-007-0042-8-p |
| title_full |
List scheduling for jobs with arbitrary release times and similar lengths |
| author_sort |
Li, Rongheng |
| journal |
Journal of scheduling |
| journalStr |
Journal of scheduling |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
365 |
| author_browse |
Li, Rongheng Huang, Huei-Chuen |
| container_volume |
10 |
| class |
650 VZ 3,2 11 ssgn 85.03$jMethoden und Techniken der Betriebswirtschaft bkl 54.80$jAngewandte Informatik bkl 31.80$jAngewandte Mathematik bkl |
| format_se |
Aufsätze |
| author-letter |
Li, Rongheng |
| doi_str_mv |
10.1007/s10951-007-0042-8 |
| normlink |
106417320 106417967 106419005 |
| normlink_prefix_str_mv |
106417320 (DE-625)106417320 106417967 (DE-625)106417967 106419005 (DE-625)106419005 |
| dewey-full |
650 |
| title_sort |
list scheduling for jobs with arbitrary release times and similar lengths |
| title_auth |
List scheduling for jobs with arbitrary release times and similar lengths |
| abstract |
Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. © Springer Science+Business Media, LLC 2007 |
| abstractGer |
Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. © Springer Science+Business Media, LLC 2007 |
| abstract_unstemmed |
Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound. © Springer Science+Business Media, LLC 2007 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_20 GBV_ILN_24 GBV_ILN_70 GBV_ILN_4029 GBV_ILN_4317 |
| container_issue |
6 |
| title_short |
List scheduling for jobs with arbitrary release times and similar lengths |
| url |
https://doi.org/10.1007/s10951-007-0042-8 |
| remote_bool |
false |
| author2 |
Huang, Huei-Chuen |
| author2Str |
Huang, Huei-Chuen |
| ppnlink |
302724184 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10951-007-0042-8 |
| up_date |
2024-07-04T00:36:08.927Z |
| _version_ |
1803606681380192256 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2070215229</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503153448.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10951-007-0042-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2070215229</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10951-007-0042-8-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.80$jAngewandte Informatik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Rongheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">List scheduling for jobs with arbitrary release times and similar lengths</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time and length in [1,r] with r≥1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m≥1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r≥4. For r<4, we give a lower bound and show that 2 provides an upper bound.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">List scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Competitive ratio</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Makespan</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Huang, Huei-Chuen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of scheduling</subfield><subfield code="d">Springer US, 1998</subfield><subfield code="g">10(2007), 6 vom: 20. Okt., Seite 365-373</subfield><subfield code="w">(DE-627)302724184</subfield><subfield code="w">(DE-600)1492486-9</subfield><subfield code="w">(DE-576)080987206</subfield><subfield code="x">1094-6136</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:6</subfield><subfield code="g">day:20</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:365-373</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10951-007-0042-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.03$jMethoden und Techniken der Betriebswirtschaft</subfield><subfield code="q">VZ</subfield><subfield code="0">106417320</subfield><subfield code="0">(DE-625)106417320</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.80$jAngewandte Informatik</subfield><subfield code="q">VZ</subfield><subfield code="0">106417967</subfield><subfield code="0">(DE-625)106417967</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.80$jAngewandte Mathematik</subfield><subfield code="q">VZ</subfield><subfield code="0">106419005</subfield><subfield code="0">(DE-625)106419005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2007</subfield><subfield code="e">6</subfield><subfield code="b">20</subfield><subfield code="c">10</subfield><subfield code="h">365-373</subfield></datafield></record></collection>
|
| score |
7.3994493 |