Two-agent single machine scheduling with forbidden intervals
We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for vario...
Uloženo v:
| Vydáno v: | Applied Mathematics-A Journal of Chinese Universities Ročník 30; číslo 1; s. 93 - 101 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Heidelberg
Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
01.03.2015
|
| Témata: | |
| ISSN: | 1005-1031, 1993-0445 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations of regular scheduling objective functions. |
|---|---|
| AbstractList | We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations of regular scheduling objective functions. |
| Author | Feng, Qi Li, Shi-sheng Shang, Wei-ping |
| Author_xml | – sequence: 1 givenname: Qi surname: Feng fullname: Feng, Qi email: fengqishuxue@126.com organization: College of Science, Zhongyuan University of Technology – sequence: 2 givenname: Shi-sheng surname: Li fullname: Li, Shi-sheng organization: College of Science, Zhongyuan University of Technology – sequence: 3 givenname: Wei-ping surname: Shang fullname: Shang, Wei-ping organization: School of Mathematics and Statistics, Zhengzhou University |
| BookMark | eNp9kEFLAzEQhYNUsNb-AG_7B6IzmWTTBS9S1AoFL_UcsrtJu6XNSrK1-O9NWc-e3jC893h8t2wS-uAYu0d4QAD9mBB1WXJAxQl0ycUVm2JVEQcp1STfAIojEN6weUp7AECppVKLKXvanHtuty4MRerC9uCKo212XXBFanauPR3yszh3w67wfay7tnWh6MLg4rc9pDt27bO4-Z_O2Ofry2a54uuPt_fl85o3BDTwuvGVJGUrXy4qqZxDLbAWVrUOrSo9CdnI6rK89ihAUW2p1p5ItFr6BdGM4djbxD6l6Lz5it3Rxh-DYC4EzEjAZALm0mNEzogxk7I3bF00-_4UQ575T-gX8BJfcg |
| Cites_doi | 10.1016/j.tcs.2006.07.011 10.1016/j.tcs.2012.11.002 10.1016/j.cor.2012.03.012 10.1287/moor.15.3.483 10.1016/j.ejor.2006.01.049 10.1007/s10951-005-4997-z 10.1007/s10878-011-9378-2 10.1023/A:1022231419049 10.1016/S0167-5060(08)70356-X 10.1016/j.asoc.2012.09.026 10.1016/j.apm.2013.03.013 10.1016/S0167-5060(08)70742-8 10.1287/opre.1030.0092 10.1287/opre.1090.0744 10.1016/j.ejor.2007.04.040 10.1007/s10845-011-0525-5 10.1007/s10479-006-0164-y 10.1016/j.ins.2011.11.035 10.1016/j.amc.2011.04.005 10.1016/S0377-2217(98)00367-1 10.1016/j.amc.2012.08.008 10.1016/j.cie.2009.04.014 10.1016/j.cie.2010.12.008 10.1023/A:1018909801944 10.1007/s10951-011-0253-x |
| ContentType | Journal Article |
| Copyright | Editorial Committee of Applied Mathematics-A Journal of Chinese Universities and Springer-Verlag Berlin Heidelberg 2015 |
| Copyright_xml | – notice: Editorial Committee of Applied Mathematics-A Journal of Chinese Universities and Springer-Verlag Berlin Heidelberg 2015 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11766-015-3076-2 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1993-0445 |
| EndPage | 101 |
| ExternalDocumentID | 10_1007_s11766_015_3076_2 |
| GroupedDBID | -01 -0A -5D -5G -BR -EM -SA -S~ -Y2 -~C .VR 06D 0R~ 0VY 188 23M 2B. 2C. 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 40E 5VR 5VS 5XA 5XB 6NX 8RM 8TC 92E 92I 92M 95- 95. 95~ 96X 9D9 9DA AAAVM AABHQ AACDK AAEWM AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAXDM AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFGCZ AFLOW AFQWF AFUIB AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD B-. BA0 BAPOH BDATZ BGNMA CAG CAJEA CCEZO CCVFK CHBEP COF CSCUP CW9 DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FA0 FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 H13 HF~ HG6 HMJXF HRMNR HZ~ IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JUIAU JZLTJ KOV LLZTM M4Y MA- NPVJJ NQJWS NU0 O9- O9J P9R PF0 PT4 Q-- Q-0 QOK QOS R-A R89 R9I REI RHV ROL RPX RSV RT1 S.. S16 S1Z S27 S3B SAP SCL SCLPG SDD SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T8Q TCJ TGP TSG TUC U1F U1G U2A U5A U5K UG4 UOJIU UTJUX UY8 UZ4 UZXMN VC2 VFIZW W48 YLTOR ZMTXR ZWQNP ~A9 ~L9 AAPKM AAYXX ABBRH ABDBE ABRTQ AFDZB AFOHR AHPBZ ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c303t-bcf9435a9f68945ee1721b2a5de1a56f324c493076bf12053ba3b7f332d74f833 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000351081900007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1005-1031 |
| IngestDate | Sat Nov 29 01:50:24 EST 2025 Fri Feb 21 02:32:39 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | forbidden interval dynamic programming 90C39 two-agent scheduling 90B36 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c303t-bcf9435a9f68945ee1721b2a5de1a56f324c493076bf12053ba3b7f332d74f833 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1007_s11766_015_3076_2 springer_journals_10_1007_s11766_015_3076_2 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-03-01 |
| PublicationDateYYYYMMDD | 2015-03-01 |
| PublicationDate_xml | – month: 03 year: 2015 text: 2015-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Applied Mathematics-A Journal of Chinese Universities |
| PublicationTitleAbbrev | Appl. Math. J. Chin. Univ |
| PublicationYear | 2015 |
| Publisher | Editorial Committee of Applied Mathematics - A Journal of Chinese Universities |
| Publisher_xml | – name: Editorial Committee of Applied Mathematics - A Journal of Chinese Universities |
| References | Cheng, Ng, Yuan (CR5) 2008; 188 Lee, Leung (CR13) 2004 Luo, Chen, Zhang (CR17) 2012; 24 Cheng, Ng, Yuan (CR4) 2006; 362 Lee, Lei, Pinedo (CR14) 1997; 70 Yin, Wu, Wu, Hsu, Wu (CR24) 2013; 13 Leung, Pinedo, Wan (CR15) 2010; 58 Yuan, Shang, Feng (CR25) 2005; 8 Yin, Cheng, Cheng, Wu, Wu (CR21) 2012; 219 Feng, Yuan, Liu, He (CR9) 2013; 37 Lawler (CR12) 1977; 1 Ma, Chu, Zuo (CR18) 2010; 58 Agnetis, Pacciarelli, Pacifici (CR2) 2007; 150 Zhao, Lu (CR26) 2013; 468 Agnetis, Mirchandani, Pacciarelli, Pacifici (CR1) 2004; 52 Wu, Cheng, Wu, Yin (CR20) 2012; 23 Schmidt (CR19) 2000; 121 Yin, Wu, Cheng, Wu (CR23) 2012; 39 Cheng, Cheng, Wu, Hsu, Wu (CR6) 2011; 60 Kovalyov, Ng, Cheng (CR11) 2007; 178 Yin, Cheng, Wu (CR22) 2012; 189 Li, Yuan (CR16) 2012; 15 Cheng, Wu, Cheng, Wu (CR7) 2011; 217 Graham, Lawer, Lenstra, Rinnooy Kan (CR10) 1979; 5 Du, Leung (CR8) 1990; 15 Baker, Smith (CR3) 2003; 6 S S Li (3076_CR16) 2012; 15 T C E Cheng (3076_CR4) 2006; 362 C-Y Lee (3076_CR13) 2004 T C E Cheng (3076_CR5) 2008; 188 W C Luo (3076_CR17) 2012; 24 Y Ma (3076_CR18) 2010; 58 R L Graham (3076_CR10) 1979; 5 E L Lawler (3076_CR12) 1977; 1 T C E Cheng (3076_CR6) 2011; 60 K R Baker (3076_CR3) 2003; 6 Q Feng (3076_CR9) 2013; 37 Y Yin (3076_CR22) 2012; 189 A Agnetis (3076_CR1) 2004; 52 Y Yin (3076_CR21) 2012; 219 G Schmidt (3076_CR19) 2000; 121 W-H Wu (3076_CR20) 2012; 23 J Y-T Leung (3076_CR15) 2010; 58 J Z Du (3076_CR8) 1990; 15 K J Zhao (3076_CR26) 2013; 468 J J Yuan (3076_CR25) 2005; 8 Y Yin (3076_CR23) 2012; 39 C-Y Lee (3076_CR14) 1997; 70 A Agnetis (3076_CR2) 2007; 150 Y Yin (3076_CR24) 2013; 13 T C E Cheng (3076_CR7) 2011; 217 M Y Kovalyov (3076_CR11) 2007; 178 |
| References_xml | – volume: 362 start-page: 273 year: 2006 end-page: 281 ident: CR4 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoret Comput Sci doi: 10.1016/j.tcs.2006.07.011 – volume: 468 start-page: 114 year: 2013 end-page: 121 ident: CR26 article-title: Approximation schemes for two-agent scheduling on parallel machines publication-title: Theory Comput Sci doi: 10.1016/j.tcs.2012.11.002 – volume: 39 start-page: 3062 year: 2012 end-page: 3073 ident: CR23 article-title: An investigation on a two-agent single-machine scheduling problem with unequal release dates publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.03.012 – volume: 15 start-page: 483 year: 1990 end-page: 495 ident: CR8 article-title: Minimizing total tardiness on one machine is NP-hard publication-title: Math Oper Res doi: 10.1287/moor.15.3.483 – volume: 178 start-page: 331 year: 2007 end-page: 342 ident: CR11 article-title: Fixed interval scheduling: models, applications, computational complexity and algorithms publication-title: European J Oper Res doi: 10.1016/j.ejor.2006.01.049 – volume: 8 start-page: 537 year: 2005 end-page: 542 ident: CR25 article-title: A note on the scheduling with two families of jobs publication-title: J Sched doi: 10.1007/s10951-005-4997-z – volume: 24 start-page: 229 year: 2012 end-page: 239 ident: CR17 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: 6 start-page: 7 year: 2003 end-page: 16 ident: CR3 article-title: A multiple-criterion model for machine scheduling publication-title: J Sched doi: 10.1023/A:1022231419049 – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: CR10 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann Discrete Math doi: 10.1016/S0167-5060(08)70356-X – volume: 13 start-page: 1042 year: 2013 end-page: 1054 ident: CR24 article-title: A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.09.026 – volume: 37 start-page: 7071 year: 2013 end-page: 7076 ident: CR9 article-title: A note on two-agent scheduling on an un-bounded parallelbatching machine with makespan and maximum lateness objectives publication-title: Appl Math Model doi: 10.1016/j.apm.2013.03.013 – volume: 1 start-page: 331 year: 1977 end-page: 342 ident: CR12 article-title: A pseudo-polynomial time algorithm for sequencing jobs to minimize total tardiness publication-title: Ann Discrete Math doi: 10.1016/S0167-5060(08)70742-8 – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: CR1 article-title: Scheduling problems with two competing agents publication-title: Oper Res doi: 10.1287/opre.1030.0092 – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: CR15 article-title: Competitive two-agent scheduling and its applications publication-title: Oper Res doi: 10.1287/opre.1090.0744 – volume: 188 start-page: 603 year: 2008 end-page: 609 ident: CR5 article-title: Multi-agent scheduling on a single machine with max-form criteria publication-title: European J Oper Res doi: 10.1016/j.ejor.2007.04.040 – volume: 23 start-page: 1985 year: 2012 end-page: 1993 ident: CR20 article-title: Ant colony algorithms for a two-agent scheduling with sum-of processing times- based learning and deteriorating considerations publication-title: J Intel Manuf doi: 10.1007/s10845-011-0525-5 – volume: 150 start-page: 3 year: 2007 end-page: 15 ident: CR2 article-title: Multi-agent single machine scheduling publication-title: Ann Oper Res doi: 10.1007/s10479-006-0164-y – volume: 189 start-page: 282 year: 2012 end-page: 292 ident: CR22 article-title: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties publication-title: Inform Sci doi: 10.1016/j.ins.2011.11.035 – volume: 217 start-page: 8804 issue: 21 year: 2011 end-page: 8824 ident: CR7 article-title: Two-agent scheduling with position- based deteriorating jobs and learning effects publication-title: Appl Math Comput doi: 10.1016/j.amc.2011.04.005 – volume: 121 start-page: 1 year: 2000 end-page: 15 ident: CR19 article-title: Scheduling with limited machine availability publication-title: European J Oper Res doi: 10.1016/S0377-2217(98)00367-1 – volume: 219 start-page: 1674 year: 2012 end-page: 1685 ident: CR21 article-title: Two-agent single-machine scheduling with assignable due dates publication-title: Appl Math Comput doi: 10.1016/j.amc.2012.08.008 – volume: 58 start-page: 199 year: 2010 end-page: 211 ident: CR18 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Comput Ind Eng doi: 10.1016/j.cie.2009.04.014 – volume: 60 start-page: 534 issue: 4 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: 70 start-page: 1 year: 1997 end-page: 41 ident: CR14 article-title: Current trends in deterministic scheduling publication-title: Ann Oper Res doi: 10.1023/A:1018909801944 – year: 2004 ident: CR13 article-title: Machine scheduling with availability constraints publication-title: Handbook of Scheduling – volume: 15 start-page: 629 year: 2012 end-page: 640 ident: CR16 article-title: Unbounded parallel-batching scheduling with two competitive agents publication-title: J Sched doi: 10.1007/s10951-011-0253-x – volume: 150 start-page: 3 year: 2007 ident: 3076_CR2 publication-title: Ann Oper Res doi: 10.1007/s10479-006-0164-y – volume: 13 start-page: 1042 year: 2013 ident: 3076_CR24 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.09.026 – volume: 189 start-page: 282 year: 2012 ident: 3076_CR22 publication-title: Inform Sci doi: 10.1016/j.ins.2011.11.035 – volume: 39 start-page: 3062 year: 2012 ident: 3076_CR23 publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.03.012 – volume: 188 start-page: 603 year: 2008 ident: 3076_CR5 publication-title: European J Oper Res doi: 10.1016/j.ejor.2007.04.040 – volume: 58 start-page: 199 year: 2010 ident: 3076_CR18 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2009.04.014 – volume-title: Handbook of Scheduling year: 2004 ident: 3076_CR13 – volume: 70 start-page: 1 year: 1997 ident: 3076_CR14 publication-title: Ann Oper Res doi: 10.1023/A:1018909801944 – volume: 178 start-page: 331 year: 2007 ident: 3076_CR11 publication-title: European J Oper Res doi: 10.1016/j.ejor.2006.01.049 – volume: 5 start-page: 287 year: 1979 ident: 3076_CR10 publication-title: Ann Discrete Math doi: 10.1016/S0167-5060(08)70356-X – volume: 24 start-page: 229 year: 2012 ident: 3076_CR17 publication-title: J Comb Optim doi: 10.1007/s10878-011-9378-2 – volume: 362 start-page: 273 year: 2006 ident: 3076_CR4 publication-title: Theoret Comput Sci doi: 10.1016/j.tcs.2006.07.011 – volume: 1 start-page: 331 year: 1977 ident: 3076_CR12 publication-title: Ann Discrete Math doi: 10.1016/S0167-5060(08)70742-8 – volume: 58 start-page: 458 year: 2010 ident: 3076_CR15 publication-title: Oper Res doi: 10.1287/opre.1090.0744 – volume: 15 start-page: 629 year: 2012 ident: 3076_CR16 publication-title: J Sched doi: 10.1007/s10951-011-0253-x – volume: 23 start-page: 1985 year: 2012 ident: 3076_CR20 publication-title: J Intel Manuf doi: 10.1007/s10845-011-0525-5 – volume: 8 start-page: 537 year: 2005 ident: 3076_CR25 publication-title: J Sched doi: 10.1007/s10951-005-4997-z – volume: 60 start-page: 534 issue: 4 year: 2011 ident: 3076_CR6 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2010.12.008 – volume: 468 start-page: 114 year: 2013 ident: 3076_CR26 publication-title: Theory Comput Sci doi: 10.1016/j.tcs.2012.11.002 – volume: 121 start-page: 1 year: 2000 ident: 3076_CR19 publication-title: European J Oper Res doi: 10.1016/S0377-2217(98)00367-1 – volume: 37 start-page: 7071 year: 2013 ident: 3076_CR9 publication-title: Appl Math Model doi: 10.1016/j.apm.2013.03.013 – volume: 52 start-page: 229 year: 2004 ident: 3076_CR1 publication-title: Oper Res doi: 10.1287/opre.1030.0092 – volume: 217 start-page: 8804 issue: 21 year: 2011 ident: 3076_CR7 publication-title: Appl Math Comput doi: 10.1016/j.amc.2011.04.005 – volume: 219 start-page: 1674 year: 2012 ident: 3076_CR21 publication-title: Appl Math Comput doi: 10.1016/j.amc.2012.08.008 – volume: 15 start-page: 483 year: 1990 ident: 3076_CR8 publication-title: Math Oper Res doi: 10.1287/moor.15.3.483 – volume: 6 start-page: 7 year: 2003 ident: 3076_CR3 publication-title: J Sched doi: 10.1023/A:1022231419049 |
| SSID | ssj0001474558 ssj0064147 |
| Score | 1.9453775 |
| Snippet | We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal... |
| SourceID | crossref springer |
| SourceType | Index Database Publisher |
| StartPage | 93 |
| SubjectTerms | Applications of Mathematics Mathematics Mathematics and Statistics |
| Title | Two-agent single machine scheduling with forbidden intervals |
| URI | https://link.springer.com/article/10.1007/s11766-015-3076-2 |
| Volume | 30 |
| WOSCitedRecordID | wos000351081900007&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 | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLink Contemporary Journals customDbUrl: eissn: 1993-0445 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0064147 issn: 1005-1031 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5SPejBt1hf5OBJCXSTbHYDXkQsXiyiVXpb8oSCbqW76t93ku5aC3rQ84ZNGCb55vkNQqc-V9KIniROSAsOiqFEe0uJFd76VGvHvYnDJrLBIB-N5F3Tx1211e5tSjK-1PNmt8BlCK5vGuIlgsC7uwxolwVVvn94mgdWeMa_UYYLnsQpY8mMcpMlbWrzp18ugtNiZjQCTn_jX0fdROuNfYkvZwqxhZZcuY3Wbr_IWasddDH8mBAVWqpwCBQ8O_wSKyodBk8XkCc0qOMQn8Vg0OpAMVLicSyNBFXdRY_96-HVDWmGKBAD6FQTbbwEk0hJL3LJU-eCz6epSq1LVCo8GFSGy3BM7RMKV1IrpjPPGLUZ9zlje6hTTkq3j3DOrKXOca0FfPJSs54xmdKJS22uheyis1Z6xeuMK6OYsyIHkRQgkiLsVdAuOm9lVzTXpvp99cGfVh-iVRqEH0vFjlCnnr65Y7Ri3utxNT2J6vIJl7m5NA |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD6ICuqDd3Fe8-CTEliTNG3AFxHHxG0ITtlbaW4w0E7WqX_fJGudA33Q54Y2nJ7kXL_vAJzZNBeKNwU2XGgXoCiCpdUEa261jaU0zKowbCLp9dLBQNxXOO6y7navS5Lhpp6B3TyXoQt9Y58v4djdu0vMGawA2np4miVWWMK-UYZzFoUpY9GUcpNGdWnzp1fOG6f5ymgwOK2Nf211E9Yr_xJdTRViCxZMsQ1r3S9y1nIHLvsfI5x7SBXyiYJng15CR6VBLtJ1lscD1JHPzyLn0EpPMVKgYWiNdKq6C4-tm_51G1dDFLBy1mmCpbLCuUS5sDwVLDbGx3yS5LE2UR5z6xwqxYTfprQRcUdS5lQmllKiE2ZTSvdgsRgVZh9QSrUmxjApuXtkhaRNpZJcRibWqeSiAee19LLXKVdGNmNF9iLJnEgy_62MNOCill1WHZvy99UHf1p9CivtfreTdW57d4ewSvyPCG1jR7A4Gb-ZY1hW75NhOT4JqvMJPSq8Dw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JSwMxFA5SRfTgLtY1B09KaLNMZgJeRC2KWopW6W2YbFDQaemM-vdNZrEW9CCeE5Lw8pK3fw-AYxslQvG2QIYL7QwURZC0miDNrbaBlIZZVTSbCLvdaDAQvarPaVZnu9chybKmwaM0pXlrrG1rWvjmcQ2dGRx43wlH7g-eZ7gdefD8h8fnqZOFhewbfDhnuOg4hkv4TYrrMOdPS84KqtkoaSF8Oqv_PvYaWKn0TnheMso6mDPpBli-_wJtzTbBWf9jhBJfagW9A-HFwNci09JAZwE7ieQL16H320Kn6EoPPZLCYZEy6Vh4Czx1rvoX16hqroCUk1o5ksoKpyolwvJIsMAYbwtKkgTa4CTg1ilaigl_TGkxcU9VJlSGllKiQ2YjSrdBIx2lZgfAiGpNjGFScjdkhaRtpcJEYhPoSHLRBCc1JeNxiaERT9GSPUliR5LY7xWTJjit6RhXzyn7ffbun2YfgcXeZSe-u-ne7oEl4u-hyCbbB4188mYOwIJ6z4fZ5LDgok_hU8Tz |
| 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=Two-agent+single+machine+scheduling+with+forbidden+intervals&rft.jtitle=Applied+Mathematics-A+Journal+of+Chinese+Universities&rft.au=Feng%2C+Qi&rft.au=Li%2C+Shi-sheng&rft.au=Shang%2C+Wei-ping&rft.date=2015-03-01&rft.issn=1005-1031&rft.eissn=1993-0445&rft.volume=30&rft.issue=1&rft.spage=93&rft.epage=101&rft_id=info:doi/10.1007%2Fs11766-015-3076-2&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11766_015_3076_2 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1005-1031&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1005-1031&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1005-1031&client=summon |