Heuristics for the Identical Machine Scheduling Problem with Preventive Maintenances
In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed pe...
Saved in:
| Published in | Shanghai jiao tong da xue xue bao Vol. 21; no. 1; pp. 112 - 120 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Shanghai
Shanghai Jiaotong University Press
01.02.2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1007-1172 1995-8188 |
| DOI | 10.1007/s12204-015-1690-z |
Cover
| Abstract | In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines＇ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time （LBT） and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time （MSPT） that both of the heuristics based on some properties of the optimal solutions. Computational experiments show are effective and efficient compared with the results obtained by CPLEX and the other algorithms. |
|---|---|
| AbstractList | In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines’ continuous working time cannot exceed a maximum allowed time
T
; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time (LBT) and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time (MSPT) based on some properties of the optimal solutions. Computational experiments show that both of the heuristics are effective and efficient compared with the results obtained by CPLEX and the other algorithms. In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines' continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time (LBT) and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time (MSPT) based on some properties of the optimal solutions. Computational experiments show that both of the heuristics are effective and efficient compared with the results obtained by CPLEX and the other algorithms. In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines＇ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time （LBT） and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time （MSPT） that both of the heuristics based on some properties of the optimal solutions. Computational experiments show are effective and efficient compared with the results obtained by CPLEX and the other algorithms. |
| Author | 江才林 陆志强 崔维伟 |
| AuthorAffiliation | Institute of Industrial Engineering, Tongji University, Shanghai 201804 China Department of Industrial Engineering and Logistics Management, Shanghai Jiaotong University, Shanghai 200240, China |
| Author_xml | – sequence: 1 fullname: 江才林 陆志强 崔维伟 |
| BookMark | eNp9kE1P3DAQQC1EpQLlB_QWceol7YydOPaxQm1BAlGpcLYcZ7IxytpgJ1TdX1-vFvXQAyd_6D2P9U7ZcYiBGPuI8BkBui8ZOYemBmxrlBrq3RE7Qa3bWqFSx2VfoBqx4-_Zac6PAA0IoU_Y_RWtyefFu1yNMVXLRNX1QKFc2Lm6tW7ygapfbqJhnX3YVD9T7GfaVr_9MpUDvezZFyqoDwsFGxzlD-zdaOdM56_rGXv4_u3-8qq-uftxffn1pnZCiF1N7aCxH4eRC6CGDw3IUfcge3SdBQWNVsj7vkVu9agcSN1LJxVYBW0vlBJn7NPh3acUn1fKi9n67GiebaC4ZoNKtBIbgbygeEBdijknGs1T8lub_hgEs49jDgVNKWj2Bc2uON1_jvOLXXwMS7J-ftPkBzOXKWFDyTzGNYXS4k3p4nXcFMPmuXj__ihlpwV0TSv-Aimgk2I |
| CitedBy_id | crossref_primary_10_1108_JQME_05_2023_0047 crossref_primary_10_1080_21681015_2021_1883131 crossref_primary_10_5817_CP2021_4_7 |
| Cites_doi | 10.1016/j.camwa.2010.08.003 10.1016/j.amc.2009.11.040 10.1016/j.ijpe.2009.10.018 10.1007/BF00121681 10.1016/j.ejor.2007.06.029 10.1016/j.cor.2005.05.034 10.1016/j.camwa.2011.09.016 10.1057/palgrave.jors.2600791 10.1016/j.apm.2013.03.001 10.1016/j.ejor.2006.11.027 10.1016/j.cor.2007.10.013 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 10.1016/j.cor.2006.08.015 10.1002/(SICI)1520-6750(200003)47:2<85::AID-NAV1>3.0.CO;2-C |
| ContentType | Journal Article |
| Copyright | Shanghai Jiaotong University and Springer-Verlag Berlin Heidelberg 2016 |
| Copyright_xml | – notice: Shanghai Jiaotong University and Springer-Verlag Berlin Heidelberg 2016 |
| DBID | 2RA 92L CQIGP W92 ~WA AAYXX CITATION 7SC 7SP 7SR 7TB 7U5 8BQ 8FD FR3 JG9 JQ2 KR7 L7M L~C L~D |
| DOI | 10.1007/s12204-015-1690-z |
| DatabaseName | 中文科技期刊数据库 中文科技期刊数据库-CALIS站点 中文科技期刊数据库-7.0平台 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Mechanical & Transportation Engineering Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database Engineering Research Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Materials Research Database Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts METADEX Computer and Information Systems Abstracts Professional Engineered Materials Abstracts Solid State and Superconductivity Abstracts Engineering Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitleList | Materials Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) Engineering Architecture Computer Science |
| DocumentTitleAlternate | Heuristics for the Identical Machine Scheduling Problem with Preventive Maintenances |
| EISSN | 1995-8188 |
| EndPage | 120 |
| ExternalDocumentID | 10_1007_s12204_015_1690_z 667930745 |
| GroupedDBID | -5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 188 1N0 29~ 2B. 2C0 2J2 2JN 2JY 2KG 2KM 2LR 2RA 2VQ 2~H 30V 4.4 406 408 40D 40E 5GY 5VR 5VS 6NX 8RM 8TC 92H 92I 92L 92R 93N 95- 95. 95~ 96X AAAVM AABHQ AAFGU AAHNG AAIAL AAJKR AANZL AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABDZT ABECU ABFGW ABFTV ABHQN ABJNI ABJOX ABKAS ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACBMV ACBRV ACBXY ACBYP ACGFS ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPRK ACSNA ACTTH ACVWB ACWMK ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFTE AEGAL AEGNC AEJHL AEJRE AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFGCZ AFLOW AFNRJ AFQWF AFRAH AFUIB AFWTZ AFZKB AGAYW AGDGC AGGBP AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD B-. BA0 BDATZ BGNMA CAG CCEZO CEKLB CHBEP COF CQIGP CS3 CSCUP CW9 DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FA0 FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 HF~ HG6 HLICF HMJXF HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD I~X I~Z J-C JBSCW JZLTJ KOV LLZTM M4Y MA- NPVJJ NQJWS NU0 O9- O9J OK1 P9P PF0 PT4 QOS R89 R9I RIG ROL RPX RSV S16 S1Z S27 S3B SAP SCL SDH SEG SHX SISQX SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TCJ TGT TSG TSV TUC U2A UG4 UGNYK UNUBA UOJIU UTJUX UZ4 UZXMN VC2 VFIZW W48 W92 WK8 YLTOR Z7R Z7Z Z85 ZMTXR ~A9 ~WA -SC -S~ AACDK AAJBT AASML AAXDM AAYZH ABAKF ACDTI ACPIV AEFQL AEMSY AFBBN AGQEE AGRTI AIGIU CAJEC H13 Q-- SJYHP U1G U5M UY8 AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION 7SC 7SP 7SR 7TB 7U5 8BQ 8FD ABRTQ FR3 JG9 JQ2 KR7 L7M L~C L~D |
| ID | FETCH-LOGICAL-c333z-e5d91bfdf230e42d406f9b06b1c7a08049812bb512a9f8c069b6c680a805b3883 |
| IEDL.DBID | AGYKE |
| ISSN | 1007-1172 |
| IngestDate | Fri Sep 05 14:33:04 EDT 2025 Tue Jul 01 02:23:55 EDT 2025 Thu Apr 24 23:08:29 EDT 2025 Fri Feb 21 02:37:21 EST 2025 Wed Feb 14 10:22:11 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | heuristic F 224.9 unavailability constraints identical machine scheduling |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c333z-e5d91bfdf230e42d406f9b06b1c7a08049812bb512a9f8c069b6c680a805b3883 |
| Notes | 31-1943/U identical machine scheduling, unavailability constraints, heuristic JIANG Cailin, LU Zhiqiang, CUI Weiwei（1. Institute of Industrial Engineering, Tongji University, Shanghai 201804 China; 2. Department of Industrial Engineering and Logistics Management, Shanghai Jiaotong University, Shanghai 200240, China） In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions for the identical machine scheduling problem with unavailability constraints. In the first model, the maintenance activities are performed periodically and the objective is to minimize the makespan. In the second model, the maintenance activities are flexible and the machines＇ continuous working time cannot exceed a maximum allowed time T; the objective is to minimize the total completion time of jobs. For the first problem, we propose a heuristic longest batch time （LBT） and prove that the worst case error bound of LBT is 2. For the second problem, we develop a heuristic modified smallest processing time （MSPT） that both of the heuristics based on some properties of the optimal solutions. Computational experiments show are effective and efficient compared with the results obtained by CPLEX and the other algorithms. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1835614312 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1835614312 crossref_primary_10_1007_s12204_015_1690_z crossref_citationtrail_10_1007_s12204_015_1690_z springer_journals_10_1007_s12204_015_1690_z chongqing_primary_667930745 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20160200 |
| PublicationDateYYYYMMDD | 2016-02-01 |
| PublicationDate_xml | – month: 2 year: 2016 text: 20160200 |
| PublicationDecade | 2010 |
| PublicationPlace | Shanghai |
| PublicationPlace_xml | – name: Shanghai |
| PublicationTitle | Shanghai jiao tong da xue xue bao |
| PublicationTitleAbbrev | J. Shanghai Jiaotong Univ. (Sci.) |
| PublicationTitleAlternate | Journal of Shanghai Jiaotong university |
| PublicationYear | 2016 |
| Publisher | Shanghai Jiaotong University Press |
| Publisher_xml | – name: Shanghai Jiaotong University Press |
| References | Sun, Li (CR12) 2010; 124 Yang, Yang (CR1) 2010; 60 Xu, Yang (CR8) 2013; 37 Molaee, Moslehi, Reisi (CR2) 2011; 62 Ji, He, Chen (CR14) 2007; 34 Cui, Lu (CR3) 2012; 46 Hsu, Low, Su (CR7) 2010; 215 Lee, Chen (CR11) 2000; 47 Liao, Gwo (CR5) 2008; 184 Lee (CR4) 1996; 9 Kubzin, Potts, Strusevich (CR6) 2009; 36 Xu, Sun, Li (CR13) 2008; 35 Qi, Chen, Tu (CR9) 1999; 50 Chen (CR10) 2008; 190 M A Kubzin (1690_CR6) 2009; 36 W W Cui (1690_CR3) 2012; 46 J S Chen (1690_CR10) 2008; 190 E Molaee (1690_CR2) 2011; 62 X Qi (1690_CR9) 1999; 50 S J Yang (1690_CR1) 2010; 60 C Y Lee (1690_CR4) 1996; 9 D H Xu (1690_CR13) 2008; 35 L W Liao (1690_CR5) 2008; 184 C Y Lee (1690_CR11) 2000; 47 D H Xu (1690_CR8) 2013; 37 K B Sun (1690_CR12) 2010; 124 M Ji (1690_CR14) 2007; 34 C J Hsu (1690_CR7) 2010; 215 |
| References_xml | – volume: 60 start-page: 2161 issue: 7 year: 2010 end-page: 2169 ident: CR1 article-title: Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities [J] publication-title: Computers and Mathematics with Applications doi: 10.1016/j.camwa.2010.08.003 – volume: 46 start-page: 2009 issue: 12 year: 2012 end-page: 2013 ident: CR3 article-title: Integrating production scheduling and preventive maintenance planning for a single machine [J] publication-title: Journal of Shanghai Jiaotong University – volume: 215 start-page: 3929 issue: 11 year: 2010 end-page: 3935 ident: CR7 article-title: A single-machine scheduling problem with maintenance activities to minimize makespan [J] publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2009.11.040 – volume: 124 start-page: 151 issue: 1 year: 2010 end-page: 158 ident: CR12 article-title: Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines [J] publication-title: International Journal of Production Economic doi: 10.1016/j.ijpe.2009.10.018 – volume: 9 start-page: 395 issue: 3 year: 1996 end-page: 416 ident: CR4 article-title: Machine scheduling with an availability constraint [J] publication-title: Journal of Global Optimization doi: 10.1007/BF00121681 – volume: 190 start-page: 90 issue: 1 year: 2008 end-page: 120 ident: CR10 article-title: Scheduling of non resumable jobs and flexible maintenance activities on a single machine to minimize makespan [J] publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.06.029 – volume: 34 start-page: 1764 issue: 6 year: 2007 end-page: 1770 ident: CR14 article-title: Single-machine scheduling with periodic maintenance to minimize makespan [J] publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.05.034 – volume: 62 start-page: 3622 issue: 9 year: 2011 end-page: 3641 ident: CR2 article-title: Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint [J] publication-title: Computers and Mathematics with Applications doi: 10.1016/j.camwa.2011.09.016 – volume: 50 start-page: 1071 issue: 10 year: 1999 end-page: 1078 ident: CR9 article-title: Scheduling the maintenance on a single machine [J] publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600791 – volume: 37 start-page: 7561 issue: 14 year: 2013 end-page: 7567 ident: CR8 article-title: Makespan minimization for two parallel machines scheduling with a periodic availability constraint: Mathematical programming model, average-case analysis, and anomalies [J] publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2013.03.001 – volume: 184 start-page: 458 issue: 2 year: 2008 end-page: 467 ident: CR5 article-title: Parallel machine scheduling with machine availability and eligibility constraints [J] publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.11.027 – volume: 36 start-page: 379 issue: 2 year: 2009 end-page: 390 ident: CR6 article-title: Approximation results for flow shop scheduling problems with machine availability constraints [J] publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.10.013 – volume: 47 start-page: 85 issue: 2 year: 2000 end-page: 183 ident: CR11 article-title: Scheduling of jobs and maintenance activities on parallel machines [J] publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 – volume: 35 start-page: 1344 issue: 4 year: 2008 end-page: 1349 ident: CR13 article-title: Parallel machine scheduling with almost periodic maintenance and nonpreemptive jobs to minimize makespan [J] publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.08.015 – volume: 37 start-page: 7561 issue: 14 year: 2013 ident: 1690_CR8 publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2013.03.001 – volume: 47 start-page: 85 issue: 2 year: 2000 ident: 1690_CR11 publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(200003)47:2<85::AID-NAV1>3.0.CO;2-C – volume: 62 start-page: 3622 issue: 9 year: 2011 ident: 1690_CR2 publication-title: Computers and Mathematics with Applications doi: 10.1016/j.camwa.2011.09.016 – volume: 36 start-page: 379 issue: 2 year: 2009 ident: 1690_CR6 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.10.013 – volume: 46 start-page: 2009 issue: 12 year: 2012 ident: 1690_CR3 publication-title: Journal of Shanghai Jiaotong University – volume: 9 start-page: 395 issue: 3 year: 1996 ident: 1690_CR4 publication-title: Journal of Global Optimization doi: 10.1007/BF00121681 – volume: 190 start-page: 90 issue: 1 year: 2008 ident: 1690_CR10 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.06.029 – volume: 184 start-page: 458 issue: 2 year: 2008 ident: 1690_CR5 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.11.027 – volume: 34 start-page: 1764 issue: 6 year: 2007 ident: 1690_CR14 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.05.034 – volume: 35 start-page: 1344 issue: 4 year: 2008 ident: 1690_CR13 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.08.015 – volume: 60 start-page: 2161 issue: 7 year: 2010 ident: 1690_CR1 publication-title: Computers and Mathematics with Applications doi: 10.1016/j.camwa.2010.08.003 – volume: 215 start-page: 3929 issue: 11 year: 2010 ident: 1690_CR7 publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2009.11.040 – volume: 124 start-page: 151 issue: 1 year: 2010 ident: 1690_CR12 publication-title: International Journal of Production Economic doi: 10.1016/j.ijpe.2009.10.018 – volume: 50 start-page: 1071 issue: 10 year: 1999 ident: 1690_CR9 publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600791 |
| SSID | ssj0040339 |
| Score | 1.9802716 |
| Snippet | In this paper, two mixed integer programming models integrating production scheduling and preventive maintenances are proposed to derive the optimal solutions... |
| SourceID | proquest crossref springer chongqing |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 112 |
| SubjectTerms | Algorithms Architecture Completion time Computer Science Electrical Engineering Engineering Heuristic Life Sciences Maintenance Materials Science Mathematical models Optimization Permissible error Scheduling |
| Title | Heuristics for the Identical Machine Scheduling Problem with Preventive Maintenances |
| URI | http://lib.cqvip.com/qk/85391X/201601/667930745.html https://link.springer.com/article/10.1007/s12204-015-1690-z https://www.proquest.com/docview/1835614312 |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED90vqjgdCrOLyL44AeRtGm75nGIOhR82kCfQtOmKmqndvNhf72XLtlUVPCxJUlb7nL3S-_udwD7LcTIPIgCynSS00BwjybMz6gWWStpcR3GusryvY46veDyJryxddyly3Z3IcnKUk-L3Xy_ypgIqQnt0NEszIVeLOIazLUvbq_OnAEOGK8aiJlZ1EMH7YKZPy1iKBXu-8XdKz7wq2ua4s1vIdLK85zXoeveeZxw8ngyHKiTdPSNzvGfH7UMSxaJkvZYdVZgRhcNWGx_Ciw0oO6aPhBrAxqw8InBsAEr9n5JDiyB9eEqdDt6aAmgCWJighiTPFQFwagQ5LlK39QEj9Xo5kw1PLFdbYj5KYwXY1Kpd41DDZuFoQTR5Rr0zs-6px1quzfQlHM-ojrMhKfyLMdDjg78DJFDLhSLlJe2EsSpgUBsoRQCjkTkccoioaI0ilkSs1DxOObrUCv6hd4AohFV5CrwslygjUGtyvDUxhNEKsYACdaErYkQ5cuYpUNGEZoeBEhhE5gTq0wt8bnpv_Ekp5TNRgoSpSCNFOSoCUeTKW69PwbvOV2RuDdNwCUpdH9YSjSXhmiVe34Tjp38pTUS5e8rbv5r9BbMI4qzqeTbUBu8DfUOIqWB2rU7Yxdme377A4xlCac |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB2xHFgklgKilMVIHFhkyYmTND5WCFTWUytxs-LEASRIgbQc-vWMU5sWBEgcE9mO5BfPPHvGbwAOmsiReRAFlOkkp4HgHk2Yn1EtsmbS5DqMdZXlexu1u8HlXXhn73GXLtvdhSQrSz2-7Ob7VcZESE1ohw6nYRa5QGzKFnT9ljO_AeNV-TDTh3ronl0o86chjKDCQ6-4f8XPfXVMY7b5LUBa-Z3zFViyhJG0RgivwpQuarDYmjj_r8Gyq81A7FKtwcKE0GANVu37khxanemjNei09cDqNBOkrgSpIHms7u0ibuS5yrLUBHe_6I3MpXVii88Qc3aLDyPtp3eNTY3ohFHu0OU6dM_POqdtaoss0JRzPqQ6zISn8izHvYgO_AwdfC4Ui5SXNhOkk4FACqAU8oJE5HHKIqGiNIpZErNQ8TjmGzBT9Aq9CUSj889V4GW5QFOA4Ge4ueIJEgpjJwSrQ-NztuXLSExDRhFaCOQxYR2Ym3-ZWn1yUybjSY6VlQ18EuGTBj45rMPxZxc33h-N9x2oEpeQiYskhe4NSolWzeihcs-vw4lDW9q1XP4-4ta_Wu_BXLtzcy2vL26vGjCPxMtmf2_DTP9toHeQ3PTVbvUzfwAR7e6M |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB58gKjgY1VcnxE8-CCYNm23OS7qsj4QDy54C02bqqBdtbse9tc76SauigoeW5IUMpOZL52ZbwB2G4iReRAFlOkkp4HgHk2Yn1EtskbS4DqMdZXlexW1O8H5bXhr-5yWLtvdhSSHNQ2GpanoHT1n-dGo8M33q-yJkJowDx2MwyRaY88oesdvOlMcMF61EjNzqIeu2oU1f1rCkCvcd4u7F_z0Vyc1Qp7fgqWVD2otwJwFj6Q5lPYijOmiBrPNT7GAGsy7Pg3EHtsazHwiHazBon1fkj3LOb2_BDdt3beczQRhLEFYSB6qGl6UIXmqMi41wZsweiZTwE5sIxpi_uPiw5AH6k3jUENAYVg8dLkMndbpzXGb2oYLNOWcD6gOM-GpPMvxXqIDP0NnnwvFIuWljQShZSAQDiiFGCEReZyySKgojWKWxCxUPI75CkwU3UKvAtEIBHIVeFku0CygImR40eIJggtjMwSrw_rHbsvnIbGGjCK0Fohpwjowt_8ytVzlpmXGoxyxLBvxSRSfNOKTgzocfExx6_0xeMcJVeJxMjGSpNDdfinRwhluVO75dTh00pb2XJe_r7j2r9HbMHV90pKXZ1cX6zCNGMwmgm_ARO-1rzcR5_TUVqXL79TE8sg |
| 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=Heuristics+for+the+identical+machine+scheduling+problem+with+preventive+maintenances&rft.jtitle=Shanghai+jiao+tong+da+xue+xue+bao&rft.au=Jiang%2C+Caili&rft.au=Lu%2C+Zhiqiang&rft.au=Cui%2C+Weiwei&rft.date=2016-02-01&rft.issn=1007-1172&rft.volume=21&rft.issue=1&rft.spage=112&rft.epage=120&rft_id=info:doi/10.1007%2Fs12204-015-1690-z&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F85391X%2F85391X.jpg |