A hybrid heuristic for agent-based scheduling problem with an ordinal scale objective criterion

Scheduling with multiple agents and learning effects has attracted growing attention of the scheduling research community. However, scheduling research together with learning, multiple agents and release times considerations is few. This paper considers two-agent single-machine scheduling with a pos...

Full description

Saved in:
Bibliographic Details
Published inJournal of information & optimization sciences Vol. 42; no. 1; pp. 109 - 134
Main Authors Chao, Yuan-Po, Cheng, Shuenn-Ren, Shih, Cheng-Hsiung, Yu, Kejian, Hsu, Peng-Hsiang, Chen, Hau, Wu, Wen-Hsiang
Format Journal Article
LanguageEnglish
Published Taylor & Francis 02.01.2021
Subjects
Due dates
Learning effect
Primary: 90B35
Release dates
Scheduling
Secondary: 90C26
Two-agents
Online AccessGet full text
ISSN0252-2667
2169-0103
DOI10.1080/02522667.2020.1715574

Cover

Abstract Scheduling with multiple agents and learning effects has attracted growing attention of the scheduling research community. However, scheduling research together with learning, multiple agents and release times considerations is few. This paper considers two-agent single-machine scheduling with a position-based learning effect. The criterion measurement is to minimize the number of the tardy jobs of the first agent subject to the condition that the second agent has no tardy job. A branch-and-bound and a hybrid heuristic are proposed to solve the problem.
AbstractList Scheduling with multiple agents and learning effects has attracted growing attention of the scheduling research community. However, scheduling research together with learning, multiple agents and release times considerations is few. This paper considers two-agent single-machine scheduling with a position-based learning effect. The criterion measurement is to minimize the number of the tardy jobs of the first agent subject to the condition that the second agent has no tardy job. A branch-and-bound and a hybrid heuristic are proposed to solve the problem.
Author Yu, Kejian
Chen, Hau
Chao, Yuan-Po
Hsu, Peng-Hsiang
Wu, Wen-Hsiang
Shih, Cheng-Hsiung
Cheng, Shuenn-Ren
Author_xml – sequence: 1
  givenname: Yuan-Po
  surname: Chao
  fullname: Chao, Yuan-Po
  email: rainbow@gcloud.csu.edu.tw
  organization: Cheng Shiu University
– sequence: 2
  givenname: Shuenn-Ren
  surname: Cheng
  fullname: Cheng, Shuenn-Ren
  organization: Cheng Shiu University
– sequence: 3
  givenname: Cheng-Hsiung
  surname: Shih
  fullname: Shih, Cheng-Hsiung
  organization: Cheng Shiu University
– sequence: 4
  givenname: Kejian
  surname: Yu
  fullname: Yu, Kejian
  organization: Zhejiang Shuren University
– sequence: 5
  givenname: Peng-Hsiang
  surname: Hsu
  fullname: Hsu, Peng-Hsiang
  organization: University of Kang-Ning
– sequence: 6
  givenname: Hau
  surname: Chen
  fullname: Chen, Hau
  organization: Feng Chia University
– sequence: 7
  givenname: Wen-Hsiang
  surname: Wu
  fullname: Wu, Wen-Hsiang
  organization: Yuanpei University of Medical Technology
