Bicriteria scheduling of equal length jobs on uniform parallel machines

We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can b...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 39; číslo 3; s. 637 - 661
Hlavní autoři:	Zhao, Qiulan, Yuan, Jinjiang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2020 Springer Nature B.V
Témata:	Combinatorics Completion time Convex and Discrete Geometry Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Production scheduling Sarin Scheduling Theory of Computation Uniform parallel machines NP-hardness Generated completion times Bicriteria scheduling Polynomial time algorithm
ISSN:	1382-6905, 1573-2886
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 study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can be polynomially transformed into the single-machine GCT-scheduling with a special setting of generated completion times. In the GCT-scheduling, a sequence of completion times is given in advance and the job scheduled at the i -th position will be assigned the i -th completion time. We present a comprehensive study on the complexities of the bicriteria single-machine GCT-scheduling problems with respect to various regular criteria. We then turn these complexity results into the forms of bicriteria scheduling of equal length jobs on uniform (or identical) parallel machines. Our research generalizes the existing results on bicriteria scheduling of equal length jobs in the literature. Particularly, one of our results solves the open problem posed by Sarin and Prakash (J Comb Optim 8:227–240, 2004), which asks for minimizing the total weighted completion time subject to the optimality of minimizing the total number of tardy jobs on identical parallel machines, and we show that this problem is solvable in polynomial time.
AbstractList	We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can be polynomially transformed into the single-machine GCT-scheduling with a special setting of generated completion times. In the GCT-scheduling, a sequence of completion times is given in advance and the job scheduled at the i-th position will be assigned the i-th completion time. We present a comprehensive study on the complexities of the bicriteria single-machine GCT-scheduling problems with respect to various regular criteria. We then turn these complexity results into the forms of bicriteria scheduling of equal length jobs on uniform (or identical) parallel machines. Our research generalizes the existing results on bicriteria scheduling of equal length jobs in the literature. Particularly, one of our results solves the open problem posed by Sarin and Prakash (J Comb Optim 8:227–240, 2004), which asks for minimizing the total weighted completion time subject to the optimality of minimizing the total number of tardy jobs on identical parallel machines, and we show that this problem is solvable in polynomial time. We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can be polynomially transformed into the single-machine GCT-scheduling with a special setting of generated completion times. In the GCT-scheduling, a sequence of completion times is given in advance and the job scheduled at the i -th position will be assigned the i -th completion time. We present a comprehensive study on the complexities of the bicriteria single-machine GCT-scheduling problems with respect to various regular criteria. We then turn these complexity results into the forms of bicriteria scheduling of equal length jobs on uniform (or identical) parallel machines. Our research generalizes the existing results on bicriteria scheduling of equal length jobs in the literature. Particularly, one of our results solves the open problem posed by Sarin and Prakash (J Comb Optim 8:227–240, 2004), which asks for minimizing the total weighted completion time subject to the optimality of minimizing the total number of tardy jobs on identical parallel machines, and we show that this problem is solvable in polynomial time.
Author	Yuan, Jinjiang Zhao, Qiulan
Author_xml	– sequence: 1 givenname: Qiulan surname: Zhao fullname: Zhao, Qiulan organization: Department of Mathematics, Nanjing University – sequence: 2 givenname: Jinjiang orcidid: 0000-0002-9814-615X surname: Yuan fullname: Yuan, Jinjiang email: yuanjj@zzu.edu.cn organization: School of Mathematics and Statistics, Zhengzhou University
BookMark	eNp9kEFLAzEQhYNUsK3-AU8Bz6uTZHeTPWrRKhS86DmkadKmbJM22aX4701dQfDQ0zxm3jczvAka-eANQrcE7gkAf0gEBBcFkKYAqIAXxws0JhVnBRWiHmXNBC3qBqorNElpCwBZl2M0f3I6us5Ep3DSG7PqW-fXOFhsDr1qcWv8utvgbVgmHDzuvbMh7vBeRdW2psU7pTfOm3SNLq1qk7n5rVP0-fL8MXstFu_zt9njotCMNF1BKtosuV3SclWJmhnV1Fppoa0BILlLyoaa2vLThIEVvF7ZUjRECEU1s5ZN0d2wdx_DoTepk9vQR59PSso450AbKrKLDi4dQ0rRWLmPbqfilyQgT4HJITCZA5M_gcljhsQ_SLtOdS74LirXnkfZgKZ8x69N_PvqDPUNBviCqA
CitedBy_id	crossref_primary_10_1016_j_ejor_2021_10_064 crossref_primary_10_1016_j_ejor_2025_01_034 crossref_primary_10_1002_nav_22050 crossref_primary_10_1007_s10878_021_00722_4 crossref_primary_10_1007_s10288_021_00480_3 crossref_primary_10_1007_s10878_025_01271_w crossref_primary_10_1007_s11590_022_01889_3 crossref_primary_10_1016_j_cor_2024_106709 crossref_primary_10_1016_j_tcs_2024_114729 crossref_primary_10_1016_j_cam_2024_116380 crossref_primary_10_3390_math10091553 crossref_primary_10_1080_00207543_2025_2525534 crossref_primary_10_1002_nav_22103 crossref_primary_10_1007_s10878_021_00697_2 crossref_primary_10_1007_s10951_023_00779_5 crossref_primary_10_1016_j_dam_2025_03_026
Cites_doi	10.1023/B:JOCO.0000038909.06086.ed 10.1111/j.1467-9574.1990.tb01276.x 10.1016/j.disopt.2019.06.002 10.1016/j.ejor.2020.07.064 10.1002/nav.3800030106 10.1287/opre.1030.0092 10.1016/j.ejor.2004.07.011 10.1016/j.disopt.2017.01.001 10.1016/j.ejor.2015.01.003 10.1007/978-3-642-41880-8 10.1016/S0305-0548(98)80005-1 10.1007/s10951-010-0201-1 10.1007/s10479-012-1099-0
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC, part of Springer Nature 2019 2019© Springer Science+Business Media, LLC, part of Springer Nature 2019
Copyright_xml	– notice: Springer Science+Business Media, LLC, part of Springer Nature 2019 – notice: 2019© Springer Science+Business Media, LLC, part of Springer Nature 2019
DBID	AAYXX CITATION
DOI	10.1007/s10878-019-00507-w
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics
EISSN	1573-2886
EndPage	661
ExternalDocumentID	10_1007_s10878_019_00507_w
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: NSFC (11671368); NSFC (11801266) funderid: http://dx.doi.org/10.13039/501100001809
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 ABJCF ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA AZQEC BENPR BGLVJ CCPQU CITATION DWQXO GNUQQ HCIFZ M2P M7S PHGZM PHGZT PQGLB PTHSS
ID	FETCH-LOGICAL-c319t-1529b7fb24d5863ea96cac8cfe001b241492e6f73ea930f876df489188a2c3ff3
IEDL.DBID	RSV
ISICitedReferencesCount	20
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000500463200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1382-6905
IngestDate	Wed Sep 17 23:55:42 EDT 2025 Sat Nov 29 04:54:26 EST 2025 Tue Nov 18 22:35:14 EST 2025 Fri Feb 21 02:33:47 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Uniform parallel machines NP-hardness Generated completion times Bicriteria scheduling Polynomial time algorithm
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c319t-1529b7fb24d5863ea96cac8cfe001b241492e6f73ea930f876df489188a2c3ff3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9814-615X
PQID	2377702928
PQPubID	2043856
PageCount	25
ParticipantIDs	proquest_journals_2377702928 crossref_primary_10_1007_s10878_019_00507_w crossref_citationtrail_10_1007_s10878_019_00507_w springer_journals_10_1007_s10878_019_00507_w
PublicationCentury	2000
PublicationDate	2020-04-01
PublicationDateYYYYMMDD	2020-04-01
PublicationDate_xml	– month: 04 year: 2020 text: 2020-04-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Dordrecht
PublicationTitle	Journal of combinatorial optimization
PublicationTitleAbbrev	J Comb Optim
PublicationYear	2020
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	TuzikovAMakhaniokMMannerRBicriterion scheduling of identical processing time jobs by uniform processorsComput Oper Res1998253135160715510.1016/S0305-0548(98)80005-1 OronDShabtayDSteinerGSingle machine scheduling with two competing agents and equal job processing timesEur J Oper Res20152448699332076810.1016/j.ejor.2015.01.003 AgnetisAMirchandaniPBPacciarelliDPacificiAScheduling problems with two competing agentsOper Res200452229242206639810.1287/opre.1030.0092 DessoukyMILagewegBJLenstraJKVan de VeldeSLScheduling identical jobs on uniform parallel machinesStat Neerl199044115123109435310.1111/j.1467-9574.1990.tb01276.x ChenRBYuanJJLuLFSingle-machine scheduling with positional due indices and positional deadlinesDiscrete Optim2019402872610.1016/j.disopt.2019.06.00207138072 SarinSCPrakashDEqual processing time bicriteria scheduling on parallel machinesJ Comb Optim20048227240209225910.1023/B:JOCO.0000038909.06086.ed Wan L, Du JZ, Lai KK (2019) CO-agent scheduling to minimize total weighted completion time and total weighted number of tardy jobs with unit processing times. In submission SadiFSoukhalAmulti-agent scheduling problems with a global agent and equal length jobsDiscrete Optim20172393104361096810.1016/j.disopt.2017.01.001 HoogeveenHMulticriteria schedulingEur J Oper Res2005167592623215706110.1016/j.ejor.2004.07.011 ElvikisDHamacherHWT’kindtVScheduling two agents on uniform parallel machines with makespan and cost functionsJ Sched201114471481283444210.1007/s10951-010-0201-1 SmithWEVarious optimizers for single-stage productionNav Res Logist Q1956159668910910.1002/nav.3800030106 ElvikisDT’kindtVTwo-agent scheduling on uniform parallel machines with min–max criteriaAnn Oper Res20142137994315287310.1007/s10479-012-1099-0 LawlerELCombinatorial optimization: networks and matroids1976New YorkHolt, Rinehart and Winston0413.90040 AgnetisABillautJCGawiejnowiczSPacciarelliDSoukhalAMultiagent scheduling: models and algorithms2014BerlinSpringer10.1007/978-3-642-41880-8 T’kindtVBillautJCMulticriteria scheduling: theory, models and algorithms20062BerlinSpringer1126.90002 D Elvikis (507_CR5) 2011; 14 EL Lawler (507_CR8) 1976 F Sadi (507_CR10) 2017; 23 WE Smith (507_CR12) 1956; 1 D Elvikis (507_CR6) 2014; 213 H Hoogeveen (507_CR7) 2005; 167 A Agnetis (507_CR2) 2004; 52 507_CR15 MI Dessouky (507_CR4) 1990; 44 V T’kindt (507_CR13) 2006 D Oron (507_CR9) 2015; 244 RB Chen (507_CR3) 2019 A Agnetis (507_CR1) 2014 SC Sarin (507_CR11) 2004; 8 A Tuzikov (507_CR14) 1998; 25
References_xml	– reference: ElvikisDT’kindtVTwo-agent scheduling on uniform parallel machines with min–max criteriaAnn Oper Res20142137994315287310.1007/s10479-012-1099-0 – reference: SadiFSoukhalAmulti-agent scheduling problems with a global agent and equal length jobsDiscrete Optim20172393104361096810.1016/j.disopt.2017.01.001 – reference: LawlerELCombinatorial optimization: networks and matroids1976New YorkHolt, Rinehart and Winston0413.90040 – reference: ChenRBYuanJJLuLFSingle-machine scheduling with positional due indices and positional deadlinesDiscrete Optim2019402872610.1016/j.disopt.2019.06.00207138072 – reference: SarinSCPrakashDEqual processing time bicriteria scheduling on parallel machinesJ Comb Optim20048227240209225910.1023/B:JOCO.0000038909.06086.ed – reference: T’kindtVBillautJCMulticriteria scheduling: theory, models and algorithms20062BerlinSpringer1126.90002 – reference: AgnetisABillautJCGawiejnowiczSPacciarelliDSoukhalAMultiagent scheduling: models and algorithms2014BerlinSpringer10.1007/978-3-642-41880-8 – reference: SmithWEVarious optimizers for single-stage productionNav Res Logist Q1956159668910910.1002/nav.3800030106 – reference: TuzikovAMakhaniokMMannerRBicriterion scheduling of identical processing time jobs by uniform processorsComput Oper Res1998253135160715510.1016/S0305-0548(98)80005-1 – reference: Wan L, Du JZ, Lai KK (2019) CO-agent scheduling to minimize total weighted completion time and total weighted number of tardy jobs with unit processing times. In submission – reference: AgnetisAMirchandaniPBPacciarelliDPacificiAScheduling problems with two competing agentsOper Res200452229242206639810.1287/opre.1030.0092 – reference: ElvikisDHamacherHWT’kindtVScheduling two agents on uniform parallel machines with makespan and cost functionsJ Sched201114471481283444210.1007/s10951-010-0201-1 – reference: DessoukyMILagewegBJLenstraJKVan de VeldeSLScheduling identical jobs on uniform parallel machinesStat Neerl199044115123109435310.1111/j.1467-9574.1990.tb01276.x – reference: HoogeveenHMulticriteria schedulingEur J Oper Res2005167592623215706110.1016/j.ejor.2004.07.011 – reference: OronDShabtayDSteinerGSingle machine scheduling with two competing agents and equal job processing timesEur J Oper Res20152448699332076810.1016/j.ejor.2015.01.003 – volume: 8 start-page: 227 year: 2004 ident: 507_CR11 publication-title: J Comb Optim doi: 10.1023/B:JOCO.0000038909.06086.ed – volume: 44 start-page: 115 year: 1990 ident: 507_CR4 publication-title: Stat Neerl doi: 10.1111/j.1467-9574.1990.tb01276.x – year: 2019 ident: 507_CR3 publication-title: Discrete Optim doi: 10.1016/j.disopt.2019.06.002 – ident: 507_CR15 doi: 10.1016/j.ejor.2020.07.064 – volume: 1 start-page: 59 year: 1956 ident: 507_CR12 publication-title: Nav Res Logist Q doi: 10.1002/nav.3800030106 – volume-title: Combinatorial optimization: networks and matroids year: 1976 ident: 507_CR8 – volume: 52 start-page: 229 year: 2004 ident: 507_CR2 publication-title: Oper Res doi: 10.1287/opre.1030.0092 – volume: 167 start-page: 592 year: 2005 ident: 507_CR7 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.07.011 – volume: 23 start-page: 93 year: 2017 ident: 507_CR10 publication-title: Discrete Optim doi: 10.1016/j.disopt.2017.01.001 – volume: 244 start-page: 86 year: 2015 ident: 507_CR9 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.01.003 – volume-title: Multicriteria scheduling: theory, models and algorithms year: 2006 ident: 507_CR13 – volume-title: Multiagent scheduling: models and algorithms year: 2014 ident: 507_CR1 doi: 10.1007/978-3-642-41880-8 – volume: 25 start-page: 31 year: 1998 ident: 507_CR14 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(98)80005-1 – volume: 14 start-page: 471 year: 2011 ident: 507_CR5 publication-title: J Sched doi: 10.1007/s10951-010-0201-1 – volume: 213 start-page: 79 year: 2014 ident: 507_CR6 publication-title: Ann Oper Res doi: 10.1007/s10479-012-1099-0
SSID	ssj0009054
Score	2.3082016
Snippet	We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling... We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	637
SubjectTerms	Combinatorics Completion time Convex and Discrete Geometry Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Production scheduling Sarin Scheduling Theory of Computation
Title	Bicriteria scheduling of equal length jobs on uniform parallel machines
URI	https://link.springer.com/article/10.1007/s10878-019-00507-w https://www.proquest.com/docview/2377702928
Volume	39
WOSCitedRecordID	wos000500463200001&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 1997-Present customDbUrl: eissn: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: RSV dateStart: 19970301 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/eLvHCXMwnV1LT8MwDI5gcIADb8RgoBy4QaU1fSVHQAwuTIiXdqvSNBagrkVrx_4-TteuAwESqKc0aVQ5cWwr_j4Tcixt0H4stGV7Eiw30KhSvsYmE4BPLLV2y2ITQb_PBwNxW4HC8jrbvb6SLE_qObAbN2ywBnTTRS_GmiySJTR33Kjj3f1TQ7Xb9aalbNF3xNjPq6Ay38_x2Rw1PuaXa9HS2vTW__efG2St8i7p2XQ7bJIFnW6R1TnOQWzdzIha821ydf6Cx4bha5YU41y0OwaeTjOg2sAtqamzUjzT1yzKaZbScWqAXENqCMOTRCd0WOZi6nyHPPYuHy6uraq2gqVQ6QpcGiaiACLmxh73HS2Fr6TiCjTaLXyLgRPTPgSmx-kCnpkxuFzYnEumHABnl7TSLNV7hLoQgRdFnq18cAFHGYCrAgciic6PiNvErkUcqop43NS_SMKGMtmILESRhaXIwkmbnMy-eZvSbvw6ulOvXFipYB4yJwiCLhOMt8lpvVJN98-z7f9t-AFZYSYGL7N5OqRVjMb6kCyr9-IlHx2VW_MDhvXfIQ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD3-J0ah5808Kafj-qOCduQ3TK3kqb5nCytbJu7t_30rXbFBWUPqVJQ7lLcnfkfr8DOA10lHbkSU23AtRMR9KWsiU1uYf0RIGUZlZswmm13E7Hu89BYWmR7V5cSWYn9RzYzVVssAp0UyUvRhsvwpJJFksl8j08Ps-odqvWpJQt-Y4U-1k5VOb7OT6bo5mP-eVaNLM2tY3__ecmrOfeJbuYLIctWJDxNqzNcQ5Sqzklak134OayS8eG4msOGMW5ZHcUPJ0lyKSCWzJVZ2X4wl6TMGVJzEaxAnL1mSIM7_Vkj_WzXEyZ7sJT7bp9Vdfy2gqaoE03JNVwL3Qw5GZkubYhA88WgXAFSrJb9JYCJy5tdFSPUUU6MyM0XU933YALA9HYg1KcxHIfmIkhWmFo6cJGE2mUArgKNDAMyPnxojLohYh9kROPq_oXPX9GmaxE5pPI_Exk_rgMZ9Nv3ia0G7-OrhSa8_MtmPrccBynyj3uluG80NSs--fZDv42_ARW6u1mw2_ctu4OYZWreDzL7KlAaTgYySNYFu_Dbjo4zpbpBwWN4gU
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgIAQH3ojBgBy4QbU2fR95DRAwTeKh3ao2jcXQ1k1rx_4-Ttc9QICEUE9p3Khy4thW8n0GOA4NlE7sS82wQ9QsV5JJOZKa3Ed64lBKKy824dbrXrPpN2ZQ_Plt9_GR5AjToFiakqzai7E6A3zzFDOsAuDoFNFow3lYsFTRIJWvP75MaXd1e1TWluJIygPtAjbz_RifXdM03vxyRJp7ntra__95HVaLqJOdjZbJBszJZBNWZrgIqfUwIXBNt-D6vEXbieJxDhnlv-SPFGyddZFJBcNkqv5K9sreulHKugkbJArg1WGKSLzdlm3Wye9oynQbnmtXTxc3WlFzQRNkjBlNGfcjFyNuxbbnmDL0HREKT6Akf0ZvKaHi0kFX9Zg60l4ao-X5hueFXJiI5g6Ukm4id4FZGKEdRbYhHLSQpBTwVaCJUUhBkR-XwRirOxAFIbmqi9EOplTKSmUBqSzIVRYMy3Ay-aY3ouP4VboynsWgMM004Kbrujr3uVeG0_GsTbt_Hm3vb-JHsNS4rAX3t_W7fVjmKk3PL_xUoJT1B_IAFsV71kr7h_mK_QCJiOrp
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=Bicriteria+scheduling+of+equal+length+jobs+on+uniform+parallel+machines&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Zhao+Qiulan&rft.au=Yuan+Jinjiang&rft.date=2020-04-01&rft.pub=Springer+Nature+B.V&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=39&rft.issue=3&rft.spage=637&rft.epage=661&rft_id=info:doi/10.1007%2Fs10878-019-00507-w&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