Exact performance of MULTIFIT for nonsimultaneous machines

This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performanc...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2014-04, Vol.167, p.172-187
Main Authors: Hwang, Hark-Chin, Lim, Kyungkuk
Format: Article
Language:English
Subjects:
Algorithms
Mathematical analysis
MULTIFIT
Nonsimultaneous parallel machine scheduling
Worst-case performance ratio
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3
cites cdi_FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3
container_end_page 187
container_issue
container_start_page 172
container_title Discrete Applied Mathematics
container_volume 167
creator Hwang, Hark-Chin
Lim, Kyungkuk
description This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performance ratio of MULTIFIT is 2419.
doi_str_mv 10.1016/j.dam.2013.10.022
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1531003025</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X13004502</els_id><sourcerecordid>1531003025</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3</originalsourceid><addsrcrecordid>eNp9kDFPwzAQhS0EEqXwA9gysiT4bBI7MKGqhUpFLK3EZrnOWbhK4mKnCP59XYWZ6fSe3jvdfYTcAi2AQnW_KxrdFYwCT7qgjJ2RCUjB8koIOCeTlKlyBvLjklzFuKOUQlIT8jj_0WbI9hisD53uDWbeZm-b1Xq5WK6zZGa976PrDu2ge_SHmHXafLoe4zW5sLqNePM3p2SzmK9nr_nq_WU5e17lhgs-5JrbBiiTnJcarKi0wbquJNa85pxLW1KAZqvtVlrDttRakIYb1EKw8qFmyKfkbty7D_7rgHFQnYsG23a8R0HJgVJOWZmiMEZN8DEGtGofXKfDrwKqTpzUTiVO6sTpZCVOqfM0djD98O0wqGgcJhCNC2gG1Xj3T_sIwlRvYw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1531003025</pqid></control><display><type>article</type><title>Exact performance of MULTIFIT for nonsimultaneous machines</title><source>Elsevier</source><creator>Hwang, Hark-Chin ; Lim, Kyungkuk</creator><creatorcontrib>Hwang, Hark-Chin ; Lim, Kyungkuk</creatorcontrib><description>This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performance ratio of MULTIFIT is 2419.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2013.10.022</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Mathematical analysis ; MULTIFIT ; Nonsimultaneous parallel machine scheduling ; Worst-case performance ratio</subject><ispartof>Discrete Applied Mathematics, 2014-04, Vol.167, p.172-187</ispartof><rights>2013 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3</citedby><cites>FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Hwang, Hark-Chin</creatorcontrib><creatorcontrib>Lim, Kyungkuk</creatorcontrib><title>Exact performance of MULTIFIT for nonsimultaneous machines</title><title>Discrete Applied Mathematics</title><description>This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performance ratio of MULTIFIT is 2419.</description><subject>Algorithms</subject><subject>Mathematical analysis</subject><subject>MULTIFIT</subject><subject>Nonsimultaneous parallel machine scheduling</subject><subject>Worst-case performance ratio</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kDFPwzAQhS0EEqXwA9gysiT4bBI7MKGqhUpFLK3EZrnOWbhK4mKnCP59XYWZ6fSe3jvdfYTcAi2AQnW_KxrdFYwCT7qgjJ2RCUjB8koIOCeTlKlyBvLjklzFuKOUQlIT8jj_0WbI9hisD53uDWbeZm-b1Xq5WK6zZGa976PrDu2ge_SHmHXafLoe4zW5sLqNePM3p2SzmK9nr_nq_WU5e17lhgs-5JrbBiiTnJcarKi0wbquJNa85pxLW1KAZqvtVlrDttRakIYb1EKw8qFmyKfkbty7D_7rgHFQnYsG23a8R0HJgVJOWZmiMEZN8DEGtGofXKfDrwKqTpzUTiVO6sTpZCVOqfM0djD98O0wqGgcJhCNC2gG1Xj3T_sIwlRvYw</recordid><startdate>20140420</startdate><enddate>20140420</enddate><creator>Hwang, Hark-Chin</creator><creator>Lim, Kyungkuk</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140420</creationdate><title>Exact performance of MULTIFIT for nonsimultaneous machines</title><author>Hwang, Hark-Chin ; Lim, Kyungkuk</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Mathematical analysis</topic><topic>MULTIFIT</topic><topic>Nonsimultaneous parallel machine scheduling</topic><topic>Worst-case performance ratio</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hwang, Hark-Chin</creatorcontrib><creatorcontrib>Lim, Kyungkuk</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hwang, Hark-Chin</au><au>Lim, Kyungkuk</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exact performance of MULTIFIT for nonsimultaneous machines</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2014-04-20</date><risdate>2014</risdate><volume>167</volume><spage>172</spage><epage>187</epage><pages>172-187</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>This paper considers the problem of assigning n independent jobs to m identical parallel machines with nonsimultaneous starting times. The algorithm MULTIFIT has been applied for the problem but its tight worst-case performance ratio has been unknown. In this paper we prove that the exact performance ratio of MULTIFIT is 2419.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2013.10.022</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0166-218X
ispartof Discrete Applied Mathematics, 2014-04, Vol.167, p.172-187
issn 0166-218X
1872-6771
language eng
recordid cdi_proquest_miscellaneous_1531003025
source Elsevier
subjects Algorithms
Mathematical analysis
MULTIFIT
Nonsimultaneous parallel machine scheduling
Worst-case performance ratio
title Exact performance of MULTIFIT for nonsimultaneous machines
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T15%3A33%3A54IST&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=Exact%20performance%20of%20MULTIFIT%20for%20nonsimultaneous%20machines&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Hwang,%20Hark-Chin&rft.date=2014-04-20&rft.volume=167&rft.spage=172&rft.epage=187&rft.pages=172-187&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2013.10.022&rft_dat=%3Cproquest_cross%3E1531003025%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c373t-a3fd1028335a1f76ace9968e9393338f5011dbafb8fc2b0ff18c3cea7725492e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1531003025&rft_id=info:pmid/&rfr_iscdi=true