BookMark eNp9kMtqwzAQRUVJoUnaTyjoB5xKsmTJu4bQFwS6addClkexgiMFyWnI39ch6barGYZzL8yZoUmIARB6pGRBiSJPhAnGqkouGGHjSVIhJL9BU0aruiCUlBM0PTPFGbpDs5y3hPC6InKK9BJ3pyb5FndwSD4P3mIXEzYbCEPRmAwtzraD9tD7sMH7FJsedvjohw6bgGNqfTD9iJgecGy2YAf_A9gmP0DyMdyjW2f6DA_XOUffry9fq_di_fn2sVquC0uVGoqKOyWZFY1TjqmKS1pay4CVSo5L3XApa1JxIWrHHTesbYELRZwjIGslm3KOxKXXpphzAqf3ye9MOmlK9NmS_rOkz5b01dKYe77kfBjf3pljTH2rB3PqY3LJBOuzLv-v-AUi9XEn
Cites_doi 10.1007/s10878-006-9001-0
10.1080/09720502.2017.1311041
10.1016/j.tcs.2006.07.011
10.1504/IJSTL.2013.050590
10.1016/j.cor.2006.12.019
10.1016/j.ejor.2006.01.030
10.1016/j.ejor.2007.05.040
10.3390/info2030528
10.1016/j.apm.2010.03.011
10.1007/978-3-642-41880-8
10.1016/j.cor.2004.04.001
10.1016/j.amc.2011.04.005
10.1080/00207543.2017.1355576
10.1007/s10845-011-0525-5
10.1287/opre.1030.0092
10.1109/TSMCA.2011.2147305
10.1023/A:1022231419049
10.1016/j.ejor.2011.05.041
10.1007/s10898-017-0509-x
10.1016/S0377-2217(98)00246-X
10.1016/j.apm.2010.11.026
10.1007/s00170-009-2259-5
10.1057/jors.2016.40
10.1016/0377-2217(95)00351-7
10.1016/j.ejor.2010.03.003
10.1057/jors.2013.19
10.1016/j.ejor.2010.01.005
10.1007/s40995-016-0080-1
10.7494/dmms.2011.5.1.19
10.1016/j.ejor.2007.04.040
10.1016/j.ejor.2011.06.037
10.1016/j.ejor.2005.03.020
10.1057/palgrave.jors.2601689
10.1016/S0167-5060(08)70743-X
10.1007/BF01580393
10.1142/S0217595912500133
10.1057/palgrave.jors.2601766
10.1007/s10951-005-4997-z
10.1016/j.cor.2012.03.012
10.1016/0377-2217(93)E0290-E
10.1007/s10479-006-0164-y
10.1016/j.cie.2010.12.008
10.1016/j.ins.2011.01.018
10.1080/09511929208944543
10.1016/j.ins.2009.02.015
ContentType Journal Article
Copyright 2021 Taru Publications 2021
Copyright_xml – notice: 2021 Taru Publications 2021
DBID AAYXX
CITATION
DOI 10.1080/02522667.2020.1715574
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2169-0103
EndPage 134
ExternalDocumentID 10_1080_02522667_2020_1715574
1715574
Genre Research Article
GroupedDBID -~X
.DC
0BK
0R~
29K
30N
4.4
5GY
ABCCY
ABFIM
ABJNI
ABPEM
ABTAI
ABXYU
ACGFS
ACTIO
ADCVX
AEYOC
AGDLA
AIJEM
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
D-I
DGEBU
DKSSO
EBS
E~A
E~B
GTTXZ
H13
HZ~
H~P
IPNFZ
KYCEM
LJTGL
M4Z
O9-
P2P
PQQKQ
PZZ
RIG
ROSJB
S-T
SJN
SNACF
TDBHL
TFT
TFW
TN5
TTHFI
UT5
AAYXX
CITATION
ID FETCH-LOGICAL-c188t-64f872c5bf8f2864713cc2e23873cc9b4779064559f4f4a2dde4580ff0e7987b3
ISSN 0252-2667
IngestDate Tue Jul 01 02:01:54 EDT 2025
Wed Dec 25 09:07:51 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c188t-64f872c5bf8f2864713cc2e23873cc9b4779064559f4f4a2dde4580ff0e7987b3
PageCount 26
ParticipantIDs crossref_primary_10_1080_02522667_2020_1715574
informaworld_taylorfrancis_310_1080_02522667_2020_1715574
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 01/02/2021
PublicationDateYYYYMMDD 2021-01-02
PublicationDate_xml – month: 01
  year: 2021
  text: 01/02/2021
  day: 02
PublicationDecade 2020
PublicationTitle Journal of information & optimization sciences
PublicationYear 2021
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
CIT0011
CIT0033
CIT0014
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0015
CIT0037
CIT0018
CIT0017
CIT0039
CIT0019
CIT0041
CIT0040
CIT0021
CIT0043
CIT0020
CIT0042
CIT0001
CIT0023
CIT0045
CIT0022
CIT0044
CIT0003
CIT0025
French S. (CIT0026) 1982
CIT0002
CIT0024
CIT0046
CIT0005
CIT0027
CIT0004
CIT0007
CIT0029
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0034
  doi: 10.1007/s10878-006-9001-0
– ident: CIT0046
  doi: 10.1080/09720502.2017.1311041
– ident: CIT0032
  doi: 10.1016/j.tcs.2006.07.011
– ident: CIT0014
  doi: 10.1504/IJSTL.2013.050590
– ident: CIT0040
  doi: 10.1016/j.cor.2006.12.019
– ident: CIT0004
  doi: 10.1016/j.ejor.2006.01.030
– ident: CIT0025
  doi: 10.1016/j.ejor.2007.05.040
– ident: CIT0045
  doi: 10.3390/info2030528
