Minimizing resource consumption on uniform parallel machines with a bound on makespan
With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consum...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2013-12, Vol.40 (12), p.2970-2974 |
|---|---|
| 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 | 2974 |
|---|---|
| container_issue | 12 |
| container_start_page | 2970 |
| container_title | Computers & operations research |
| container_volume | 40 |
| creator | Ji, Min Wang, Jen-Ya Lee, Wen-Chiung |
| description | With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided. |
| doi_str_mv | 10.1016/j.cor.2013.06.011 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1530977613</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054813001688</els_id><sourcerecordid>1530977613</sourcerecordid><originalsourceid>FETCH-LOGICAL-c419t-283077fd929d34b52f33e672967c0a73b2019ecd474bb84cb078d82bc3e448233</originalsourceid><addsrcrecordid>eNp9kEtr3DAQgEVJoZu0P6A3QynkYkcvSxY9hSVNAgm5NJCbkOVxV1tbciU7Jfn1ldmQQw4ZBubyzetD6CvBFcFEnO0rG2JFMWEVFhUm5APakEayUor64QhtMMN1iWvefELHKe1xDknJBt3fOu9G9-z87yJCCku0UNjg0zJOswu-yLl414c4FpOJZhhgKEZjd85DKv65eVeYog2L71ZyNH8gTcZ_Rh97MyT48lJP0P3Pi1_bq_Lm7vJ6e35TWk7UXNKGYSn7TlHVMd7WtGcMhKRKSIuNZG3-R4HtuORt23DbYtl0DW0tA84bytgJOj3MnWL4u0Ca9eiShWEwHsKSNKkZVlIKsqLf3qD7_KzP12nCORFKcKYyRQ6UjSGlCL2eohtNfNIE61W03ussWq-iNRY6i849318mm2TN0EfjrUuvjVQqLHmzcj8OHGQjjw6iTtaBt9C5CHbWXXDvbPkPq3iSPw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1441696439</pqid></control><display><type>article</type><title>Minimizing resource consumption on uniform parallel machines with a bound on makespan</title><source>Elsevier ScienceDirect Journals</source><creator>Ji, Min ; Wang, Jen-Ya ; Lee, Wen-Chiung</creator><creatorcontrib>Ji, Min ; Wang, Jen-Ya ; Lee, Wen-Chiung</creatorcontrib><description>With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2013.06.011</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Carbon ; Completion time ; Consumption ; Environmental protection ; Exact sciences and technology ; Inventory control, production control. Distribution ; Job shops ; Lower bounds ; Makespan ; Mathematical problems ; Natural resource management ; Natural resources ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization algorithms ; Resource consumption ; Scheduling ; Scheduling, sequencing ; Studies ; Swarm intelligence ; Uniform parallel machine</subject><ispartof>Computers & operations research, 2013-12, Vol.40 (12), p.2970-2974</ispartof><rights>2013 Elsevier Ltd</rights><rights>2014 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Dec 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c419t-283077fd929d34b52f33e672967c0a73b2019ecd474bb84cb078d82bc3e448233</citedby><cites>FETCH-LOGICAL-c419t-283077fd929d34b52f33e672967c0a73b2019ecd474bb84cb078d82bc3e448233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2013.06.011$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27907481$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ji, Min</creatorcontrib><creatorcontrib>Wang, Jen-Ya</creatorcontrib><creatorcontrib>Lee, Wen-Chiung</creatorcontrib><title>Minimizing resource consumption on uniform parallel machines with a bound on makespan</title><title>Computers & operations research</title><description>With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Carbon</subject><subject>Completion time</subject><subject>Consumption</subject><subject>Environmental protection</subject><subject>Exact sciences and technology</subject><subject>Inventory control, production control. Distribution</subject><subject>Job shops</subject><subject>Lower bounds</subject><subject>Makespan</subject><subject>Mathematical problems</subject><subject>Natural resource management</subject><subject>Natural resources</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization algorithms</subject><subject>Resource consumption</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Studies</subject><subject>Swarm intelligence</subject><subject>Uniform parallel machine</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kEtr3DAQgEVJoZu0P6A3QynkYkcvSxY9hSVNAgm5NJCbkOVxV1tbciU7Jfn1ldmQQw4ZBubyzetD6CvBFcFEnO0rG2JFMWEVFhUm5APakEayUor64QhtMMN1iWvefELHKe1xDknJBt3fOu9G9-z87yJCCku0UNjg0zJOswu-yLl414c4FpOJZhhgKEZjd85DKv65eVeYog2L71ZyNH8gTcZ_Rh97MyT48lJP0P3Pi1_bq_Lm7vJ6e35TWk7UXNKGYSn7TlHVMd7WtGcMhKRKSIuNZG3-R4HtuORt23DbYtl0DW0tA84bytgJOj3MnWL4u0Ca9eiShWEwHsKSNKkZVlIKsqLf3qD7_KzP12nCORFKcKYyRQ6UjSGlCL2eohtNfNIE61W03ussWq-iNRY6i849318mm2TN0EfjrUuvjVQqLHmzcj8OHGQjjw6iTtaBt9C5CHbWXXDvbPkPq3iSPw</recordid><startdate>20131201</startdate><enddate>20131201</enddate><creator>Ji, Min</creator><creator>Wang, Jen-Ya</creator><creator>Lee, Wen-Chiung</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</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><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>20131201</creationdate><title>Minimizing resource consumption on uniform parallel machines with a bound on makespan</title><author>Ji, Min ; Wang, Jen-Ya ; Lee, Wen-Chiung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c419t-283077fd929d34b52f33e672967c0a73b2019ecd474bb84cb078d82bc3e448233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Carbon</topic><topic>Completion time</topic><topic>Consumption</topic><topic>Environmental protection</topic><topic>Exact sciences and technology</topic><topic>Inventory control, production control. Distribution</topic><topic>Job shops</topic><topic>Lower bounds</topic><topic>Makespan</topic><topic>Mathematical problems</topic><topic>Natural resource management</topic><topic>Natural resources</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization algorithms</topic><topic>Resource consumption</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Studies</topic><topic>Swarm intelligence</topic><topic>Uniform parallel machine</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ji, Min</creatorcontrib><creatorcontrib>Wang, Jen-Ya</creatorcontrib><creatorcontrib>Lee, Wen-Chiung</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><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ji, Min</au><au>Wang, Jen-Ya</au><au>Lee, Wen-Chiung</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimizing resource consumption on uniform parallel machines with a bound on makespan</atitle><jtitle>Computers & operations research</jtitle><date>2013-12-01</date><risdate>2013</risdate><volume>40</volume><issue>12</issue><spage>2970</spage><epage>2974</epage><pages>2970-2974</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>With the crucial issue of environmental protection, managing natural resources efficiently and/or reducing the amount of carbon emissions have become more important than ever. In this paper, we introduce a uniform parallel machine scheduling problem where the objective is to minimize resource consumption given that the maximum completion time does not exceed a certain level. We show that the problem is strongly NP-hard. A tight lower bound and a particle swarm optimization algorithm are then developed. Finally, some computational results are provided.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2013.06.011</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2013-12, Vol.40 (12), p.2970-2974 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1530977613 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Carbon Completion time Consumption Environmental protection Exact sciences and technology Inventory control, production control. Distribution Job shops Lower bounds Makespan Mathematical problems Natural resource management Natural resources Operational research and scientific management Operational research. Management science Operations research Optimization algorithms Resource consumption Scheduling Scheduling, sequencing Studies Swarm intelligence Uniform parallel machine |
| title | Minimizing resource consumption on uniform parallel machines with a bound on makespan |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T08%3A06%3A24IST&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=Minimizing%20resource%20consumption%20on%20uniform%20parallel%20machines%20with%20a%20bound%20on%20makespan&rft.jtitle=Computers%20&%20operations%20research&rft.au=Ji,%20Min&rft.date=2013-12-01&rft.volume=40&rft.issue=12&rft.spage=2970&rft.epage=2974&rft.pages=2970-2974&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2013.06.011&rft_dat=%3Cproquest_cross%3E1530977613%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=1441696439&rft_id=info:pmid/&rft_els_id=S0305054813001688&rfr_iscdi=true |