A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine
We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advan...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on discrete mathematics 2000, Vol.13 (1), p.56-63 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 63 |
|---|---|
| container_issue | 1 |
| container_start_page | 56 |
| container_title | SIAM journal on discrete mathematics |
| container_volume | 13 |
| creator | HOOGEVEEN, J. A VESTJENS, A. P. A |
| description | We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. We propose and analyze an on-line algorithm based on the following idea: As soon as the machine becomes available for processing, choose an available job with highest priority, and schedule it if its processing requirement is not too large. Otherwise, postpone the start of this job. We prove that our algorithm has performance bound $(\sqrt{5}+1)/2 \approx 1.61803$, and we show that there cannot exist a deterministic on-line algorithm with a better performance ratio for this problem. |
| doi_str_mv | 10.1137/S0895480196296823 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_925678064</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2599759421</sourcerecordid><originalsourceid>FETCH-LOGICAL-c299t-279e52ea3d67b2a747bfb982c94e073db028666f2082012d49ec8c49486c6e703</originalsourceid><addsrcrecordid>eNplkMtOwzAURC0EEqXwAewsxDZgO44fy6riJVViAawjx7lpXcVJsRNE-XoctQskVndxZuZqBqFrSu4ozeX9G1G64IpQLZgWiuUnaEaJLjJJuThFswlnEz9HFzFuCaGc02KGNgtcQRzwro_RVS3gGgYI3nUuDs7ivsta1wE27boPbth43PQBT9i7H9etsTffzo8-2Vr3BWGPB-ch2bDBMfEU6I3dpIhLdNaYNsLV8c7Rx-PD-_I5W70-vSwXq8wyrYeMSQ0FA5PXQlbMSC6rptKKWc2ByLyuCFNCiIYRxQhlNddgleWaK2EFSJLP0c0hdxf6zzFVK7f9GLr0stSsEFIRwZOIHkQ2pN4BmnIXnDdhX1JSTnuW__ZMnttjsInWtE0wnXXxj1HKXLP8F_I_dSU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>925678064</pqid></control><display><type>article</type><title>A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>HOOGEVEEN, J. A ; VESTJENS, A. P. A</creator><creatorcontrib>HOOGEVEEN, J. A ; VESTJENS, A. P. A</creatorcontrib><description>We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. We propose and analyze an on-line algorithm based on the following idea: As soon as the machine becomes available for processing, choose an available job with highest priority, and schedule it if its processing requirement is not too large. Otherwise, postpone the start of this job. We prove that our algorithm has performance bound $(\sqrt{5}+1)/2 \approx 1.61803$, and we show that there cannot exist a deterministic on-line algorithm with a better performance ratio for this problem.</description><identifier>ISSN: 0895-4801</identifier><identifier>EISSN: 1095-7146</identifier><identifier>DOI: 10.1137/S0895480196296823</identifier><identifier>CODEN: SJDMEC</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Algorithms ; Applied sciences ; Buffer inventories ; Exact sciences and technology ; Operational research and scientific management ; Operational research. Management science ; Release dates ; Schedules ; Scheduling ; Scheduling, sequencing</subject><ispartof>SIAM journal on discrete mathematics, 2000, Vol.13 (1), p.56-63</ispartof><rights>2001 INIST-CNRS</rights><rights>[Copyright] © 2000 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c299t-279e52ea3d67b2a747bfb982c94e073db028666f2082012d49ec8c49486c6e703</citedby><cites>FETCH-LOGICAL-c299t-279e52ea3d67b2a747bfb982c94e073db028666f2082012d49ec8c49486c6e703</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,4009,27902,27903,27904</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1077392$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>HOOGEVEEN, J. A</creatorcontrib><creatorcontrib>VESTJENS, A. P. A</creatorcontrib><title>A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine</title><title>SIAM journal on discrete mathematics</title><description>We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. We propose and analyze an on-line algorithm based on the following idea: As soon as the machine becomes available for processing, choose an available job with highest priority, and schedule it if its processing requirement is not too large. Otherwise, postpone the start of this job. We prove that our algorithm has performance bound $(\sqrt{5}+1)/2 \approx 1.61803$, and we show that there cannot exist a deterministic on-line algorithm with a better performance ratio for this problem.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Buffer inventories</subject><subject>Exact sciences and technology</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Release dates</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><issn>0895-4801</issn><issn>1095-7146</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNplkMtOwzAURC0EEqXwAewsxDZgO44fy6riJVViAawjx7lpXcVJsRNE-XoctQskVndxZuZqBqFrSu4ozeX9G1G64IpQLZgWiuUnaEaJLjJJuThFswlnEz9HFzFuCaGc02KGNgtcQRzwro_RVS3gGgYI3nUuDs7ivsta1wE27boPbth43PQBT9i7H9etsTffzo8-2Vr3BWGPB-ch2bDBMfEU6I3dpIhLdNaYNsLV8c7Rx-PD-_I5W70-vSwXq8wyrYeMSQ0FA5PXQlbMSC6rptKKWc2ByLyuCFNCiIYRxQhlNddgleWaK2EFSJLP0c0hdxf6zzFVK7f9GLr0stSsEFIRwZOIHkQ2pN4BmnIXnDdhX1JSTnuW__ZMnttjsInWtE0wnXXxj1HKXLP8F_I_dSU</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>HOOGEVEEN, J. A</creator><creator>VESTJENS, A. P. A</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope></search><sort><creationdate>2000</creationdate><title>A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine</title><author>HOOGEVEEN, J. A ; VESTJENS, A. P. A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c299t-279e52ea3d67b2a747bfb982c94e073db028666f2082012d49ec8c49486c6e703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Buffer inventories</topic><topic>Exact sciences and technology</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Release dates</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>HOOGEVEEN, J. A</creatorcontrib><creatorcontrib>VESTJENS, A. P. A</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><jtitle>SIAM journal on discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>HOOGEVEEN, J. A</au><au>VESTJENS, A. P. A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine</atitle><jtitle>SIAM journal on discrete mathematics</jtitle><date>2000</date><risdate>2000</risdate><volume>13</volume><issue>1</issue><spage>56</spage><epage>63</epage><pages>56-63</pages><issn>0895-4801</issn><eissn>1095-7146</eissn><coden>SJDMEC</coden><abstract>We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. We propose and analyze an on-line algorithm based on the following idea: As soon as the machine becomes available for processing, choose an available job with highest priority, and schedule it if its processing requirement is not too large. Otherwise, postpone the start of this job. We prove that our algorithm has performance bound $(\sqrt{5}+1)/2 \approx 1.61803$, and we show that there cannot exist a deterministic on-line algorithm with a better performance ratio for this problem.</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/S0895480196296823</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0895-4801 |
| ispartof | SIAM journal on discrete mathematics, 2000, Vol.13 (1), p.56-63 |
| issn | 0895-4801 1095-7146 |
| language | eng |
| recordid | cdi_proquest_journals_925678064 |
| source | LOCUS - SIAM's Online Journal Archive |
| subjects | Algorithms Applied sciences Buffer inventories Exact sciences and technology Operational research and scientific management Operational research. Management science Release dates Schedules Scheduling Scheduling, sequencing |
| title | A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T11%3A24%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20best%20possible%20deterministic%20on-line%20algorithm%20for%20minimizing%20maximum%20delivery%20time%20on%20a%20single%20machine&rft.jtitle=SIAM%20journal%20on%20discrete%20mathematics&rft.au=HOOGEVEEN,%20J.%20A&rft.date=2000&rft.volume=13&rft.issue=1&rft.spage=56&rft.epage=63&rft.pages=56-63&rft.issn=0895-4801&rft.eissn=1095-7146&rft.coden=SJDMEC&rft_id=info:doi/10.1137/S0895480196296823&rft_dat=%3Cproquest_cross%3E2599759421%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=925678064&rft_id=info:pmid/&rfr_iscdi=true |