Batch scheduling with deadlines on parallel machines: An NP-hard case
The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups h...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1997-10, Vol.64 (2), p.69-74 |
|---|---|
| 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 | 74 |
|---|---|
| container_issue | 2 |
| container_start_page | 69 |
| container_title | Information processing letters |
| container_volume | 64 |
| creator | Kovalyov, Mikhail Y. Shafransky, Yakov M. |
| description | The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups have equal deadlines. We prove that the problem is strongly NP-hard for the case of different deadlines, identical machines, unit processing times and unit set-up times, and equal numbers of jobs in each group. The problem where machine deadlines are given instead of job deadlines is proved to be strongly NP-complete. |
| doi_str_mv | 10.1016/S0020-0190(97)00154-3 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237276933</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019097001543</els_id><sourcerecordid>23413565</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-72183c4cf632fcdd24d6ee01e9ffb165b9bdd85775e885918965d557428ac30c3</originalsourceid><addsrcrecordid>eNqFkN1LwzAUxYMoOKd_ghDEB32o5qNJGl9kjvkBQwX1OWTJre3o2pl0iv-97Tb26tPlXn7nHO5B6JSSK0qovH4jhJGEUE0utLokhIo04XtoQDPFEkmp3keDHXKIjmKcE0JkytUATe5s6wocXQF-VZX1J_4p2wJ7sL7bIOKmxksbbFVBhRfWFf3xBo9q_PyaFDZ47GyEY3SQ2yrCyXYO0cf95H38mExfHp7Go2niuORtohjNuEtdLjnLnfcs9RKAUNB5PqNSzPTM-0woJSDLhKaZlsILoVKWWceJ40N0tvFdhuZrBbE182YV6i7SMK6YkprzDhIbyIUmxgC5WYZyYcOvocT0hZl1YaZvw2hl1oWZXne-NbfR2SoPtnZl3IkZEZxT3WG3Gwy6R79LCCa6EmoHvgzgWuOb8p-gP0hQfR0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237276933</pqid></control><display><type>article</type><title>Batch scheduling with deadlines on parallel machines: An NP-hard case</title><source>Elsevier ScienceDirect Journals</source><creator>Kovalyov, Mikhail Y. ; Shafransky, Yakov M.</creator><creatorcontrib>Kovalyov, Mikhail Y. ; Shafransky, Yakov M.</creatorcontrib><description>The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups have equal deadlines. We prove that the problem is strongly NP-hard for the case of different deadlines, identical machines, unit processing times and unit set-up times, and equal numbers of jobs in each group. The problem where machine deadlines are given instead of job deadlines is proved to be strongly NP-complete.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/S0020-0190(97)00154-3</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Batching ; Computational complexity ; Computer science; control theory; systems ; Exact sciences and technology ; Parallel machine scheduling ; Parallel processing ; Production scheduling ; Studies ; Theoretical computing</subject><ispartof>Information processing letters, 1997-10, Vol.64 (2), p.69-74</ispartof><rights>1997</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Oct 28, 1997</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-72183c4cf632fcdd24d6ee01e9ffb165b9bdd85775e885918965d557428ac30c3</citedby><cites>FETCH-LOGICAL-c363t-72183c4cf632fcdd24d6ee01e9ffb165b9bdd85775e885918965d557428ac30c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0020019097001543$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2053319$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><creatorcontrib>Shafransky, Yakov M.</creatorcontrib><title>Batch scheduling with deadlines on parallel machines: An NP-hard case</title><title>Information processing letters</title><description>The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups have equal deadlines. We prove that the problem is strongly NP-hard for the case of different deadlines, identical machines, unit processing times and unit set-up times, and equal numbers of jobs in each group. The problem where machine deadlines are given instead of job deadlines is proved to be strongly NP-complete.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Batching</subject><subject>Computational complexity</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Parallel machine scheduling</subject><subject>Parallel processing</subject><subject>Production scheduling</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1997</creationdate><recordtype>article</recordtype><recordid>eNqFkN1LwzAUxYMoOKd_ghDEB32o5qNJGl9kjvkBQwX1OWTJre3o2pl0iv-97Tb26tPlXn7nHO5B6JSSK0qovH4jhJGEUE0utLokhIo04XtoQDPFEkmp3keDHXKIjmKcE0JkytUATe5s6wocXQF-VZX1J_4p2wJ7sL7bIOKmxksbbFVBhRfWFf3xBo9q_PyaFDZ47GyEY3SQ2yrCyXYO0cf95H38mExfHp7Go2niuORtohjNuEtdLjnLnfcs9RKAUNB5PqNSzPTM-0woJSDLhKaZlsILoVKWWceJ40N0tvFdhuZrBbE182YV6i7SMK6YkprzDhIbyIUmxgC5WYZyYcOvocT0hZl1YaZvw2hl1oWZXne-NbfR2SoPtnZl3IkZEZxT3WG3Gwy6R79LCCa6EmoHvgzgWuOb8p-gP0hQfR0</recordid><startdate>19971028</startdate><enddate>19971028</enddate><creator>Kovalyov, Mikhail Y.</creator><creator>Shafransky, Yakov M.</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19971028</creationdate><title>Batch scheduling with deadlines on parallel machines: An NP-hard case</title><author>Kovalyov, Mikhail Y. ; Shafransky, Yakov M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-72183c4cf632fcdd24d6ee01e9ffb165b9bdd85775e885918965d557428ac30c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Batching</topic><topic>Computational complexity</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Parallel machine scheduling</topic><topic>Parallel processing</topic><topic>Production scheduling</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kovalyov, Mikhail Y.</creatorcontrib><creatorcontrib>Shafransky, Yakov M.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kovalyov, Mikhail Y.</au><au>Shafransky, Yakov M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Batch scheduling with deadlines on parallel machines: An NP-hard case</atitle><jtitle>Information processing letters</jtitle><date>1997-10-28</date><risdate>1997</risdate><volume>64</volume><issue>2</issue><spage>69</spage><epage>74</epage><pages>69-74</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. (1997) and Kovalyov and Shafransky (1994). A classification of computational complexities of special cases was provided only for the situation when all groups have equal deadlines. We prove that the problem is strongly NP-hard for the case of different deadlines, identical machines, unit processing times and unit set-up times, and equal numbers of jobs in each group. The problem where machine deadlines are given instead of job deadlines is proved to be strongly NP-complete.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0020-0190(97)00154-3</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1997-10, Vol.64 (2), p.69-74 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237276933 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Batching Computational complexity Computer science control theory systems Exact sciences and technology Parallel machine scheduling Parallel processing Production scheduling Studies Theoretical computing |
| title | Batch scheduling with deadlines on parallel machines: An NP-hard 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-21T22%3A51%3A58IST&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=Batch%20scheduling%20with%20deadlines%20on%20parallel%20machines:%20An%20NP-hard%20case&rft.jtitle=Information%20processing%20letters&rft.au=Kovalyov,%20Mikhail%20Y.&rft.date=1997-10-28&rft.volume=64&rft.issue=2&rft.spage=69&rft.epage=74&rft.pages=69-74&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/S0020-0190(97)00154-3&rft_dat=%3Cproquest_cross%3E23413565%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=237276933&rft_id=info:pmid/&rft_els_id=S0020019097001543&rfr_iscdi=true |