– ident: CIT0016
  doi: 10.1016/j.apm.2010.03.011
– ident: CIT0009
  doi: 10.1007/978-3-642-41880-8
– ident: CIT0027
  doi: 10.1016/j.cor.2004.04.001
– ident: CIT0006
  doi: 10.1016/j.amc.2011.04.005
– ident: CIT0024
  doi: 10.1080/00207543.2017.1355576
– ident: CIT0008
  doi: 10.1007/s10845-011-0525-5
– volume-title: Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
  year: 1982
  ident: CIT0026
– ident: CIT0028
  doi: 10.1287/opre.1030.0092
– ident: CIT0018
  doi: 10.1109/TSMCA.2011.2147305
– ident: CIT0031
  doi: 10.1023/A:1022231419049
– ident: CIT0035
  doi: 10.1016/j.ejor.2011.05.041
– ident: CIT0020
  doi: 10.1007/s10898-017-0509-x
– ident: CIT0001
  doi: 10.1016/S0377-2217(98)00246-X
– ident: CIT0011
  doi: 10.1016/j.apm.2010.11.026
– ident: CIT0010
  doi: 10.1007/s00170-009-2259-5
– ident: CIT0023
  doi: 10.1057/jors.2016.40
– ident: CIT0041
  doi: 10.1016/0377-2217(95)00351-7
– ident: CIT0036
  doi: 10.1016/j.ejor.2010.03.003
– ident: CIT0019
  doi: 10.1057/jors.2013.19
– ident: CIT0012
  doi: 10.1016/j.ejor.2010.01.005
– ident: CIT0021
  doi: 10.1007/s40995-016-0080-1
– ident: CIT0022
  doi: 10.7494/dmms.2011.5.1.19
– ident: CIT0033
  doi: 10.1016/j.ejor.2007.04.040
– ident: CIT0037
  doi: 10.1016/j.ejor.2011.06.037
– ident: CIT0003
  doi: 10.1016/j.ejor.2005.03.020
– ident: CIT0002
  doi: 10.1057/palgrave.jors.2601689
– ident: CIT0029
  doi: 10.1016/S0167-5060(08)70743-X
– ident: CIT0044
  doi: 10.1007/BF01580393
– ident: CIT0007
  doi: 10.1142/S0217595912500133
– ident: CIT0039
  doi: 10.1057/palgrave.jors.2601766
– ident: CIT0038
  doi: 10.1007/s10951-005-4997-z
– ident: CIT0013
  doi: 10.1016/j.cor.2012.03.012
– ident: CIT0043
  doi: 10.1016/0377-2217(93)E0290-E
– ident: CIT0030
  doi: 10.1007/s10479-006-0164-y
– ident: CIT0005
  doi: 10.1016/j.cie.2010.12.008
– ident: CIT0017
  doi: 10.1016/j.ins.2011.01.018
– ident: CIT0042
  doi: 10.1080/09511929208944543
– ident: CIT0015
  doi: 10.1016/j.ins.2009.02.015
