Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job...
Gespeichert in:
| Veröffentlicht in: | Naval research logistics Jg. 63; H. 2; S. 172 - 183 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Blackwell Publishing Ltd
01.03.2016
Wiley Subscription Services, Inc |
| Schlagworte: | |
| ISSN: | 0894-069X, 1520-6750 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 |
|---|---|
| AbstractList | We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo-polynomial dynamic programming algorithms and a fully polynomial-time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. Naval Research Logistics 63: 172-183, 2016 We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 |
| Author | Wang, Du-Juan Xu, Jianyou Wu, Chin-Chia Cheng, T. C. E. Yin, Yunqiang |
| Author_xml | – sequence: 1 givenname: Yunqiang surname: Yin fullname: Yin, Yunqiang email: yinyunqiang@126.com organization: Department of Mathematics, Kunming University of Science and Technology, 650093, Kunming, China – sequence: 2 givenname: Jianyou surname: Xu fullname: Xu, Jianyou organization: Department of Automation, College of Information Science and Engineering, Northeastern University, 110819, Shenyang, China – sequence: 3 givenname: T. C. E. surname: Cheng fullname: Cheng, T. C. E. organization: Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hung Hom, Hong Kong – sequence: 4 givenname: Chin-Chia surname: Wu fullname: Wu, Chin-Chia organization: Department of Statistics, Feng Chia University, Taichung, Taiwan – sequence: 5 givenname: Du-Juan surname: Wang fullname: Wang, Du-Juan organization: Institute of Information and Decision Technology, School of Management Science and Engineering, Dalian University of Technology, 116023, Dalian, China |
| BookMark | eNqFkcFu1DAQhiNUJLaFA29giQsc0tqOnTjHpdAWqSpCgrY3y3HGrNvEXmynu8ulr467WzhUIA4jS-PvG2nm3y_2nHdQFK8JPiQY0yOn7g4pqQV7VswIp7isG473ihkWLStx3V6_KPZjvMEY1wzzWXE_Xy6DX9tRJesdinoBI0RkfEDRuu8DlKPSC-tg-9VPQ26ilU0LpJCxa-jRqKxL4JTTgJRO9s6mDUoejdbZ0f4ElBa5fFIDUqOfXELeoEElQCsfbl8Wz40aIrx6fA-Kbycfvx6fleefTz8dz89LzSlnZaV6rgQ3BhswXaO7lhumSd2rilWib1hHu9b0NaGENxpXtFPa5DsowD3HLVQHxdvd3LztjwlikqONGoZBOfBTlERgQSjnNfs_2oimFRQTmtE3T9AbPwWXF3mgKsEEoyJTRztKBx9jACO1Tdt7p6DsIAmWD9nJnJ3cZpeNd0-MZcgRhc1f2cfpKzvA5t-gvJhf_jbKnWFjgvUfQ4VbWTdVw-XVxal8f3n1pWquT-SH6heqGLw- |
| CODEN | NRLOEP |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2021_10_064 crossref_primary_10_1142_S0217595916500391 crossref_primary_10_1002_nav_22252 crossref_primary_10_1016_j_eswa_2021_116180 crossref_primary_10_1007_s40305_023_00495_z crossref_primary_10_1016_j_cie_2022_107969 crossref_primary_10_1016_j_cor_2021_105329 crossref_primary_10_1016_j_ijpe_2017_01_014 crossref_primary_10_1111_itor_13623 crossref_primary_10_1016_j_jcde_2016_08_001 crossref_primary_10_1007_s40305_022_00403_x crossref_primary_10_1080_0305215X_2018_1519073 crossref_primary_10_1016_j_ejor_2024_11_010 crossref_primary_10_1016_j_omega_2016_07_006 crossref_primary_10_1016_j_cor_2025_107144 crossref_primary_10_1016_j_omega_2021_102453 crossref_primary_10_1016_j_asoc_2017_10_043 crossref_primary_10_1016_j_cie_2017_07_016 crossref_primary_10_1016_j_ejor_2021_07_055 crossref_primary_10_1109_ACCESS_2019_2898905 crossref_primary_10_1080_00207543_2019_1709672 crossref_primary_10_1016_j_cie_2022_108168 crossref_primary_10_1002_nav_22222 crossref_primary_10_1016_j_ejor_2019_12_003 crossref_primary_10_1007_s12351_016_0265_6 crossref_primary_10_1016_j_ejor_2022_02_017 crossref_primary_10_2112_SI83_133_1 crossref_primary_10_1007_s10951_018_0585_x crossref_primary_10_1093_comjnl_bxx007 crossref_primary_10_1007_s10957_017_1147_7 crossref_primary_10_1007_s10878_022_00890_x crossref_primary_10_1016_j_cie_2016_05_037 crossref_primary_10_1142_S0217595923500239 crossref_primary_10_1002_nav_22103 crossref_primary_10_1007_s10951_020_00646_7 crossref_primary_10_1016_j_resconrec_2016_12_001 crossref_primary_10_1007_s10479_022_04806_0 crossref_primary_10_1016_j_ejor_2020_12_061 crossref_primary_10_1016_j_jmsy_2019_01_006 crossref_primary_10_1088_1742_6596_953_1_012225 crossref_primary_10_1007_s10951_025_00846_z crossref_primary_10_1007_s40305_017_0159_1 crossref_primary_10_1016_j_cie_2016_11_009 crossref_primary_10_1016_j_ejor_2022_03_043 crossref_primary_10_1109_TASE_2020_2978890 |
| Cites_doi | 10.1016/j.omega.2008.01.001 10.1007/s10878-015-9924-4 10.1287/opre.40.3.586 10.1007/BF01178778 10.1287/moor.19.1.86 10.1016/j.cie.2008.09.042 10.1016/j.amc.2009.11.040 10.1016/S0167-5060(08)70356-X 10.1016/j.cor.2006.03.021 10.1002/nav.3800020109 10.1016/j.omega.2010.06.006 10.1287/ijoc.7.2.232 10.1016/j.cie.2009.04.014 10.1016/S0166-218X(03)00339-1 10.1007/BF00288977 10.1145/321921.321934 10.1057/palgrave.jors.2601998 10.1016/j.cie.2005.09.001 10.1002/nav.10107 10.1016/0167-6377(92)90001-J 10.1016/j.ins.2014.02.142 10.1007/s10951-009-0146-4 10.1201/9780203489802 10.1016/S0305-0548(02)00074-6 10.1007/s10878-013-9643-7 10.1145/321906.321909 10.1016/0020-0190(87)90145-1 10.1016/0166-218X(90)90093-R 10.1016/j.cie.2007.08.005 10.1023/A:1015487829051 10.1016/j.ejor.2003.08.026 10.1016/j.ejor.2006.06.062 10.1016/j.ejor.2004.04.011 10.1016/j.ejor.2006.10.005 10.1016/j.ejor.2016.01.045 |
| ContentType | Journal Article |
| Copyright | 2016 Wiley Periodicals, Inc. |
| Copyright_xml | – notice: 2016 Wiley Periodicals, Inc. |
| DBID | BSCLL AAYXX CITATION 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| DOI | 10.1002/nav.21684 |
| DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Oceanic Abstracts Technology Research Database ASFA: Aquatic Sciences and Fisheries Abstracts Engineering Research Database Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources ProQuest Computer Science Collection Civil Engineering Abstracts Aquatic Science & Fisheries Abstracts (ASFA) Professional Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Aquatic Science & Fisheries Abstracts (ASFA) Professional Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Computer and Information Systems Abstracts Professional Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources Oceanic Abstracts ASFA: Aquatic Sciences and Fisheries Abstracts Engineering Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitleList | Civil Engineering Abstracts Aquatic Science & Fisheries Abstracts (ASFA) Professional Civil Engineering Abstracts CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Military & Naval Science |
| EISSN | 1520-6750 |
| EndPage | 183 |
| ExternalDocumentID | 4033318381 10_1002_nav_21684 NAV21684 ark_67375_WNG_BVWQ37XF_D |
| Genre | article |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China under grant numbers 11561036 and 71301022; and in part by the Ministry of Science Technology (MOST) of Taiwan under grant numbers NSC 102‐2221‐E‐035‐070‐MY3 and MOST 103‐2410‐H‐035‐022‐MY2. Cheng was supported in part by The Hong Kong Polytechnic University under the Fung Yiu King‐Wing Hang Bank Endowed Professorship in Business Administration |
| GroupedDBID | --Z -~X .3N .GA .Y3 05W 0R~ 10A 123 186 1L6 1OB 1OC 1OL 1ZS 31~ 33P 3SF 3WU 4.4 4ZD 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5VS 66C 6TJ 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACGFS ACIWK ACNCT ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADXHL ADZMN AEFGJ AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ATUGU AUFTA AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BNHUX BROTX BRXPI BSCLL BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBA EBR EBS EBU EJD F00 F01 F04 FEDTE FSPIC G-S G.N GNP GODZA H.T H.X HBH HF~ HGLYW HHY HVGLF HZ~ H~9 IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M6L MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ NNB O66 O9- P2P P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QRW R.K RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WXSBR WYISQ XBAML XG1 XPP XV2 ZY4 ZZTAW ~IA ~WT AAHHS ABTAH ACCFJ AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE RWI UAO WRC WWM AAYXX CITATION O8X 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| ID | FETCH-LOGICAL-c5254-3ad5a85ff0fefb7cb95f4c16da3438d74b2b9fd612157c032bacf216ae0d509e3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 49 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000374972300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0894-069X |
| IngestDate | Fri Jul 11 08:31:23 EDT 2025 Wed Oct 01 14:28:40 EDT 2025 Sun Jul 13 04:26:57 EDT 2025 Sat Nov 29 02:12:58 EST 2025 Tue Nov 18 21:36:27 EST 2025 Wed Jan 22 16:22:19 EST 2025 Sun Sep 21 06:17:29 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c5254-3ad5a85ff0fefb7cb95f4c16da3438d74b2b9fd612157c032bacf216ae0d509e3 |
| Notes | ark:/67375/WNG-BVWQ37XF-D ArticleID:NAV21684 istex:1859C1A093162FF35AE4F2E54019500611A11DF5 National Natural Science Foundation of China under grant numbers 11561036 and 71301022; and in part by the Ministry of Science Technology (MOST) of Taiwan under grant numbers NSC 102-2221-E-035-070-MY3 and MOST 103-2410-H-035-022-MY2. Cheng was supported in part by The Hong Kong Polytechnic University under the Fung Yiu King-Wing Hang Bank Endowed Professorship in Business Administration ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| PQID | 1783848428 |
| PQPubID | 1016414 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1808125564 proquest_miscellaneous_1787982012 proquest_journals_1783848428 crossref_citationtrail_10_1002_nav_21684 crossref_primary_10_1002_nav_21684 wiley_primary_10_1002_nav_21684_NAV21684 istex_primary_ark_67375_WNG_BVWQ37XF_D |
| PublicationCentury | 2000 |
| PublicationDate | 2016-03 March 2016 2016-03-00 20160301 |
| PublicationDateYYYYMMDD | 2016-03-01 |
| PublicationDate_xml | – month: 03 year: 2016 text: 2016-03 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Naval research logistics |
| PublicationTitleAlternate | Naval Research Logistics |
| PublicationYear | 2016 |
| Publisher | Blackwell Publishing Ltd Wiley Subscription Services, Inc |
| Publisher_xml | – name: Blackwell Publishing Ltd – name: Wiley Subscription Services, Inc |
| References | C.N. Potts and L.N. Van Wassenhove, Single machine scheduling to minimize total late work, Oper Res 40 (1991), 586-595. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Comput Oper Res 35 (2008), 574-599. C.T. Ng and M.Y. Kovalyov, An FPTAS for scheduling two-machine flowshop with one unavailability interval, Naval Res Logist 51 (2004), 307-315. M. Sterna, Dominance relations for two-machine flow shop problem with late work criterion, B Pol Acad Sci-Tech 55 (2007), 59-69. Y. Yin, T.C.E. Cheng, and D.-J. Wang, Rescheduling on identical parallel machines with machine disruptions to minimize total completion time, Eur J Oper Res 252 (2016), 737-749. I. Kacem, H. Kellerer, and Y. Lanuel, Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals, J Comb Optim 30 (2015), 403-412. J. Breit, Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint, Eur J Oper Res 183 (2007), 516-524. Y. Ma, C. Chu, and C. Zuo, A survey of scheduling with deterministic machine availability constraints, Comput Ind Eng 58 (2010), 199-211. S. Sahni, Algorithms for scheduling independent tasks, J ACM 23 (1976), 116-127. C.Y. Lee and S.D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Inform 29 (1992), 375-382. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, A comparison of solution procedures for two-machine flow shop scheduling with late work criterion, Comput Ind Eng 49 (2005), 611-624. C. Sadfi, B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz, An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints, Eur J Oper Res 161 (2005), 3-10. I. Kacem and H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates, J Scheduling 14 (2011), 257-265. I. Kacem, Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval, Comput Ind Eng 54 (2008), 401-410. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, Openshop scheduling problems with late work criteria, Discrete App Math 134 (2004), 1-24. D.S. Hochbaum and R. Shamir, Minimizing the number of tardy job units under release time constraints, Discrete App Math 28 (1990), 45-57. Y. Zhang and L. Wang, The NP-completeness of a new batch scheduling problem, J Syst Sci Complex 25 (2005), 13-17. M. Sterna, A survey of scheduling problems with late work criteria, Omega 39 (2011), 120-129. O. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J ACM 22 (1975), 463-468. I. Kacem and C. Chu, Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period, Eur J Oper Res 187 (2008), 1080-1089. S.H. Lee and I.G. Lee, Heuristic algorithm for the single machine scheduling with periodic maintenance, J Korean Inst of Ind Eng 34 (2008), 318-27. C.N. Potts and L.N. Van Wassenhove, Approximation algorithms for scheduling a single machine to minimize total late work, Oper Res Lett 11 (1991), 261-266. J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, The two-machine flow-shop problem with weighted late work criterion and common due date, Eur J Oper Res 165 (2005), 408-415. H.W. Kuhn, The Hungarian method for the assignment problem, Naval Res Logist 2 (1975), 83-97. I. Kacem, H. Kellerer, and M. Seifaddini, Efficient approximation schemes for the maximum delivery time minimization on a single machine with a fixed operator or machine non-availability interval, J Comb Optim, 2016, doi: 10.1007/s10878-015-9924-4. M. Sterna, Late work scheduling in shop systems. Dissertations 405. Publishing House of Poznan University of Technology, Poznan, 2006. M. Sterna, Problems and algorithms in non-classical shop scheduling, Scientific Publishers of the Polish Academy of Sciences, Poznan, 2000. I. Kacem and A.R. Mahjoub, Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Comput Ind Eng 56 (2009), 1708-1712. C.J. Liao and W.J. Chen, Single-machine scheduling with periodic maintenance and nonresumable jobs, Comput Oper Res 30 (2003), 1335-1347. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann Discrete Math 5 (1979), 287-326. M.Y. Kovalyov and F. Werner, Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness, J Heuristics 8 (2002), 415-428. M.Y. Kovalyov, C.N. Potts, and L.N. Van Wassenhove, A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work, Math Oper Res 19 (1994), 86-93. C.J. Hsu, C. Low, and C.T. Su, A single-machine scheduling problem with maintenance activities to minimize makespan, App Math Comput 215 (2010), 3929-3935. I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, Single machine flow-time scheduling with a single breakdown, Acta Inform 26 (1989), 679-696. J. Blazewicz, Scheduling preemptible tasks on parallel processors with information loss, Technique et Science Informatiques 3 (1984), 415-420. A.M.A. Hariri, C.N. Potts, and L.N. Van Wassenhove, Single machine scheduling to minimize total late work, ORSA J Comput 7 (1995), 232-242. Z.L. Chen, Minimizing number of tardy jobs on a single machine subject to periodic maintenance, Omega 37 (2009), 591-599. Z.L. Chen, Minimizing total flow time in the single-machine scheduling problem with periodic maintenance, J Oper Res Soc 57 (2006), 410-415. Y. Yin, D. Ye, and G. Zhang, Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval, Inform Sci 274 (2014), 310-322. J. Blazewicz and G. Finke, Minimizing mean weighted execution time loss on identical and uniform processors, Inform Process Lett 24 (1987), 259-263. 2010; 58 1976; 23 2007; 183 2006; 57 1991; 11 2015; 30 2002; 8 2008; 34 2008; 35 2006 2008; 54 2005 2004 2011; 14 1989; 26 2011; 39 2005; 49 2008; 187 2007; 55 2003; 30 2014; 274 1999 1995; 7 2005; 25 1987; 24 2004; 134 2009; 56 2005; 161 2004; 51 2005; 165 1984; 3 1994; 19 2000 1990; 28 2010; 215 1991; 40 1979; 5 1992; 29 1975; 2 1975; 22 2016; 252 2009; 37 e_1_2_9_30_1 e_1_2_9_31_1 e_1_2_9_11_1 e_1_2_9_34_1 e_1_2_9_10_1 e_1_2_9_35_1 e_1_2_9_13_1 e_1_2_9_32_1 e_1_2_9_12_1 e_1_2_9_33_1 Lee S.H. (e_1_2_9_27_1) 2008; 34 Blazewicz J. (e_1_2_9_5_1) 1999 Leung J.Y.T. (e_1_2_9_29_1) 2004 e_1_2_9_15_1 e_1_2_9_14_1 e_1_2_9_17_1 e_1_2_9_36_1 e_1_2_9_16_1 e_1_2_9_37_1 e_1_2_9_19_1 e_1_2_9_18_1 Zhang Y. (e_1_2_9_44_1) 2005; 25 Sterna M. (e_1_2_9_40_1) 2007; 55 e_1_2_9_41_1 e_1_2_9_42_1 e_1_2_9_20_1 e_1_2_9_22_1 e_1_2_9_21_1 e_1_2_9_24_1 e_1_2_9_43_1 e_1_2_9_23_1 e_1_2_9_8_1 e_1_2_9_7_1 e_1_2_9_6_1 e_1_2_9_4_1 e_1_2_9_2_1 Sterna M. (e_1_2_9_39_1) 2006 Blazewicz J. (e_1_2_9_3_1) 1984; 3 e_1_2_9_9_1 e_1_2_9_26_1 e_1_2_9_25_1 e_1_2_9_28_1 Sterna M. (e_1_2_9_38_1) 2000 |
| References_xml | – reference: J. Blazewicz, Scheduling preemptible tasks on parallel processors with information loss, Technique et Science Informatiques 3 (1984), 415-420. – reference: J. Blazewicz and G. Finke, Minimizing mean weighted execution time loss on identical and uniform processors, Inform Process Lett 24 (1987), 259-263. – reference: I. Kacem and C. Chu, Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period, Eur J Oper Res 187 (2008), 1080-1089. – reference: Z.L. Chen, Minimizing total flow time in the single-machine scheduling problem with periodic maintenance, J Oper Res Soc 57 (2006), 410-415. – reference: C.T. Ng and M.Y. Kovalyov, An FPTAS for scheduling two-machine flowshop with one unavailability interval, Naval Res Logist 51 (2004), 307-315. – reference: M. Sterna, Dominance relations for two-machine flow shop problem with late work criterion, B Pol Acad Sci-Tech 55 (2007), 59-69. – reference: Z.L. Chen, Minimizing number of tardy jobs on a single machine subject to periodic maintenance, Omega 37 (2009), 591-599. – reference: I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, Single machine flow-time scheduling with a single breakdown, Acta Inform 26 (1989), 679-696. – reference: M. Sterna, Problems and algorithms in non-classical shop scheduling, Scientific Publishers of the Polish Academy of Sciences, Poznan, 2000. – reference: R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann Discrete Math 5 (1979), 287-326. – reference: C. Sadfi, B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz, An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints, Eur J Oper Res 161 (2005), 3-10. – reference: M. Sterna, Late work scheduling in shop systems. Dissertations 405. Publishing House of Poznan University of Technology, Poznan, 2006. – reference: Y. Zhang and L. Wang, The NP-completeness of a new batch scheduling problem, J Syst Sci Complex 25 (2005), 13-17. – reference: J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, A comparison of solution procedures for two-machine flow shop scheduling with late work criterion, Comput Ind Eng 49 (2005), 611-624. – reference: C.J. Liao and W.J. Chen, Single-machine scheduling with periodic maintenance and nonresumable jobs, Comput Oper Res 30 (2003), 1335-1347. – reference: J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, Openshop scheduling problems with late work criteria, Discrete App Math 134 (2004), 1-24. – reference: C.N. Potts and L.N. Van Wassenhove, Approximation algorithms for scheduling a single machine to minimize total late work, Oper Res Lett 11 (1991), 261-266. – reference: C.N. Potts and L.N. Van Wassenhove, Single machine scheduling to minimize total late work, Oper Res 40 (1991), 586-595. – reference: I. Kacem and H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates, J Scheduling 14 (2011), 257-265. – reference: M.Y. Kovalyov and F. Werner, Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness, J Heuristics 8 (2002), 415-428. – reference: S. Sahni, Algorithms for scheduling independent tasks, J ACM 23 (1976), 116-127. – reference: J. Breit, Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint, Eur J Oper Res 183 (2007), 516-524. – reference: D.S. Hochbaum and R. Shamir, Minimizing the number of tardy job units under release time constraints, Discrete App Math 28 (1990), 45-57. – reference: J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Comput Oper Res 35 (2008), 574-599. – reference: H.W. Kuhn, The Hungarian method for the assignment problem, Naval Res Logist 2 (1975), 83-97. – reference: Y. Ma, C. Chu, and C. Zuo, A survey of scheduling with deterministic machine availability constraints, Comput Ind Eng 58 (2010), 199-211. – reference: I. Kacem, Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval, Comput Ind Eng 54 (2008), 401-410. – reference: O. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J ACM 22 (1975), 463-468. – reference: I. Kacem, H. Kellerer, and Y. Lanuel, Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals, J Comb Optim 30 (2015), 403-412. – reference: Y. Yin, T.C.E. Cheng, and D.-J. Wang, Rescheduling on identical parallel machines with machine disruptions to minimize total completion time, Eur J Oper Res 252 (2016), 737-749. – reference: M. Sterna, A survey of scheduling problems with late work criteria, Omega 39 (2011), 120-129. – reference: I. Kacem, H. Kellerer, and M. Seifaddini, Efficient approximation schemes for the maximum delivery time minimization on a single machine with a fixed operator or machine non-availability interval, J Comb Optim, 2016, doi: 10.1007/s10878-015-9924-4. – reference: C.Y. Lee and S.D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Inform 29 (1992), 375-382. – reference: C.J. Hsu, C. Low, and C.T. Su, A single-machine scheduling problem with maintenance activities to minimize makespan, App Math Comput 215 (2010), 3929-3935. – reference: Y. Yin, D. Ye, and G. Zhang, Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval, Inform Sci 274 (2014), 310-322. – reference: S.H. Lee and I.G. Lee, Heuristic algorithm for the single machine scheduling with periodic maintenance, J Korean Inst of Ind Eng 34 (2008), 318-27. – reference: J. Blazewicz, E. Pesch, M. Sterna, and F. Werner, The two-machine flow-shop problem with weighted late work criterion and common due date, Eur J Oper Res 165 (2005), 408-415. – reference: A.M.A. Hariri, C.N. Potts, and L.N. Van Wassenhove, Single machine scheduling to minimize total late work, ORSA J Comput 7 (1995), 232-242. – reference: M.Y. Kovalyov, C.N. Potts, and L.N. Van Wassenhove, A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work, Math Oper Res 19 (1994), 86-93. – reference: I. Kacem and A.R. Mahjoub, Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Comput Ind Eng 56 (2009), 1708-1712. – start-page: 34 year: 2004 – article-title: Efficient approximation schemes for the maximum delivery time minimization on a single machine with a fixed operator or machine non‐availability interval publication-title: J Comb Optim – volume: 215 start-page: 3929 year: 2010 end-page: 3935 article-title: A single‐machine scheduling problem with maintenance activities to minimize makespan publication-title: App Math Comput – volume: 165 start-page: 408 year: 2005 end-page: 415 article-title: The two‐machine flow‐shop problem with weighted late work criterion and common due date publication-title: Eur J Oper Res – year: 2005 – volume: 57 start-page: 410 year: 2006 end-page: 415 article-title: Minimizing total flow time in the single‐machine scheduling problem with periodic maintenance publication-title: J Oper Res Soc – volume: 30 start-page: 1335 year: 2003 end-page: 1347 article-title: Single‐machine scheduling with periodic maintenance and nonresumable jobs publication-title: Comput Oper Res – volume: 29 start-page: 375 year: 1992 end-page: 382 article-title: Single machine flow‐time scheduling with scheduled maintenance publication-title: Acta Inform – volume: 39 start-page: 120 year: 2011 end-page: 129 article-title: A survey of scheduling problems with late work criteria publication-title: Omega – volume: 23 start-page: 116 year: 1976 end-page: 127 article-title: Algorithms for scheduling independent tasks publication-title: J ACM – year: 2000 – volume: 24 start-page: 259 year: 1987 end-page: 263 article-title: Minimizing mean weighted execution time loss on identical and uniform processors publication-title: Inform Process Lett – volume: 55 start-page: 59 year: 2007 end-page: 69 article-title: Dominance relations for two‐machine flow shop problem with late work criterion publication-title: B Pol Acad Sci‐Tech – volume: 274 start-page: 310 year: 2014 end-page: 322 article-title: Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval publication-title: Inform Sci – volume: 8 start-page: 415 year: 2002 end-page: 428 article-title: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness publication-title: J Heuristics – volume: 49 start-page: 611 year: 2005 end-page: 624 article-title: A comparison of solution procedures for two‐machine flow shop scheduling with late work criterion publication-title: Comput Ind Eng – volume: 35 start-page: 574 year: 2008 end-page: 599 article-title: Metaheuristic approaches for the two‐machine flow‐shop problem with weighted late work criterion and common due date publication-title: Comput Oper Res – volume: 3 start-page: 415 year: 1984 end-page: 420 article-title: Scheduling preemptible tasks on parallel processors with information loss publication-title: Technique et Science Informatiques – volume: 252 start-page: 737 year: 2016 end-page: 749 article-title: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time publication-title: Eur J Oper Res – volume: 34 start-page: 318 year: 2008 end-page: 27 article-title: Heuristic algorithm for the single machine scheduling with periodic maintenance publication-title: J Korean Inst of Ind Eng – volume: 25 start-page: 13 year: 2005 end-page: 17 article-title: The NP‐completeness of a new batch scheduling problem publication-title: J Syst Sci Complex – volume: 22 start-page: 463 year: 1975 end-page: 468 article-title: Fast approximation algorithms for the knapsack and sum of subset problems publication-title: J ACM – volume: 14 start-page: 257 year: 2011 end-page: 265 article-title: Fast approximation algorithms to minimize a special weighted flow‐time criterion on a single machine with a non‐availability interval and release dates publication-title: J Scheduling – volume: 19 start-page: 86 year: 1994 end-page: 93 article-title: A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work publication-title: Math Oper Res – volume: 7 start-page: 232 year: 1995 end-page: 242 article-title: Single machine scheduling to minimize total late work publication-title: ORSA J Comput – volume: 26 start-page: 679 year: 1989 end-page: 696 article-title: Single machine flow‐time scheduling with a single breakdown publication-title: Acta Inform – volume: 37 start-page: 591 year: 2009 end-page: 599 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega – volume: 56 start-page: 1708 year: 2009 end-page: 1712 article-title: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval publication-title: Comput Ind Eng – volume: 183 start-page: 516 year: 2007 end-page: 524 article-title: Improved approximation for non‐preemptive single machine flow‐time scheduling with an availability constraint publication-title: Eur J Oper Res – volume: 28 start-page: 45 year: 1990 end-page: 57 article-title: Minimizing the number of tardy job units under release time constraints publication-title: Discrete App Math – year: 2006 – volume: 5 start-page: 287 year: 1979 end-page: 326 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Ann Discrete Math – volume: 134 start-page: 1 year: 2004 end-page: 24 article-title: Openshop scheduling problems with late work criteria publication-title: Discrete App Math – start-page: 354 year: 1999 end-page: 359 – volume: 30 start-page: 403 year: 2015 end-page: 412 article-title: Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non‐availability intervals publication-title: J Comb Optim – volume: 11 start-page: 261 year: 1991 end-page: 266 article-title: Approximation algorithms for scheduling a single machine to minimize total late work publication-title: Oper Res Lett – volume: 51 start-page: 307 year: 2004 end-page: 315 article-title: An FPTAS for scheduling two‐machine flowshop with one unavailability interval publication-title: Naval Res Logist – volume: 161 start-page: 3 year: 2005 end-page: 10 article-title: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints publication-title: Eur J Oper Res – volume: 2 start-page: 83 year: 1975 end-page: 97 article-title: The Hungarian method for the assignment problem publication-title: Naval Res Logist – volume: 58 start-page: 199 year: 2010 end-page: 211 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Comput Ind Eng – volume: 54 start-page: 401 year: 2008 end-page: 410 article-title: Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non‐availability interval publication-title: Comput Ind Eng – volume: 187 start-page: 1080 year: 2008 end-page: 1089 article-title: Worst‐case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period publication-title: Eur J Oper Res – volume: 40 start-page: 586 year: 1991 end-page: 595 article-title: Single machine scheduling to minimize total late work publication-title: Oper Res – ident: e_1_2_9_12_1 doi: 10.1016/j.omega.2008.01.001 – ident: e_1_2_9_22_1 doi: 10.1007/s10878-015-9924-4 – ident: e_1_2_9_34_1 doi: 10.1287/opre.40.3.586 – ident: e_1_2_9_28_1 doi: 10.1007/BF01178778 – ident: e_1_2_9_31_1 – volume-title: Late work scheduling in shop systems year: 2006 ident: e_1_2_9_39_1 – ident: e_1_2_9_25_1 doi: 10.1287/moor.19.1.86 – ident: e_1_2_9_23_1 doi: 10.1016/j.cie.2008.09.042 – ident: e_1_2_9_16_1 doi: 10.1016/j.amc.2009.11.040 – ident: e_1_2_9_13_1 doi: 10.1016/S0167-5060(08)70356-X – ident: e_1_2_9_9_1 doi: 10.1016/j.cor.2006.03.021 – ident: e_1_2_9_26_1 doi: 10.1002/nav.3800020109 – ident: e_1_2_9_41_1 doi: 10.1016/j.omega.2010.06.006 – ident: e_1_2_9_14_1 doi: 10.1287/ijoc.7.2.232 – ident: e_1_2_9_32_1 doi: 10.1016/j.cie.2009.04.014 – volume: 55 start-page: 59 year: 2007 ident: e_1_2_9_40_1 article-title: Dominance relations for two‐machine flow shop problem with late work criterion publication-title: B Pol Acad Sci‐Tech – ident: e_1_2_9_6_1 doi: 10.1016/S0166-218X(03)00339-1 – ident: e_1_2_9_2_1 doi: 10.1007/BF00288977 – ident: e_1_2_9_37_1 doi: 10.1145/321921.321934 – ident: e_1_2_9_11_1 doi: 10.1057/palgrave.jors.2601998 – ident: e_1_2_9_8_1 doi: 10.1016/j.cie.2005.09.001 – ident: e_1_2_9_33_1 doi: 10.1002/nav.10107 – ident: e_1_2_9_35_1 doi: 10.1016/0167-6377(92)90001-J – ident: e_1_2_9_42_1 doi: 10.1016/j.ins.2014.02.142 – volume: 34 start-page: 318 year: 2008 ident: e_1_2_9_27_1 article-title: Heuristic algorithm for the single machine scheduling with periodic maintenance publication-title: J Korean Inst of Ind Eng – ident: e_1_2_9_20_1 doi: 10.1007/s10951-009-0146-4 – start-page: 34 volume-title: Handbook of scheduling: Algorithms, models, and performance analysis year: 2004 ident: e_1_2_9_29_1 doi: 10.1201/9780203489802 – volume-title: Problems and algorithms in non‐classical shop scheduling year: 2000 ident: e_1_2_9_38_1 – ident: e_1_2_9_30_1 doi: 10.1016/S0305-0548(02)00074-6 – ident: e_1_2_9_21_1 doi: 10.1007/s10878-013-9643-7 – ident: e_1_2_9_17_1 doi: 10.1145/321906.321909 – ident: e_1_2_9_4_1 doi: 10.1016/0020-0190(87)90145-1 – ident: e_1_2_9_15_1 doi: 10.1016/0166-218X(90)90093-R – ident: e_1_2_9_18_1 doi: 10.1016/j.cie.2007.08.005 – volume: 25 start-page: 13 year: 2005 ident: e_1_2_9_44_1 article-title: The NP‐completeness of a new batch scheduling problem publication-title: J Syst Sci Complex – ident: e_1_2_9_24_1 doi: 10.1023/A:1015487829051 – ident: e_1_2_9_36_1 doi: 10.1016/j.ejor.2003.08.026 – ident: e_1_2_9_19_1 doi: 10.1016/j.ejor.2006.06.062 – volume: 3 start-page: 415 year: 1984 ident: e_1_2_9_3_1 article-title: Scheduling preemptible tasks on parallel processors with information loss publication-title: Technique et Science Informatiques – ident: e_1_2_9_7_1 doi: 10.1016/j.ejor.2004.04.011 – ident: e_1_2_9_10_1 doi: 10.1016/j.ejor.2006.10.005 – ident: e_1_2_9_43_1 doi: 10.1016/j.ejor.2016.01.045 – start-page: 354 volume-title: Operations Research Proceedings year: 1999 ident: e_1_2_9_5_1 |
| SSID | ssj0006405 |
| Score | 2.317187 |
| Snippet | We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed... We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 172 |
| SubjectTerms | Algorithms Approximation fully polynomial-time approximation scheme late work Logistics Maintenance Mathematical analysis Naval Optimization Scheduling |
| Title | Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work |
| URI | https://api.istex.fr/ark:/67375/WNG-BVWQ37XF-D/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnav.21684 https://www.proquest.com/docview/1783848428 https://www.proquest.com/docview/1787982012 https://www.proquest.com/docview/1808125564 |
| Volume | 63 |
| WOSCitedRecordID | wos000374972300005&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: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1520-6750 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006405 issn: 0894-069X databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NbtNAEF6VhAMX_lFDCxoQqnoxtb1r71qcAiVwAAsQbXNb7S-KiJMqSavACd6AZ-RJ2LEdq5UAIXGztWNpNDuz--165htCnniRMEPjOPJWm4ghDaHOrIpUbq3ihXZx3jSb4GUpxuPi3RZ5tqmFafghugs3jIx6vcYAV3p5cIE0VJ0_TZNcsCuknwa_zXqkf_hhdPSmW4hz1mQwCmS_zYvxhlgoTg-6jy9tR3207PoS1ryIWOstZ3Tjv5S9Sa63SBOGjWvcIltudptsv61ZuRdfYA9KFbwM2uC-Q74PkV58PWlqGSGcel3llhBALeB9wtT9_PajqlMvXT1oMYf9E-BFLijwk7WzUCmkn0AODwdYMYGNKWA1ByQwqSZfHQS4Gd4D4AdVYZcKmHuYBrgLmB92lxyNXn588TpqGzREJgsHy4gqmymReR975zU3usg8M0luFWVUWM50qgtvkaQs4yamqVbGBzMoF9sAVBy9R3qz-cxtE6AmN1Z4HgQty2KmhaCKJYVPbWGN5QOyv5knaVr2cmyiMZUN73Iqg4llbeIBedyJnjaUHb8T2qsnu5NQi8-Y48YzeVK-ks-PT95TPh7JwwHZ3XiDbMN7KRMuqGAiHN0G5FE3HAIT_7aomZuf1TK8QHyV_kUG-54gCVzQZ7_2nz9rLMvhcf1w_99Fd8i1oEDe5Mztkt5qceYekKvmfDVZLh628fIL6OYc-Q |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZKFwkuvFG3FBgQqnoJzcOJHYnLQlmK2EaA-tib5fiBVt3sot1ttXCCf8Bv5JfgcbJRKwFC4pbIE2k0nrE_T8bfEPLM8oiqJAwDq0sVUKQhLFMtA5lpLVlemjCrm02wouDDYf5-jbxY3YWp-SHahBtGhl-vMcAxIb17gTVUnj-Po4zTK6RDnRs5_-7sfewfDdqVOKN1CSNH-tssH66YhcJ4t_340n7UQdMuL4HNi5DV7zn9m_-n7S1yo8Ga0Kud4zZZM5M7ZOPA83LPvsA2FNL5GTThfZd87yHB-HJU32YEd-41lZmDg7WAGYWx-fntR-WLL40f1FjF_gkwlQsS7GhpNFQSCSiQxcMA3pnA1hSwmAJSmFSjrwYc4HTvDvKDrLBPBUwtjB3gBawQu0eO-q8PX-0HTYuGQKXuaBkkUqeSp9aG1tiSqTJPLVVRpmVCE64ZLeMytxppylKmwiQupbLODNKE2kEVk9wn65PpxGwQSFSmNLfMCWqahrTkPJE0ym2sc60065Kd1UQJ1fCXYxuNsaiZl2PhTCy8ibvkaSv6uSbt-J3Qtp_tVkLOTrHKjaXipHgjXh6ffEjYsC_2umRr5Q6iCfC5iBhPOOXu8NYlT9phF5r4v0VOzPTMy7AcEVb8FxnsfII0cE6fHe9Af9ZYFL1j_7D576KPybX9w4OBGLwt3j0g150yWV1Bt0XWF7Mz85BcVeeL0Xz2qAmeX-DnIOk |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fb9MwED-NFiFe-I9WGGAQmvaSLYmd2JF4KZQCYkQDsa1vluM_qKJpp7abCk_wDfiMfBJ8SRptEiAk3hL5Ip3Od_bPzt3vAJ46ETFNwzBwptABQxrCIjEqUKkximeFDdO62QTPczEaZQcb8GxdC1PzQ7QXbhgZ1XqNAW5PjNs7xxqqznbjKBXsEnQZNpHpQHfwYXi4367EKatTGAXS36bZaM0sFMZ77ccX9qMumnZ1AWyeh6zVnjO8_n_a3oBrDdYk_do5bsKGnd6CzXcVL_f8C9kmufJ-Rprwvg3f-0gwvhrX1YzEn3ttaRfEw1qCNwoT-_Pbj7JKvrTVoMEs9k8Er3KJIm68soaUCgkokMXDEqyZwNYUZDkjSGFSjr9a4gGnf_eQn6gS-1SQmSMTD3gJZojdgcPhy48vXgdNi4ZAJ_5oGVBlEiUS50JnXcF1kSWO6Sg1ijIqDGdFXGTOIE1ZwnVI40Jp582gbGg8VLH0LnSms6ndBEJ1qo1w3AsaloSsEIIqFmUuNpnRhvdgZz1RUjf85dhGYyJr5uVYehPLysQ9eNKKntSkHb8T2q5mu5VQ88-Y5cYTeZy_ks-Pjt9TPhrKQQ-21u4gmwBfyIgLKpjwh7cePG6HfWji_xY1tbPTSoZniLDiv8hg5xOkgfP67FQO9GeNZd4_qh7u_bvoI7hyMBjK_Tf52_tw1euS1gl0W9BZzk_tA7isz5bjxfxhEzu_AD2yIGQ |
| 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=Approximation+schemes+for+single-machine+scheduling+with+a+fixed+maintenance+activity+to+minimize+the+total+amount+of+late+work&rft.jtitle=Naval+research+logistics&rft.au=Yin%2C+Yunqiang&rft.au=Xu%2C+Jianyou&rft.au=Cheng%2C+TCEEdwin&rft.au=Wu%2C+Chin-Chia&rft.date=2016-03-01&rft.issn=0894-069X&rft.eissn=1520-6750&rft.volume=63&rft.issue=2&rft.spage=172&rft.epage=183&rft_id=info:doi/10.1002%2Fnav.21684&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0894-069X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0894-069X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0894-069X&client=summon |