Scheduling Parallel Machines with a Single Server: A Dedicated Case

The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel m...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Xie Xie, Yongyue Zheng, Yanping Li
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Approximation algorithms Approximation methods Heuristics Job shop scheduling NP-hard problem Parallel machines Processor scheduling Ratio performance Schedules Scheduling Servers Single server
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	149
container_issue
container_start_page	146
container_title
container_volume
creator	Xie Xie Yongyue Zheng Yanping Li
description	The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. The single server in our problem do not only load a job on a machine which takes a certain setup time immediately before processing but also unload a job from the machine which takes a certain removal time after processing. The objective is to minimize make span. A polynomial time approximate algorithm is proposed with a tight worst-case bound at most twice as large as the optimal value.
doi_str_mv	10.1109/CSO.2012.39
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6274696</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6274696</ieee_id><sourcerecordid>6274696</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-665c2687bbdf58c0308742fe5e4d9c5cbcacfefd0167ef55d36b61e431682e163</originalsourceid><addsrcrecordid>eNotj09LxDAUxCMiKGtPHr3kC7S-JM1L4m2pf2Flhe59SZMXG6mLtFXx21vUuQzzGxgYxi4EVEKAu2rabSVByEq5I1Y4Y8Gg0zU6kMe_WdRolFCo4ZQV0_QKixYKVpyxpg09xY8hH174sx_9MNDAn3zo84Em_pXnnnveLu1AvKXxk8ZrvuY3FHPwM0Xe-InO2Unyw0TFv6_Y7u521zyUm-39Y7PelNnBXCLqINGarotJ2wAKrKllIk11dEGHLviQKEUQaChpHRV2KKhWAq0kgWrFLv9mMxHt38f85sfvPUqzXEX1AzHPScs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Scheduling Parallel Machines with a Single Server: A Dedicated Case</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xie Xie ; Yongyue Zheng ; Yanping Li</creator><creatorcontrib>Xie Xie ; Yongyue Zheng ; Yanping Li</creatorcontrib><description>The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. The single server in our problem do not only load a job on a machine which takes a certain setup time immediately before processing but also unload a job from the machine which takes a certain removal time after processing. The objective is to minimize make span. A polynomial time approximate algorithm is proposed with a tight worst-case bound at most twice as large as the optimal value.</description><identifier>ISBN: 9781467313650</identifier><identifier>ISBN: 1467313653</identifier><identifier>EISBN: 9780769546902</identifier><identifier>EISBN: 0769546900</identifier><identifier>DOI: 10.1109/CSO.2012.39</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation algorithms ; Approximation methods ; Heuristics ; Job shop scheduling ; NP-hard problem ; Parallel machines ; Processor scheduling ; Ratio performance ; Schedules ; Scheduling ; Servers ; Single server</subject><ispartof>2012 Fifth International Joint Conference on Computational Sciences and Optimization, 2012, p.146-149</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/6274696$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6274696$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xie Xie</creatorcontrib><creatorcontrib>Yongyue Zheng</creatorcontrib><creatorcontrib>Yanping Li</creatorcontrib><title>Scheduling Parallel Machines with a Single Server: A Dedicated Case</title><title>2012 Fifth International Joint Conference on Computational Sciences and Optimization</title><addtitle>cso</addtitle><description>The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. The single server in our problem do not only load a job on a machine which takes a certain setup time immediately before processing but also unload a job from the machine which takes a certain removal time after processing. The objective is to minimize make span. A polynomial time approximate algorithm is proposed with a tight worst-case bound at most twice as large as the optimal value.</description><subject>Approximation algorithms</subject><subject>Approximation methods</subject><subject>Heuristics</subject><subject>Job shop scheduling</subject><subject>NP-hard problem</subject><subject>Parallel machines</subject><subject>Processor scheduling</subject><subject>Ratio performance</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Servers</subject><subject>Single server</subject><isbn>9781467313650</isbn><isbn>1467313653</isbn><isbn>9780769546902</isbn><isbn>0769546900</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj09LxDAUxCMiKGtPHr3kC7S-JM1L4m2pf2Flhe59SZMXG6mLtFXx21vUuQzzGxgYxi4EVEKAu2rabSVByEq5I1Y4Y8Gg0zU6kMe_WdRolFCo4ZQV0_QKixYKVpyxpg09xY8hH174sx_9MNDAn3zo84Em_pXnnnveLu1AvKXxk8ZrvuY3FHPwM0Xe-InO2Unyw0TFv6_Y7u521zyUm-39Y7PelNnBXCLqINGarotJ2wAKrKllIk11dEGHLviQKEUQaChpHRV2KKhWAq0kgWrFLv9mMxHt38f85sfvPUqzXEX1AzHPScs</recordid><startdate>201206</startdate><enddate>201206</enddate><creator>Xie Xie</creator><creator>Yongyue Zheng</creator><creator>Yanping Li</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201206</creationdate><title>Scheduling Parallel Machines with a Single Server: A Dedicated Case</title><author>Xie Xie ; Yongyue Zheng ; Yanping Li</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-665c2687bbdf58c0308742fe5e4d9c5cbcacfefd0167ef55d36b61e431682e163</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Approximation algorithms</topic><topic>Approximation methods</topic><topic>Heuristics</topic><topic>Job shop scheduling</topic><topic>NP-hard problem</topic><topic>Parallel machines</topic><topic>Processor scheduling</topic><topic>Ratio performance</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Servers</topic><topic>Single server</topic><toplevel>online_resources</toplevel><creatorcontrib>Xie Xie</creatorcontrib><creatorcontrib>Yongyue Zheng</creatorcontrib><creatorcontrib>Yanping Li</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>Xie Xie</au><au>Yongyue Zheng</au><au>Yanping Li</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scheduling Parallel Machines with a Single Server: A Dedicated Case</atitle><btitle>2012 Fifth International Joint Conference on Computational Sciences and Optimization</btitle><stitle>cso</stitle><date>2012-06</date><risdate>2012</risdate><spage>146</spage><epage>149</epage><pages>146-149</pages><isbn>9781467313650</isbn><isbn>1467313653</isbn><eisbn>9780769546902</eisbn><eisbn>0769546900</eisbn><coden>IEEPAD</coden><abstract>The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. The single server in our problem do not only load a job on a machine which takes a certain setup time immediately before processing but also unload a job from the machine which takes a certain removal time after processing. The objective is to minimize make span. A polynomial time approximate algorithm is proposed with a tight worst-case bound at most twice as large as the optimal value.</abstract><pub>IEEE</pub><doi>10.1109/CSO.2012.39</doi><tpages>4</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9781467313650
ispartof	2012 Fifth International Joint Conference on Computational Sciences and Optimization, 2012, p.146-149
issn
language	eng
recordid	cdi_ieee_primary_6274696
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Approximation algorithms Approximation methods Heuristics Job shop scheduling NP-hard problem Parallel machines Processor scheduling Ratio performance Schedules Scheduling Servers Single server
title	Scheduling Parallel Machines with a Single Server: A Dedicated Case
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T22%3A18%3A56IST&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=Scheduling%20Parallel%20Machines%20with%20a%20Single%20Server:%20A%20Dedicated%20Case&rft.btitle=2012%20Fifth%20International%20Joint%20Conference%20on%20Computational%20Sciences%20and%20Optimization&rft.au=Xie%20Xie&rft.date=2012-06&rft.spage=146&rft.epage=149&rft.pages=146-149&rft.isbn=9781467313650&rft.isbn_list=1467313653&rft.coden=IEEPAD&rft_id=info:doi/10.1109/CSO.2012.39&rft_dat=%3Cieee_6IE%3E6274696%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769546902&rft.eisbn_list=0769546900&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6274696&rfr_iscdi=true