SSID ssj0049607
Score 2.1309316
Snippet Scheduling with multiple agents and learning effects has attracted growing attention of the scheduling research community. However, scheduling research...
SourceID crossref
informaworld
SourceType Index Database
Publisher
StartPage 109
SubjectTerms Due dates
Learning effect
Primary: 90B35
Release dates
Scheduling
Secondary: 90C26
Two-agents
Title A hybrid heuristic for agent-based scheduling problem with an ordinal scale objective criterion
URI https://www.tandfonline.com/doi/abs/10.1080/02522667.2020.1715574
Volume 42
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1La9wwEBbb9NJL0ydNX-jQm9FiybItHZfQshQaSruB9GQkWWYTqDc09qH9OfmlHT38SDeUPi7GyI81mo-Zb7T6ZhB6Qw2wVpkzUkuRE25rQZSgimiW1RYIcipqJ07-cFKsT_n7s_xssbie7VrqO700P27VlfyLVWEM7OpUsn9h2fGlMADnYF84goXh-Ec2XiXb705xBXSvDxWXw6ZIJ5ciLj7VCSSvEEyi5tz3jhnkbAmknb4l1hWYySY7fRF8XwJ-xBVwjvbaJ66x1uoInB14na9RzpnEiDoy9eOt8ouxX3rVko-7adjGdeptD66efJoUaZ-35-FvH3cLWV-d9zG4-vZhQUt0MYA6rlcw6tcrpux2s9c6ZObxGIAGGEOIwNaPMVq4DV1pNnfZnO1BM_hfmspZKKdhnXQvSsRtlcxxz6JcwlfCYAnMKjQM-qUAd7xyB91lkIq49iBZejJEew4ZoJfkD58-qMRc_fbbfuAG_7lRHXfGazYP0P1oV7wK6HqIFrZ9hA6HZh84-v7HqFrhADY8gg3DW_EMbHgCG45gww5sWLU4gg17sOERbHgE2xN0-u7t5nhNYncOYqgQHSl4I0pmct2IhokCSE5mDLNAAUs4kZq7SpYFh4y14Q1XDOIoz0XaNKktpSh19hQdtLvWPkNYC8WlMUaXUvLU1ErwtFTCZDSzUmfiCC2HOasuQxGWig61beMkV26SqzjJR0jOZ7bqPOiagLcq--2zz__j2Rfo3gT5l-ig-9bbV0BaO_3ao-YntfSTQg
linkProvider Taylor & Francis
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI5gHODCeIrxzIFrRpumTXKcENOAbadN2q1q0kQTSB1C3QF-PfbaShsSXHarqrpKndSfbdmfCbkPLXitOuYs1ypmwuWKZSrMmOFR7sBBDlSOzcmjcTKYipdZPFvrhcGySoyhfUUUsbLV-HNjMropiXsAnAavIZEQ3nG4JQETpdgle7FOJI5viIJxY40FeOirlmkQYSjTdPH89ZoNfNpgL13DnX6b2GbFVbnJe3dZmq79_kXmuN0nHZHD2i2lveocHZMdV5yQdjPygdYW4JSkPTr_wiYvOnfLiuSZwtpphh1aDCExpxAvA35hmzutx9VQzPbSrKAQ6eIULngEcIkuzFtlbimYLuSMXhRnZNp_mjwOWD2jgdlQqZIlwivJbWy88lwlAHWRtdyBIyDhQhuBfIaJgLjFCy8yDtZUxCrwPnBSK2mic9IqFoW7INSoTGhrrZFai8DmGcSeMlM2CiOnTaQ6pNvsTPpRUXGkYcNwWqsvRfWltfo6RK_vX1quciC-GliSRv_KXm4he0f2B5PRMB0-j1-vyAHHKhhM2vBr0io_l-4G3JjS3K7O6Q_4FuUD
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagSIiF8hTl6YHVJbGd2B4roCqvioFKbJHt2KpASitIB_j1nJtEapFg6RZFuSjx477vrLvvELqMLbBWlVCSK5kQ7nJJtIw1MZTlDghyJPNQnPw0TAcjfv-aNNmEn3VaZYihfSUUMffVYXNPc99kxF0BTANpSAVEdxRuCYBEwdfRRgr0JCxsFg0bZ8yBoM8rpsGEBJumiOev1yzB05J46QLs9NvINB9cZZu8d2el6drvX1qOK_3RDtquSSnuVatoF625Yg-1m4YPuN7_-yjr4fFXKPHCYzerJJ4xfDrWoT6LBEDMMUTLgF6hyB3XzWpwOOvFusAQ54YeXPAIoBKemLfK2WJwXEExelIcoFH_9uV6QOoODcTGUpYk5V4KahPjpacyBaBj1lIHNEDAhTI8qBmmHKIWzz3XFHwpT2TkfeSEksKwQ9QqJoU7QthIzZW11gileGRzDZGn0NKymDllmOygbjMx2bQS4sjiRt-0Hr4sDF9WD18HqcXpy8r5CYiv2pVk7F_b4xVsL9Dm800_e7wbPpygLRpSYMKJDT1FrfJj5s6Aw5TmfL5KfwBOC-Ow
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%3Ajournal&rft.genre=article&rft.atitle=A+hybrid+heuristic+for+agent-based+scheduling+problem+with+an+ordinal+scale+objective+criterion&rft.jtitle=Journal+of+information+%26+optimization+sciences&rft.au=Chao%2C+Yuan-Po&rft.au=Cheng%2C+Shuenn-Ren&rft.au=Shih%2C+Cheng-Hsiung&rft.au=Yu%2C+Kejian&rft.date=2021-01-02&rft.pub=Taylor+%26+Francis&rft.issn=0252-2667&rft.eissn=2169-0103&rft.volume=42&rft.issue=1&rft.spage=109&rft.epage=134&rft_id=info:doi/10.1080%2F02522667.2020.1715574&rft.externalDocID=1715574
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0252-2667&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0252-2667&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0252-2667&client=summon