On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption
In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 482 |
|---|---|
| container_issue | |
| container_start_page | 479 |
| container_title | |
| container_volume | |
| creator | Yundong Mu Xiao Guo |
| description | In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we consider the online rescheduling problem to minimize makespan under a limit on the maximum sequence disruption constraints and give an online algorithm of competitive ratio 3/2. |
| doi_str_mv | 10.1109/SSME.2009.44 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5233244</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5233244</ieee_id><sourcerecordid>5233244</sourcerecordid><originalsourceid>FETCH-ieee_primary_52332443</originalsourceid><addsrcrecordid>eNp9ycFqwkAQgOGFIig1N2-9zAuYzmYTkz23lh4MgvHkJSw61lEzSbNZaPv0rdCzpx_-T6mZxlhrtM9VVS7jBNHGafqgIpsXmC9sZvLE4khNboKmyMxYRd6fEVHbRZ7pYqJ2a5mvWAg25PcnOoQrywcMLZQs3PAPQeku5DsnEORAPThY_f0BWoHhdNMvbkIDFX0Gkj3BK_s-dAO3MlWjo7t6iv77qJ7eltuX9zkTUd313Lj-u84SY5I0Nff1F8u0Q3k</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yundong Mu ; Xiao Guo</creator><creatorcontrib>Yundong Mu ; Xiao Guo</creatorcontrib><description>In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we consider the online rescheduling problem to minimize makespan under a limit on the maximum sequence disruption constraints and give an online algorithm of competitive ratio 3/2.</description><identifier>ISBN: 9780769537290</identifier><identifier>ISBN: 0769537294</identifier><identifier>DOI: 10.1109/SSME.2009.44</identifier><identifier>LCCN: 200903853</identifier><language>eng</language><publisher>IEEE</publisher><subject>competitive ratio ; Conference management ; Costs ; Educational institutions ; Engineering management ; Job shop scheduling ; Manufacturing ; on-line algorithm ; Production facilities ; rescheduling ; sequence disruption ; single machine ; Single machine scheduling ; System performance ; Technology management ; time disruption</subject><ispartof>2009 IITA International Conference on Services Science, Management and Engineering, 2009, p.479-482</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5233244$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5233244$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yundong Mu</creatorcontrib><creatorcontrib>Xiao Guo</creatorcontrib><title>On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption</title><title>2009 IITA International Conference on Services Science, Management and Engineering</title><addtitle>SSME</addtitle><description>In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we consider the online rescheduling problem to minimize makespan under a limit on the maximum sequence disruption constraints and give an online algorithm of competitive ratio 3/2.</description><subject>competitive ratio</subject><subject>Conference management</subject><subject>Costs</subject><subject>Educational institutions</subject><subject>Engineering management</subject><subject>Job shop scheduling</subject><subject>Manufacturing</subject><subject>on-line algorithm</subject><subject>Production facilities</subject><subject>rescheduling</subject><subject>sequence disruption</subject><subject>single machine</subject><subject>Single machine scheduling</subject><subject>System performance</subject><subject>Technology management</subject><subject>time disruption</subject><isbn>9780769537290</isbn><isbn>0769537294</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNp9ycFqwkAQgOGFIig1N2-9zAuYzmYTkz23lh4MgvHkJSw61lEzSbNZaPv0rdCzpx_-T6mZxlhrtM9VVS7jBNHGafqgIpsXmC9sZvLE4khNboKmyMxYRd6fEVHbRZ7pYqJ2a5mvWAg25PcnOoQrywcMLZQs3PAPQeku5DsnEORAPThY_f0BWoHhdNMvbkIDFX0Gkj3BK_s-dAO3MlWjo7t6iv77qJ7eltuX9zkTUd313Lj-u84SY5I0Nff1F8u0Q3k</recordid><startdate>200907</startdate><enddate>200907</enddate><creator>Yundong Mu</creator><creator>Xiao Guo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200907</creationdate><title>On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption</title><author>Yundong Mu ; Xiao Guo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_52332443</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>competitive ratio</topic><topic>Conference management</topic><topic>Costs</topic><topic>Educational institutions</topic><topic>Engineering management</topic><topic>Job shop scheduling</topic><topic>Manufacturing</topic><topic>on-line algorithm</topic><topic>Production facilities</topic><topic>rescheduling</topic><topic>sequence disruption</topic><topic>single machine</topic><topic>Single machine scheduling</topic><topic>System performance</topic><topic>Technology management</topic><topic>time disruption</topic><toplevel>online_resources</toplevel><creatorcontrib>Yundong Mu</creatorcontrib><creatorcontrib>Xiao Guo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yundong Mu</au><au>Xiao Guo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption</atitle><btitle>2009 IITA International Conference on Services Science, Management and Engineering</btitle><stitle>SSME</stitle><date>2009-07</date><risdate>2009</risdate><spage>479</spage><epage>482</epage><pages>479-482</pages><isbn>9780769537290</isbn><isbn>0769537294</isbn><abstract>In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we consider the online rescheduling problem to minimize makespan under a limit on the maximum sequence disruption constraints and give an online algorithm of competitive ratio 3/2.</abstract><pub>IEEE</pub><doi>10.1109/SSME.2009.44</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780769537290 |
| ispartof | 2009 IITA International Conference on Services Science, Management and Engineering, 2009, p.479-482 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5233244 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | competitive ratio Conference management Costs Educational institutions Engineering management Job shop scheduling Manufacturing on-line algorithm Production facilities rescheduling sequence disruption single machine Single machine scheduling System performance Technology management time disruption |
| title | On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T23%3A19%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On-Line%20Rescheduling%20to%20Minimize%20Makespan%20under%20a%20Limit%20on%20the%20Maximum%20Sequence%20Disruption&rft.btitle=2009%20IITA%20International%20Conference%20on%20Services%20Science,%20Management%20and%20Engineering&rft.au=Yundong%20Mu&rft.date=2009-07&rft.spage=479&rft.epage=482&rft.pages=479-482&rft.isbn=9780769537290&rft.isbn_list=0769537294&rft_id=info:doi/10.1109/SSME.2009.44&rft_dat=%3Cieee_6IE%3E5233244%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5233244&rfr_iscdi=true |