A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the ob...
Saved in:
| Published in | Journal of combinatorial optimization Vol. 33; no. 4; pp. 1454 - 1468 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.05.2017
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. The scheduling measure considered in this paper is minimum total (earliness, tardiness and due-date) cost, based on common flow allowance, i.e., due-dates are defined as linear functions of the job processing times. We introduce a simple polynomial time solution for this problem (linear in the number of jobs), as well as to its extension to a multi-agent setting. We further extend the model to that of a due-window assignment based on common flow allowance. |
|---|---|
| AbstractList | We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. The scheduling measure considered in this paper is minimum total (earliness, tardiness and due-date) cost, based on common flow allowance, i.e., due-dates are defined as linear functions of the job processing times. We introduce a simple polynomial time solution for this problem (linear in the number of jobs), as well as to its extension to a multi-agent setting. We further extend the model to that of a due-window assignment based on common flow allowance. |
| Author | Mor, Baruch Mosheiov, Gur |
| Author_xml | – sequence: 1 givenname: Baruch surname: Mor fullname: Mor, Baruch organization: Department of Economics and Business Administration, Ariel University – sequence: 2 givenname: Gur surname: Mosheiov fullname: Mosheiov, Gur email: msomer@mscc.huji.ac.il organization: School of Business Administration, The Hebrew University |
| BookMark | eNp9kE1LxDAQhoOs4OcP8BbwHJ00TZMeRfyCBS96DtM03c3SJmvTpfjvzbIeRNDLzDC8z8zLe0YWIQZHyBWHGw6gbhMHrTQDXjGAsmb8iJxyqQQrtK4WeRa6YFUN8oScpbQBgDyXp6S9o9McGa5cmGjyYdU7OqBd--BosmvX7vq8pNsxNr0b6OynNW13js0-tHGmmJJfhWEPY2gpUhuHIQba9XFm2OeKwboLctxhn9zldz8n748Pb_fPbPn69HJ_t2RWFtXERNFIqbSsiroWTVk23ArdIYpKQOdqWaHljUInAbACzrGDQilhVe0c540U5-T6cDfb_di5NJlN3I0hvzRca1CyLkqeVeqgsmNMaXSdsX7Cyccwjeh7w8HsIzWHSE2O1OwjNXuS_yK3ox9w_PyXKQ5MytqwcuMPT39CXwPMisk |
| CitedBy_id | crossref_primary_10_1016_j_ajsl_2018_12_008 crossref_primary_10_1007_s10878_017_0228_8 crossref_primary_10_1007_s11590_022_01967_6 crossref_primary_10_1016_j_ejor_2022_02_017 crossref_primary_10_1142_S0217595922500257 crossref_primary_10_1007_s10878_021_00709_1 crossref_primary_10_3390_math11122737 crossref_primary_10_1007_s10878_021_00746_w crossref_primary_10_1007_s10878_020_00594_0 crossref_primary_10_1002_nav_21813 crossref_primary_10_1155_2020_1385049 crossref_primary_10_1007_s10878_020_00600_5 crossref_primary_10_1007_s10479_018_2839_6 crossref_primary_10_1007_s10479_022_04806_0 crossref_primary_10_1007_s10951_020_00658_3 crossref_primary_10_1016_j_cie_2017_07_013 |
| Cites_doi | 10.1287/opre.1090.0744 10.1007/s10878-011-9378-2 10.1016/j.cor.2012.05.019 10.1287/opre.1030.0092 10.1016/j.cie.2013.11.017 10.1007/s10479-006-0164-y 10.1016/j.ijpe.2012.06.004 10.1016/j.ejor.2007.10.043 10.1007/978-3-642-41880-8 10.1023/A:1022231419049 10.1016/j.ejor.2010.03.003 10.1057/jors.2013.9 10.1016/j.cie.2010.12.008 10.1016/j.cor.2011.09.018 10.1007/BF02896403 10.1002/nav.21562 10.1057/jors.2011.135 10.1016/j.ejor.2011.06.037 10.1007/s10878-014-9744-y 10.1057/jors.2010.171 10.1016/j.ejor.2016.03.037 10.1007/s10878-006-9001-0 10.1016/S0377-2217(01)00181-3 10.1007/s10951-011-0253-x 10.1057/jors.1996.155 10.1016/j.cie.2014.09.028 10.1016/j.ijpe.2011.07.013 10.1287/msom.1060.0139 10.1057/s41274-016-0003-8 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2016 Copyright Springer Science & Business Media 2017 |
| Copyright_xml | – notice: Springer Science+Business Media New York 2016 – notice: Copyright Springer Science & Business Media 2017 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s10878-016-0049-1 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1573-2886 |
| EndPage | 1468 |
| ExternalDocumentID | 10_1007_s10878_016_0049_1 |
| GrantInformation_xml | – fundername: Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 29K 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9R PF0 PT4 PT5 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION ABRTQ |
| ID | FETCH-LOGICAL-c526t-32b5578562993b44b1c38faa3630fe956ac1b7ae500a6011af02773c79ee11b53 |
| IEDL.DBID | U2A |
| ISSN | 1382-6905 |
| IngestDate | Fri Jul 25 11:06:03 EDT 2025 Tue Jul 01 03:13:02 EDT 2025 Thu Apr 24 23:06:23 EDT 2025 Fri Feb 21 02:33:41 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Two agents Minmax Scheduling Common flow-allowance Single machine |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c526t-32b5578562993b44b1c38faa3630fe956ac1b7ae500a6011af02773c79ee11b53 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1880759241 |
| PQPubID | 2043856 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_1880759241 crossref_citationtrail_10_1007_s10878_016_0049_1 crossref_primary_10_1007_s10878_016_0049_1 springer_journals_10_1007_s10878_016_0049_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-01 |
| PublicationDateYYYYMMDD | 2017-05-01 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationTitle | Journal of combinatorial optimization |
| PublicationTitleAbbrev | J Comb Optim |
| PublicationYear | 2017 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Wang (CR30) 2006; 21 Agnetis, Pacciarelli, Pacifici (CR3) 2007; 150 Leung, Pinedo, Wan (CR13) 2010; 58 Mor, Mosheiov (CR18) 2011; 215 Adamopoulos, Pappis (CR1) 1996; 47 Mosheiov, Oron (CR25) 2007; 17 Agnetis, Mirchandani, Pacciarelli, Pacifici (CR2) 2004; 52 Mor, Mosheiov (CR17) 2010; 206 Ng, Cheng, Yuan (CR28) 2006; 12 Zhao, Lu (CR31) 2016; 31 Li, Yuan (CR15) 2012; 15 Luo, Chen, Zhang (CR16) 2012; 24 Mor, Mosheiov (CR21) 2012; 139 Mor, Mosheiov (CR19) 2012; 63 Agnetis, Billaut, Gawiejnowicz, Pacciarelli, Soukhal (CR4) 2014 Ji, Chen, Ge, Cheng (CR12) 2014; 68 Cheng, Liu, Lee (CR7) 2014; 78 Gerstl, Mosheiov (CR10) 2014; 61 Gawiejnowicz, Lee, Lin, Wu (CR8) 2011; 62 Mor, Mosheiov (CR22) 2014; 65 Cheng, Cheng, Wu, Hsu, Wu (CR6) 2011; 60 Gordon, Proth, Chu (CR11) 2002; 139 Mor, Mosheiov (CR24) 2016; 254 Mosheiov, Sarig (CR27) 2009; 93 Baker, Smith (CR5) 2003; 6 Li, Hsu (CR14) 2012; 39 CR23 Shabtay, Steiner (CR29) 2007; 9 Mor, Mosheiov (CR20) 2012; 135 Mosheiov, Oron (CR26) 2010; 35 Gerstl, Mosheiov (CR9) 2013; 40 A Agnetis (49_CR3) 2007; 150 TCE Cheng (49_CR7) 2014; 78 B Mor (49_CR18) 2011; 215 S Gawiejnowicz (49_CR8) 2011; 62 KR Baker (49_CR5) 2003; 6 B Mor (49_CR20) 2012; 135 49_CR23 DC Li (49_CR14) 2012; 39 CT Ng (49_CR28) 2006; 12 G Mosheiov (49_CR25) 2007; 17 K Zhao (49_CR31) 2016; 31 M Ji (49_CR12) 2014; 68 G Mosheiov (49_CR26) 2010; 35 VS Gordon (49_CR11) 2002; 139 E Gerstl (49_CR9) 2013; 40 GI Adamopoulos (49_CR1) 1996; 47 JB Wang (49_CR30) 2006; 21 B Mor (49_CR22) 2014; 65 B Mor (49_CR24) 2016; 254 TCE Cheng (49_CR6) 2011; 60 B Mor (49_CR21) 2012; 139 G Mosheiov (49_CR27) 2009; 93 D Shabtay (49_CR29) 2007; 9 E Gerstl (49_CR10) 2014; 61 W Luo (49_CR16) 2012; 24 B Mor (49_CR17) 2010; 206 B Mor (49_CR19) 2012; 63 S Li (49_CR15) 2012; 15 A Agnetis (49_CR2) 2004; 52 A Agnetis (49_CR4) 2014 JYT Leung (49_CR13) 2010; 58 |
| References_xml | – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: CR13 article-title: Competitive two-agent scheduling and its applications publication-title: Oper Res doi: 10.1287/opre.1090.0744 – volume: 24 start-page: 229 year: 2012 end-page: 239 ident: CR16 article-title: Approximation schemes for two-machine flow shop scheduling with two agents publication-title: J Comb Optim doi: 10.1007/s10878-011-9378-2 – volume: 35 start-page: 185 year: 2010 end-page: 195 ident: CR26 article-title: Job dependent due-window assignment based on a common flow allowance publication-title: Found Comput Decis Sci – volume: 40 start-page: 109 year: 2013 end-page: 116 ident: CR9 article-title: Scheduling problems with two competing agents to minimize weighted earliness-tardiness publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.05.019 – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: CR2 article-title: Scheduling problems with two competing agents publication-title: Oper Res doi: 10.1287/opre.1030.0092 – volume: 68 start-page: 35 year: 2014 end-page: 41 ident: CR12 article-title: Group scheduling and job-dependent due-window assignment based on a common flow allowance publication-title: Comput Ind Eng doi: 10.1016/j.cie.2013.11.017 – volume: 150 start-page: 3 year: 2007 end-page: 15 ident: CR3 article-title: Multi-agent single machine scheduling publication-title: Ann Oper Res doi: 10.1007/s10479-006-0164-y – volume: 139 start-page: 623 year: 2012 end-page: 633 ident: CR21 article-title: Parallel machine scheduling problems with common flow- allowance publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.06.004 – volume: 93 start-page: 49 year: 2009 end-page: 58 ident: CR27 article-title: Due-date assignment on uniform machines publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.10.043 – year: 2014 ident: CR4 publication-title: Multiagent scheduling doi: 10.1007/978-3-642-41880-8 – volume: 6 start-page: 7 year: 2003 end-page: 16 ident: CR5 article-title: A multiple criterion model for machine scheduling publication-title: J sched doi: 10.1023/A:1022231419049 – ident: CR23 – volume: 206 start-page: 540 year: 2010 end-page: 546 ident: CR17 article-title: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2010.03.003 – volume: 65 start-page: 151 year: 2014 end-page: 157 ident: CR22 article-title: Polynomial time solutions for scheduling problems on proportionate flowshop with two competing agents publication-title: J Oper Res Soc doi: 10.1057/jors.2013.9 – volume: 60 start-page: 534 year: 2011 end-page: 541 ident: CR6 article-title: A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations publication-title: Comput Ind Eng doi: 10.1016/j.cie.2010.12.008 – volume: 39 start-page: 1644 year: 2012 end-page: 1651 ident: CR14 article-title: Solving a two-agent single-machine scheduling problem considering learning effect publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.09.018 – volume: 21 start-page: 249 year: 2006 end-page: 257 ident: CR30 article-title: Single machine common flow allowance scheduling with controllable processing times publication-title: J Appl Math Comput doi: 10.1007/BF02896403 – volume: 61 start-page: 1 year: 2014 end-page: 16 ident: CR10 article-title: Single machine just-in-time scheduling problems with two competing agents publication-title: Nav Res Logist doi: 10.1002/nav.21562 – volume: 63 start-page: 1284 year: 2012 end-page: 1293 ident: CR19 article-title: Minmax scheduling problems with common flow-allowance publication-title: J Oper Res Soc doi: 10.1057/jors.2011.135 – volume: 215 start-page: 524 year: 2011 end-page: 531 ident: CR18 article-title: Single machine batch scheduling with two competing agents to minimize total flowtime publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2011.06.037 – volume: 31 start-page: 260 year: 2016 end-page: 278 ident: CR31 article-title: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan publication-title: J Comb Optim doi: 10.1007/s10878-014-9744-y – volume: 62 start-page: 1983 year: 2011 end-page: 1991 ident: CR8 article-title: Single-machine scheduling of proportionally deteriorating jobs by two agents publication-title: J Oper Res Soc doi: 10.1057/jors.2010.171 – volume: 254 start-page: 360 year: 2016 end-page: 370 ident: CR24 article-title: Minsum and minmax scheduling on a proportionate flowshop with common flow allowance publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2016.03.037 – volume: 17 start-page: 61 year: 2007 end-page: 62 ident: CR25 article-title: Minmax scheduling with job-classes and earliness-tardiness costs publication-title: Eur J Oper Res – volume: 12 start-page: 387 year: 2006 end-page: 394 ident: CR28 article-title: A note on the complexity of the two-agent scheduling on a single machine publication-title: J Comb Optim doi: 10.1007/s10878-006-9001-0 – volume: 139 start-page: 1 year: 2002 end-page: 25 ident: CR11 article-title: A survey of the state-of-the-art of common due date assignment and scheduling research publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00181-3 – volume: 15 start-page: 629 year: 2012 end-page: 640 ident: CR15 article-title: Unbounded parallel-batching scheduling with two competitive agents publication-title: J Sched doi: 10.1007/s10951-011-0253-x – volume: 47 start-page: 1280 year: 1996 end-page: 1285 ident: CR1 article-title: Single machine scheduling with flow allowances publication-title: J Oper Res Soc doi: 10.1057/jors.1996.155 – volume: 78 start-page: 66 year: 2014 end-page: 73 ident: CR7 article-title: Two-agent single-machine scheduling to minimize the weighted sum of the agents’ objective function publication-title: Comput Ind Eng doi: 10.1016/j.cie.2014.09.028 – volume: 9 start-page: 332 year: 2007 end-page: 350 ident: CR29 article-title: Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine publication-title: Manuf Serv Oper Manag – volume: 135 start-page: 222 year: 2012 end-page: 230 ident: CR20 article-title: Scheduling a maintenance activity and due-window assignment based on common flow allowance publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2011.07.013 – volume: 206 start-page: 540 year: 2010 ident: 49_CR17 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2010.03.003 – volume: 65 start-page: 151 year: 2014 ident: 49_CR22 publication-title: J Oper Res Soc doi: 10.1057/jors.2013.9 – volume: 63 start-page: 1284 year: 2012 ident: 49_CR19 publication-title: J Oper Res Soc doi: 10.1057/jors.2011.135 – volume: 254 start-page: 360 year: 2016 ident: 49_CR24 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2016.03.037 – volume: 68 start-page: 35 year: 2014 ident: 49_CR12 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2013.11.017 – volume: 17 start-page: 61 year: 2007 ident: 49_CR25 publication-title: Eur J Oper Res – volume: 9 start-page: 332 year: 2007 ident: 49_CR29 publication-title: Manuf Serv Oper Manag doi: 10.1287/msom.1060.0139 – volume: 58 start-page: 458 year: 2010 ident: 49_CR13 publication-title: Oper Res doi: 10.1287/opre.1090.0744 – volume: 47 start-page: 1280 year: 1996 ident: 49_CR1 publication-title: J Oper Res Soc doi: 10.1057/jors.1996.155 – volume: 52 start-page: 229 year: 2004 ident: 49_CR2 publication-title: Oper Res doi: 10.1287/opre.1030.0092 – volume: 6 start-page: 7 year: 2003 ident: 49_CR5 publication-title: J sched doi: 10.1023/A:1022231419049 – volume: 24 start-page: 229 year: 2012 ident: 49_CR16 publication-title: J Comb Optim doi: 10.1007/s10878-011-9378-2 – volume: 139 start-page: 623 year: 2012 ident: 49_CR21 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.06.004 – volume: 62 start-page: 1983 year: 2011 ident: 49_CR8 publication-title: J Oper Res Soc doi: 10.1057/jors.2010.171 – volume: 15 start-page: 629 year: 2012 ident: 49_CR15 publication-title: J Sched doi: 10.1007/s10951-011-0253-x – ident: 49_CR23 doi: 10.1057/s41274-016-0003-8 – volume: 40 start-page: 109 year: 2013 ident: 49_CR9 publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.05.019 – volume: 139 start-page: 1 year: 2002 ident: 49_CR11 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00181-3 – volume: 21 start-page: 249 year: 2006 ident: 49_CR30 publication-title: J Appl Math Comput doi: 10.1007/BF02896403 – volume: 61 start-page: 1 year: 2014 ident: 49_CR10 publication-title: Nav Res Logist doi: 10.1002/nav.21562 – volume: 215 start-page: 524 year: 2011 ident: 49_CR18 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2011.06.037 – volume: 78 start-page: 66 year: 2014 ident: 49_CR7 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2014.09.028 – volume: 35 start-page: 185 year: 2010 ident: 49_CR26 publication-title: Found Comput Decis Sci – volume: 60 start-page: 534 year: 2011 ident: 49_CR6 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2010.12.008 – volume: 31 start-page: 260 year: 2016 ident: 49_CR31 publication-title: J Comb Optim doi: 10.1007/s10878-014-9744-y – volume: 12 start-page: 387 year: 2006 ident: 49_CR28 publication-title: J Comb Optim doi: 10.1007/s10878-006-9001-0 – volume: 39 start-page: 1644 year: 2012 ident: 49_CR14 publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.09.018 – volume: 135 start-page: 222 year: 2012 ident: 49_CR20 publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2011.07.013 – volume: 150 start-page: 3 year: 2007 ident: 49_CR3 publication-title: Ann Oper Res doi: 10.1007/s10479-006-0164-y – volume: 93 start-page: 49 year: 2009 ident: 49_CR27 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.10.043 – volume-title: Multiagent scheduling year: 2014 ident: 49_CR4 doi: 10.1007/978-3-642-41880-8 |
| SSID | ssj0009054 |
| Score | 2.193459 |
| Snippet | We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1454 |
| SubjectTerms | Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation |
| Title | A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance |
| URI | https://link.springer.com/article/10.1007/s10878-016-0049-1 https://www.proquest.com/docview/1880759241 |
| Volume | 33 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA6yXfQg_sTpHDl4UgJN0vTHscjmUPTkYJ5K2iYizFa2jv77vte12xQVPJakObyked_X9973CLmyIjS-FJaFxnUYImimA88yEQKXCOF6dHWt9vnkjSfu_VRNmzruRZvt3oYk65t6q9gtQDVYDgwYYC0DytNVQN0xj2sioo3SrqNWnWwBOgL1U20o86clvjqjDcL8FhStfc3ogOw3IJFGq109JDsmPyJ7W9KB8PS41ltdHJMsomVVMI11UhTZ_8zQ9zpN0lCgr-BOsOqcNt1jKP58pdnSsAoYeVFRANBvr3VaANV5RjUFi8DxpHZWVAwj8xWejRMyGQ2fb8es6Z_AUiW8kkmRKNSy8cDlyMR1E57KwGotPelYA8RIpzzxtVGOo4GXcW0xoCtTPzSG80TJU9LJi9ycEZr4qfJCP8wyyd0ssIExMpOBC_TMMdaKHnFaQ8ZpIy6OPS5m8UYWGW0fY0IZ2j7mPXK9fuVjpazx1-R-uztx85EtYpSS8xUQSBi-aXdsa_i3xc7_NfuC7Ap05XWSY590yvnSXAIQKZMB6UZ3Lw_DQX0APwF47dRI |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwELVQOQAHxCp2fIALyFJsZz1wqFjU0tJTK_UWnMRGSCVBNCjie_hRZtKEFgRIHHqM7ETRjJf37Jk3hJwYEWhPCsMCbVsMETRTvmuYCIBLBLA82qpU--y5rYF9O3SGC-S9zoUpo93rK8lypZ5JdvNRDZYDAwZYy3gVSdnRbwXwtPFF-wqceirEzXX_ssWqUgIsdoSbMykiB2VdXFh9ZWTbEY-lb5SSrrSMBo6gYh55SjuWpYCicGXwblPGXqA15xGWhoB1fhGwh49TZyCaU2Vfy5lUzgWoClTTqa9Of_rlr5vfFNF-u4Qt97abNbJagVLanIyidbKg0w2yMiNVCE93n_qu402SNGleZExhXhbF04aRpk9lWKamQJdh-8Isd1pVq6F42EuTV82KxzTJCgqA_fGhDEOgKk2oouABmA7UjLKCYSRAgWNxiwzmYuRt0kizVO8QGnmx4wZekCSS24lvfK1lIn0b6KCljRG7xKoNGcaVmDnW1BiFUxlmtH2IAWxo-5DvkrPPV54nSh5_dT6ovRNWk3oconSd5wBhhebz2mMzzb99bO9fvY_JUqt_1w277V5nnywLhBFlgOUBaeQvr_oQQFAeHZWDkJL7eY_6D4vHDko |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEA6iIHoQn_hYNQe9KMEm6fPgYXFd1NXFgwveatokIqxdcSvFX-VfdKbbuquo4MFjSVrKzCSZLzPzDSF7VkQmkMKyyLgOQw-aqdC3TESAJSLYHl1Vsn12_bOee3Hr3U6Rt7oWpsx2r0OSo5oGZGnK8qMnbY8mCt9CZIblgIbBxWW8yqrsmNcCMNvw-LwFCt4Xon16c3LGqrYCLPWEnzMpEg8pXnzYiWXiuglPZWiVkr50rAG8oFKeBMp4jqMArnBlMc4p0yAyhvME20TAnj_jYvExLKCeaI5Zfh1v1EUX3FaAnV4dRv3ulz8fhGPv9ktAtjzn2otkoXJQaXNkUUtkymTLZH6CthCerj64XocrRDdpXgyYwhotijcPfUMfyxRNQwE6w1GGFe-06lxD8eKX6hfDiodMDwoKzvvDfZmSQFWmqaKgDVga1PYHBcOsgALtcpX0_kXIa2Q6G2RmndAkSD0_CiKtJXd1aENjpJahC9DQMdaKDeLUgozTitgc-2v04zElM8o-xmQ2lH3MN8jBxytPI1aP3yY3au3E1QIfxkhjF3gAXmH4sNbYxPBPH9v80-xdMnvdaseX593OFpkT6FGUuZYNMp0_v5ht8IfyZKe0QUru_tvo3wGLNBJ9 |
| 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+two-agent+single+machine+scheduling+problem+with+due-window+assignment+and+a+common+flow-allowance&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Mor%2C+Baruch&rft.au=Mosheiov%2C+Gur&rft.date=2017-05-01&rft.pub=Springer+Nature+B.V&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=33&rft.issue=4&rft.spage=1454&rft.epage=1468&rft_id=info:doi/10.1007%2Fs10878-016-0049-1&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon |