Eintrag weiter verarbeiten
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times
Gespeichert in:
| Zeitschriftentitel: | Mathematical Problems in Engineering |
|---|---|
| Personen und Körperschaften: | , |
| In: | Mathematical Problems in Engineering, 2013, 2013, S. 1-5 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Hindawi Limited
|
| Schlagwörter: |
| author_facet |
Liu, Peng Tian, Xiaoyu Liu, Peng Tian, Xiaoyu |
|---|---|
| author |
Liu, Peng Tian, Xiaoyu |
| spellingShingle |
Liu, Peng Tian, Xiaoyu Mathematical Problems in Engineering Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times General Engineering General Mathematics |
| author_sort |
liu, peng |
| spelling |
Liu, Peng Tian, Xiaoyu 1024-123X 1563-5147 Hindawi Limited General Engineering General Mathematics http://dx.doi.org/10.1155/2013/805261 <jats:p>We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>U</mml:mi></mml:mrow></mml:math>. The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.</jats:p> Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times Mathematical Problems in Engineering |
| doi_str_mv |
10.1155/2013/805261 |
| facet_avail |
Online Free |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzgwNTI2MQ |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzgwNTI2MQ |
| institution |
DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 |
| imprint |
Hindawi Limited, 2013 |
| imprint_str_mv |
Hindawi Limited, 2013 |
| issn |
1024-123X 1563-5147 |
| issn_str_mv |
1024-123X 1563-5147 |
| language |
English |
| mega_collection |
Hindawi Limited (CrossRef) |
| match_str |
liu2013twoagentsinglemachineschedulingwithresourcedependentstartingtimes |
| publishDateSort |
2013 |
| publisher |
Hindawi Limited |
| recordtype |
ai |
| record_format |
ai |
| series |
Mathematical Problems in Engineering |
| source_id |
49 |
| title |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_unstemmed |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_full |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_fullStr |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_full_unstemmed |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_short |
Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_sort |
two-agent single-machine scheduling with resource-dependent starting times |
| topic |
General Engineering General Mathematics |
| url |
http://dx.doi.org/10.1155/2013/805261 |
| publishDate |
2013 |
| physical |
1-5 |
| description |
<jats:p>We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>U</mml:mi></mml:mrow></mml:math>. The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.</jats:p> |
| container_start_page |
1 |
| container_title |
Mathematical Problems in Engineering |
| container_volume |
2013 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792324763478130693 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T11:54:38.273Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Two-Agent+Single-Machine+Scheduling+with+Resource-Dependent+Starting+Times&rft.date=2013-01-01&genre=article&issn=1563-5147&volume=2013&spage=1&epage=5&pages=1-5&jtitle=Mathematical+Problems+in+Engineering&atitle=Two-Agent+Single-Machine+Scheduling+with+Resource-Dependent+Starting+Times&aulast=Tian&aufirst=Xiaoyu&rft_id=info%3Adoi%2F10.1155%2F2013%2F805261&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792324763478130693 |
| author | Liu, Peng, Tian, Xiaoyu |
| author_facet | Liu, Peng, Tian, Xiaoyu, Liu, Peng, Tian, Xiaoyu |
| author_sort | liu, peng |
| container_start_page | 1 |
| container_title | Mathematical Problems in Engineering |
| container_volume | 2013 |
| description | <jats:p>We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>U</mml:mi></mml:mrow></mml:math>. The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.</jats:p> |
| doi_str_mv | 10.1155/2013/805261 |
| facet_avail | Online, Free |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTE1NS8yMDEzLzgwNTI2MQ |
| imprint | Hindawi Limited, 2013 |
| imprint_str_mv | Hindawi Limited, 2013 |
| institution | DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1 |
| issn | 1024-123X, 1563-5147 |
| issn_str_mv | 1024-123X, 1563-5147 |
| language | English |
| last_indexed | 2024-03-01T11:54:38.273Z |
| match_str | liu2013twoagentsinglemachineschedulingwithresourcedependentstartingtimes |
| mega_collection | Hindawi Limited (CrossRef) |
| physical | 1-5 |
| publishDate | 2013 |
| publishDateSort | 2013 |
| publisher | Hindawi Limited |
| record_format | ai |
| recordtype | ai |
| series | Mathematical Problems in Engineering |
| source_id | 49 |
| spelling | Liu, Peng Tian, Xiaoyu 1024-123X 1563-5147 Hindawi Limited General Engineering General Mathematics http://dx.doi.org/10.1155/2013/805261 <jats:p>We consider several two-agent scheduling problems with resource consumption on a single machine, where each of the agents wants to minimize a measure dependent on its own jobs. The starting time of each job of the first agent is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumption of the first agent with the restriction that the makespan or the total completion time of the second agent cannot exceed a given bound<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>U</mml:mi></mml:mrow></mml:math>. The optimal properties and the optimal polynomial time algorithms are proposed to solve the scheduling problems.</jats:p> Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times Mathematical Problems in Engineering |
| spellingShingle | Liu, Peng, Tian, Xiaoyu, Mathematical Problems in Engineering, Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times, General Engineering, General Mathematics |
| title | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_full | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_fullStr | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_full_unstemmed | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_short | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| title_sort | two-agent single-machine scheduling with resource-dependent starting times |
| title_unstemmed | Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times |
| topic | General Engineering, General Mathematics |
| url | http://dx.doi.org/10.1155/2013/805261 |