Two competing agents with due date assignment scheduling under multitasking environment
We consider multitasking scheduling on a single machine involving two competing agents, in which the due date of each job of the first agent is a decision variable, which is to be determined by the decision maker using unrestricted due date method, whereas the due date of the jobs in the second agen...
Gespeichert in:
| Veröffentlicht in: | 2019 International Conference on Industrial Engineering and Systems Management (IESM) S. 1 - 6 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.09.2019
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider multitasking scheduling on a single machine involving two competing agents, in which the due date of each job of the first agent is a decision variable, which is to be determined by the decision maker using unrestricted due date method, whereas the due date of the jobs in the second agent is exogenously given. By multitasking, we mean that the processing of a selected job on the machine may be interrupted by other jobs that are available but unfinished. The first agent's objective value is to minimize an integrated scheduling criterion including the due date assignment cost and the weighted number of its tardy jobs, while the second agent's objective value is to minimize the maximum value of a regular scheduling function of its jobs. The overall objective is to minimize the objective value of the first agent, subject to the objective value of the second agent not exceeding a given threshold. For each of the problems considered, we show that it is NP-hard in the ordinary sense and admits pseudo-polynomial time algorithm. |
|---|---|
| AbstractList | We consider multitasking scheduling on a single machine involving two competing agents, in which the due date of each job of the first agent is a decision variable, which is to be determined by the decision maker using unrestricted due date method, whereas the due date of the jobs in the second agent is exogenously given. By multitasking, we mean that the processing of a selected job on the machine may be interrupted by other jobs that are available but unfinished. The first agent's objective value is to minimize an integrated scheduling criterion including the due date assignment cost and the weighted number of its tardy jobs, while the second agent's objective value is to minimize the maximum value of a regular scheduling function of its jobs. The overall objective is to minimize the objective value of the first agent, subject to the objective value of the second agent not exceeding a given threshold. For each of the problems considered, we show that it is NP-hard in the ordinary sense and admits pseudo-polynomial time algorithm. |
| Author | Yang, Yongjian Shi, Qian Yin, Yunqiang |
| Author_xml | – sequence: 1 givenname: Yongjian surname: Yang fullname: Yang, Yongjian organization: University of Electronic Science and Technology of China,School of Management and Economics,Chengdu,China – sequence: 2 givenname: Yunqiang surname: Yin fullname: Yin, Yunqiang organization: University of Electronic Science and Technology of China,School of Management and Economics,Chengdu,China – sequence: 3 givenname: Qian surname: Shi fullname: Shi, Qian organization: University of Electronic Science and Technology of China,School of Management and Economics,Chengdu,China |
| BookMark | eNotj91KwzAcxSPohdt8AkHyAq35aJvkUsbUwcSLTbwcafJPF2zT0aQO395Od3XgnB-Hc2boOvQBEHqgJKeUqMf1avtWlKKUOSNU5VIVkhF-hWZUMElpWVX8Fn3uTj02fXeE5EODdQMhRXzy6YDtCNjqBFjH6JvQTQmO5gB2bM_oGCwMuBvb5JOOX2cLwrcf-j9ygW6cbiPcXXSOPp5Xu-Vrtnl_WS-fNpmftqRMM06dY84KoS3nitYFIbwWVSVpZaxhUEgoHXGUCUGcMlYxArWoJ5JzZ_gc3f_3egDYHwff6eFnf_nKfwEbKVDr |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/IESM45758.2019.8948203 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1728115663 9781728115665 |
| EndPage | 6 |
| ExternalDocumentID | 8948203 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i203t-a231ff2fd77ad3391b4003b766816cdc2e48e5f0f12770f9cd920eb7b91b33fc3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000537748200073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Mon Jul 08 05:38:50 EDT 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-a231ff2fd77ad3391b4003b766816cdc2e48e5f0f12770f9cd920eb7b91b33fc3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_8948203 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-Sept. |
| PublicationDateYYYYMMDD | 2019-09-01 |
| PublicationDate_xml | – month: 09 year: 2019 text: 2019-Sept. |
| PublicationDecade | 2010 |
| PublicationTitle | 2019 International Conference on Industrial Engineering and Systems Management (IESM) |
| PublicationTitleAbbrev | IESM |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.7051316 |
| Snippet | We consider multitasking scheduling on a single machine involving two competing agents, in which the due date of each job of the first agent is a decision... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Collaboration DIF due date assignment dynamic programming Knowledge representation multitasking scheduling Product design Product development Stakeholders Technological innovation two agent |
| Title | Two competing agents with due date assignment scheduling under multitasking environment |
| URI | https://ieeexplore.ieee.org/document/8948203 |
| WOSCitedRecordID | wos000537748200073&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhEJ20jQdPalrjdzh4FLsLLCxnY-PFpocae2v4GtNLa9qt_n2BbaomXryRCQlkgLzHMI8BuHVVhYUXNbUoHRW6ZFRLGygTQXrr0aPGXGxCjcf1bKYnHbjba2FCCDn5LNynZn7L9yu3TaGyYa1FBCzeha5SstVq7US_ZaGHkT49i8g-csJW3AFt519VUzJojI7-N9wxDL7Vd2Syx5UT6IRlH16nnyviMsmNRmKSImpDUhSV-G0g6d5OIg9evOXXfRLvrBFDktScJJXYmuTEwcZsUmSc_FC3DeBl9Dh9eKK7ogh0EefSUBMJGSJDr5TxnOvSxlPIrZKyLqXzjgVRh-h_LJlSBWrnNSuCVTb25BwdP4XecrUMZ0CE9BHAKiyDQ1FzaaREzwyaQhtXoT2HfnLK_L3992K-88fF3-ZLOEx-b_OvrqDXrLfhGg7cR7PYrG_yYn0BYo6bAA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjld1tt7s9GwlGIBwwciP9GsMFDCz6923LBjXx4q2ZNGnTafNep_M6ALcmzzGxvKQahaFcphmVQjuacSestmhRYiw2UQyH5WQiRw2422phnHMx-czdh2Z8y7cLsw6hsk4puQcstgO7oXJWrdaqZb9pIjueQA245x8xZcvvgU33X3VTImx0D_834BG0v_V3ZLRFlmNouHkLXsefC2IizfVGooImakVCHJXYtSPh5k48E569xfd94m-tHkWC2JwEndiSxNTBSq1CbJz80Le14aX7OH7o0bosAp35uVRUeUqGmKEtCmUZk6n255DpQogyFcaazPHSeQ9gmhVFgtJYmSVOF9r3ZAwNO4HmfDF3p0C4sB7CckydQV4yoYRAmylUiVQmR30GrbAo0_fNzxfTej3O_zbfwH5vPOhP-0_D5ws4CD7YZGNdQrNart0V7JmParZaXkfHfQGh3J5J |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2019+International+Conference+on+Industrial+Engineering+and+Systems+Management+%28IESM%29&rft.atitle=Two+competing+agents+with+due+date+assignment+scheduling+under+multitasking+environment&rft.au=Yang%2C+Yongjian&rft.au=Yin%2C+Yunqiang&rft.au=Shi%2C+Qian&rft.date=2019-09-01&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FIESM45758.2019.8948203&rft.externalDocID=8948203 |