The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects
This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a...
Uloženo v:
| Vydáno v: | Optimization letters Ročník 15; číslo 4; s. 1327 - 1343 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.06.2021
|
| Témata: | |
| ISSN: | 1862-4472, 1862-4480 |
| 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 | This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a bivariate general learning and forgetting model consisting of two independent variables which are the sum of normal processing times of previous jobs in the schedule and the setup time of the present job. We demonstrate some global properties of an optimal schedule and prove that the problem is ordinary NP-hard by means of a polynomial transformation from a known decision problem to the decision version of the considered problem. Furthermore, we propose an integer non-linear programming model and a dynamic programming model which can be executed in pseudo-polynomial time. |
|---|---|
| AbstractList | This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a bivariate general learning and forgetting model consisting of two independent variables which are the sum of normal processing times of previous jobs in the schedule and the setup time of the present job. We demonstrate some global properties of an optimal schedule and prove that the problem is ordinary NP-hard by means of a polynomial transformation from a known decision problem to the decision version of the considered problem. Furthermore, we propose an integer non-linear programming model and a dynamic programming model which can be executed in pseudo-polynomial time. |
| Author | Muştu, Settar Eren, Tamer |
| Author_xml | – sequence: 1 givenname: Settar orcidid: 0000-0002-7397-0599 surname: Muştu fullname: Muştu, Settar email: settarmustu@gmail.com organization: Department of Industrial Engineering, Ostim Technical University – sequence: 2 givenname: Tamer orcidid: 0000-0001-5282-3138 surname: Eren fullname: Eren, Tamer organization: Department of Industrial Engineering, Ostim Technical University |
| BookMark | eNp9kMtOAyEUhonRxLb6Aq54gVFgmAtL03hLmripa8IwhxmaGaYBJta3l1rjwkUXJ-fG9-fwL9GlmxwgdEfJPSWkegiUFoJkhKWgJaeZuEALWpcs47wml391xa7RMoQdISWlQizQYdsDDtZ1A-BR6d661Ooe2nlIQ7z3UzPAiD9t7HGAOO9xtCMEPLsWPFYOwyGCC3ZyeDI4JrEOHHg14AGUd0cN5VpsJt9BjMcWjAEdww26MmoIcPubV-jj-Wm7fs027y9v68dNppmgMatZwVleJagsWtNwYSqiSCN0o2rRNDXThtQ5pG3eGAq85ZoIJbggpcgLVuYrVJ90tZ9C8GCktlHFdHD0yg6SEnl0UJ4clMlB-eOgFAll_9C9t6PyX-eh_ASF9Nh14OVumr1LXzxHfQPzZogx |
| CitedBy_id | crossref_primary_10_1016_j_cie_2024_110845 crossref_primary_10_1007_s11590_022_01955_w crossref_primary_10_3390_asi8020040 crossref_primary_10_1007_s11590_023_02039_z crossref_primary_10_1016_j_ejor_2023_09_020 crossref_primary_10_1007_s10845_020_01697_5 crossref_primary_10_1016_j_ejor_2023_08_022 crossref_primary_10_3390_math11194135 crossref_primary_10_1002_qre_3309 crossref_primary_10_1080_01605682_2023_2241503 crossref_primary_10_1007_s10586_022_03743_8 crossref_primary_10_1016_j_ejor_2025_03_002 crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1016/S0305-0483(98)00042-5 10.1016/j.ejor.2012.12.007 10.1287/mnsc.35.3.340 10.1016/j.ejor.2006.01.030 10.1016/j.ins.2012.02.043 10.1016/j.amc.2012.03.028 10.1023/A:1018524708016 10.1109/TSMC.2016.2616158 10.1016/j.asoc.2018.06.051 10.1016/j.apm.2010.11.041 10.1016/S0169-8141(99)00021-9 10.1080/00207543.2017.1355576 10.1111/j.1467-9280.1991.tb00175.x 10.1016/j.apm.2014.05.036 10.1080/00207548308942410 10.1016/S0925-5273(03)00084-7 10.1016/j.ejor.2007.05.040 10.1016/0169-8141(92)90035-X 10.1016/S0167-5060(08)70356-X 10.1080/07408178908966244 10.1016/j.ijpe.2003.10.019 10.1002/hfm.4530030307 10.1016/S0377-2217(98)00246-X 10.1109/17.141275 10.1080/00207543.2017.1338780 10.1080/05695557808975223 10.1016/j.disopt.2015.11.002 10.1016/j.ejor.2005.03.020 10.1016/j.ejor.2015.04.004 10.1016/j.apm.2012.09.066 10.1080/00207540600774083 10.1016/j.ejor.2006.06.060 10.1016/j.ergon.2011.05.001 10.1080/00207547008929840 10.1080/095372897235064 10.1080/00207543.2014.904967 10.1016/S0307-904X(97)00055-3 10.1016/j.ins.2018.04.038 10.1080/07408179508936741 10.1016/j.ejor.2006.03.065 10.1080/00207549508930179 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| Copyright_xml | – notice: Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-020-01641-9 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 1343 |
| ExternalDocumentID | 10_1007_s11590_020_01641_9 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 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 AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA 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 AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC 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 AXYYD AYJHY B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LLZTM M4Y MA- N9A NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9M PF0 PT4 QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7Y Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c291t-8254237eff65dfb49f70a0b9cba89bb82cf083ef653bf1e4d4c09a94906935263 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 16 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000571684800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1862-4472 |
| IngestDate | Tue Nov 18 21:23:44 EST 2025 Sat Nov 29 02:44:12 EST 2025 Fri Feb 21 02:48:34 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Setup time Pseudo polynomial time algorithm Learning effect Forgetting effect Complexity |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-8254237eff65dfb49f70a0b9cba89bb82cf083ef653bf1e4d4c09a94906935263 |
| ORCID | 0000-0001-5282-3138 0000-0002-7397-0599 |
| PageCount | 17 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11590_020_01641_9 crossref_primary_10_1007_s11590_020_01641_9 springer_journals_10_1007_s11590_020_01641_9 |
| PublicationCentury | 2000 |
| PublicationDate | 20210600 2021-06-00 |
| PublicationDateYYYYMMDD | 2021-06-01 |
| PublicationDate_xml | – month: 6 year: 2021 text: 20210600 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2021 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Biskup (CR34) 1999; 115 Sule (CR22) 1983; 21 Allahverdi (CR26) 2015; 246 Steedman (CR9) 1970; 8 Yang, Yang (CR39) 2011; 35 Wixted, Ebbesen (CR20) 1991; 2 Globerson, Levin, Shtub (CR42) 1989; 21 Howick, Eden (CR8) 2007; 45 Wu, Lai, Lee (CR28) 2015; 39 Sule (CR19) 1978; 10 Muştu, Eren (CR1) 2018; 25 Badiru (CR7) 1995; 33 Muştu, Eren (CR27) 2018; 71 Allahverdi, Gupta, Aldowaisan (CR24) 1999; 27 Kuo, Yang (CR35) 2006; 174 Bailey, McIntyre (CR41) 1997; 29 Allahverdi, Ng, Cheng, Kovalyov (CR25) 2008; 187 Jiang, Chen, Wu (CR37) 2012; 218 Jaber, Sikström (CR15) 2004; 92 Pan, Wang, Xi, Chen, Han (CR18) 2014; 52 Anzanello, Fogliatto (CR3) 2011; 41 Hewitt, Sprague, Yearout, Lisnerski, Sparks (CR43) 1992; 10 Bailey (CR10) 1989; 35 Garey, Johnson (CR32) 1979 Dar-El, Ayas, Gilad (CR13) 1995; 27 Rudek (CR33) 2012; 199 Nembhard, Uzumeri (CR17) 2000; 25 Koulamas, Kyparisis (CR36) 2007; 178 Biel, Glock (CR11) 2018; 56 Biskup (CR2) 2008; 188 Jaber, Kher, Davis (CR40) 2003; 85 Chiu (CR12) 1997; 8 Jaber, Bonney (CR14) 1997; 21 Wu, Lee, Lai, Wang (CR31) 2016; 19 Lai, Lee (CR30) 2013; 37 Yang, Chand (CR21) 2008; 187 Azzouz, Ennigrou, Ben Said (CR4) 2018; 56 Shtub, Levin, Globerson (CR6) 1993; 3 Li, Yang, Ruiz, Chen, Sui (CR23) 2018; 453 Jiang, Chen, Kang (CR38) 2013; 227 Graham, Lawler, Lenstra, Kan (CR29) 1979; 5 Badiru (CR5) 1992; 39 Li, Jiang, Ruiz (CR16) 2018; 48 X Li (1641_CR16) 2018; 48 WH Yang (1641_CR21) 2008; 187 MR Garey (1641_CR32) 1979 MY Jaber (1641_CR40) 2003; 85 S Globerson (1641_CR42) 1989; 21 CH Wu (1641_CR28) 2015; 39 CD Bailey (1641_CR41) 1997; 29 MJ Anzanello (1641_CR3) 2011; 41 A Allahverdi (1641_CR24) 1999; 27 S Muştu (1641_CR27) 2018; 71 D Biskup (1641_CR34) 1999; 115 Z Jiang (1641_CR37) 2012; 218 A Shtub (1641_CR6) 1993; 3 E Pan (1641_CR18) 2014; 52 DR Sule (1641_CR22) 1983; 21 MY Jaber (1641_CR14) 1997; 21 Z Jiang (1641_CR38) 2013; 227 HN Chiu (1641_CR12) 1997; 8 D Hewitt (1641_CR43) 1992; 10 MY Jaber (1641_CR15) 2004; 92 JT Wixted (1641_CR20) 1991; 2 EM Dar-El (1641_CR13) 1995; 27 DR Sule (1641_CR19) 1978; 10 S Muştu (1641_CR1) 2018; 25 RL Graham (1641_CR29) 1979; 5 PJ Lai (1641_CR30) 2013; 37 C Koulamas (1641_CR36) 2007; 178 I Steedman (1641_CR9) 1970; 8 CH Wu (1641_CR31) 2016; 19 SJ Yang (1641_CR39) 2011; 35 A Allahverdi (1641_CR25) 2008; 187 A Allahverdi (1641_CR26) 2015; 246 K Biel (1641_CR11) 2018; 56 X Li (1641_CR23) 2018; 453 AB Badiru (1641_CR5) 1992; 39 WH Kuo (1641_CR35) 2006; 174 S Howick (1641_CR8) 2007; 45 DA Nembhard (1641_CR17) 2000; 25 CD Bailey (1641_CR10) 1989; 35 A Azzouz (1641_CR4) 2018; 56 D Biskup (1641_CR2) 2008; 188 AB Badiru (1641_CR7) 1995; 33 R Rudek (1641_CR33) 2012; 199 |
| References_xml | – volume: 27 start-page: 219 year: 1999 end-page: 239 ident: CR24 article-title: A review of scheduling research involving setup considerations publication-title: Omega doi: 10.1016/S0305-0483(98)00042-5 – year: 1979 ident: CR32 publication-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 227 start-page: 76 year: 2013 end-page: 80 ident: CR38 article-title: Single-machine scheduling problems with actual time-dependent and job-dependent learning effect publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.12.007 – volume: 35 start-page: 340 year: 1989 end-page: 352 ident: CR10 article-title: Forgetting and the learning curve: a laboratory study publication-title: Manag. Sci. doi: 10.1287/mnsc.35.3.340 – volume: 178 start-page: 402 year: 2007 end-page: 407 ident: CR36 article-title: Single-machine and two-machine flowshop scheduling with general learning functions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.01.030 – volume: 199 start-page: 216 year: 2012 end-page: 229 ident: CR33 article-title: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model publication-title: Inf. Sci. (N.Y.) doi: 10.1016/j.ins.2012.02.043 – volume: 218 start-page: 9438 year: 2012 end-page: 9441 ident: CR37 article-title: Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2012.03.028 – volume: 29 start-page: 487 year: 1997 end-page: 495 ident: CR41 article-title: The relation between fit and prediction for alternative forms of learning curves and relearning curves publication-title: IIE Trans. doi: 10.1023/A:1018524708016 – volume: 48 start-page: 743 year: 2018 end-page: 754 ident: CR16 article-title: Methods for scheduling problems considering experience, learning, and forgetting effects publication-title: IEEE Trans. Syst. Man Cybern. Syst. doi: 10.1109/TSMC.2016.2616158 – volume: 71 start-page: 291 year: 2018 end-page: 306 ident: CR27 article-title: The single machine scheduling problem with sequence-dependent setup times and a learning effect on processing times publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.06.051 – volume: 35 start-page: 2068 year: 2011 end-page: 2074 ident: CR39 article-title: Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2010.11.041 – volume: 25 start-page: 315 year: 2000 end-page: 326 ident: CR17 article-title: Experiential learning and forgetting for manual and cognitive tasks publication-title: Int. J. Ind. Ergon. doi: 10.1016/S0169-8141(99)00021-9 – volume: 56 start-page: 1642 year: 2018 end-page: 1661 ident: CR4 article-title: Scheduling problems under learning effects: classification and cartography publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1355576 – volume: 2 start-page: 409 year: 1991 end-page: 415 ident: CR20 article-title: On the form of forgetting publication-title: Psychol. Sci. doi: 10.1111/j.1467-9280.1991.tb00175.x – volume: 39 start-page: 415 year: 2015 end-page: 424 ident: CR28 article-title: A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2014.05.036 – volume: 21 start-page: 771 year: 1983 end-page: 786 ident: CR22 article-title: Effect of learning and forgetting on economic lot size scheduling problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207548308942410 – volume: 85 start-page: 33 year: 2003 end-page: 46 ident: CR40 article-title: Countering forgetting through training and deployment publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(03)00084-7 – volume: 188 start-page: 315 year: 2008 end-page: 329 ident: CR2 article-title: A state-of-the-art review on scheduling with learning effects publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.05.040 – volume: 10 start-page: 217 year: 1992 end-page: 224 ident: CR43 article-title: The effects of unequal relearning rates on estimating forgetting parameters associated with performance curves publication-title: Int. J. Ind. Ergon. doi: 10.1016/0169-8141(92)90035-X – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: CR29 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: 21 start-page: 376 year: 1989 end-page: 381 ident: CR42 article-title: The impact of breaks on forgetting when performing a repetitive task publication-title: IIE Trans. doi: 10.1080/07408178908966244 – volume: 92 start-page: 281 year: 2004 end-page: 294 ident: CR15 article-title: A numerical comparison of three potential learning and forgetting models publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2003.10.019 – volume: 3 start-page: 293 year: 1993 end-page: 305 ident: CR6 article-title: Learning and forgetting industrial skills: an experimental model publication-title: Int. J. Hum. Factors Manuf. doi: 10.1002/hfm.4530030307 – volume: 115 start-page: 173 year: 1999 end-page: 178 ident: CR34 article-title: Single-machine scheduling with learning considerations publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(98)00246-X – volume: 39 start-page: 176 year: 1992 end-page: 188 ident: CR5 article-title: Computational survey of univariate and multivariate learning curve models publication-title: IEEE Trans. Eng. Manag. doi: 10.1109/17.141275 – volume: 56 start-page: 3439 year: 2018 end-page: 3461 ident: CR11 article-title: Governing the dynamics of multi-stage production systems subject to learning and forgetting effects: a simulation study publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1338780 – volume: 10 start-page: 338 year: 1978 end-page: 343 ident: CR19 article-title: The effect of alternate periods of learning and forgetting on economic manufacturing quantity publication-title: AIIE Trans. doi: 10.1080/05695557808975223 – volume: 19 start-page: 1 year: 2016 end-page: 11 ident: CR31 article-title: Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects publication-title: Discrete Optim. doi: 10.1016/j.disopt.2015.11.002 – volume: 174 start-page: 1184 year: 2006 end-page: 1190 ident: CR35 article-title: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.020 – volume: 246 start-page: 345 year: 2015 end-page: 378 ident: CR26 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.04.004 – volume: 37 start-page: 4509 year: 2013 end-page: 4516 ident: CR30 article-title: Single-machine scheduling with learning and forgetting effects publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2012.09.066 – volume: 45 start-page: 2775 year: 2007 end-page: 2797 ident: CR8 article-title: Learning in disrupted projects: on the nature of corporate and personal learning publication-title: Int. J. Prod. Res. doi: 10.1080/00207540600774083 – volume: 187 start-page: 985 year: 2008 end-page: 1032 ident: CR25 article-title: A survey of scheduling problems with setup times or costs publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.06.060 – volume: 41 start-page: 573 year: 2011 end-page: 583 ident: CR3 article-title: Learning curve models and applications: Literature review and research directions publication-title: Int. J. Ind. Ergon. doi: 10.1016/j.ergon.2011.05.001 – volume: 8 start-page: 189 year: 1970 end-page: 206 ident: CR9 article-title: Some improvement curve theory publication-title: Int. J. Prod. Res. doi: 10.1080/00207547008929840 – volume: 8 start-page: 484 year: 1997 end-page: 493 ident: CR12 article-title: Discrete time-varying demand lot-sizing models with learning and forgetting effects publication-title: Prod. Plan. Control doi: 10.1080/095372897235064 – volume: 25 start-page: 156 year: 2018 end-page: 174 ident: CR1 article-title: Maximum completion time under a learning effect in the permutation flowshop scheduling problem publication-title: Int. J. Ind. Eng. Theory Appl. Pract. – volume: 52 start-page: 5690 year: 2014 end-page: 5704 ident: CR18 article-title: Single-machine group scheduling problem considering learning, forgetting effects and preventive maintenance publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.904967 – volume: 21 start-page: 523 year: 1997 end-page: 531 ident: CR14 article-title: A comparative study of learning curves with forgetting publication-title: Appl. Math. Model. doi: 10.1016/S0307-904X(97)00055-3 – volume: 453 start-page: 408 year: 2018 end-page: 425 ident: CR23 article-title: An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects publication-title: Inf. Sci. (N.Y.) doi: 10.1016/j.ins.2018.04.038 – volume: 27 start-page: 272 year: 1995 end-page: 281 ident: CR13 article-title: Predicting performance times for long cycle time tasks publication-title: IIE Trans. doi: 10.1080/07408179508936741 – volume: 187 start-page: 1033 year: 2008 end-page: 1044 ident: CR21 article-title: Learning and forgetting effects on a group scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.03.065 – volume: 33 start-page: 777 year: 1995 end-page: 794 ident: CR7 article-title: Multivariate analysis of the effect of learning and forgetting on product quality publication-title: Int. J. Prod. Res. doi: 10.1080/00207549508930179 – volume: 246 start-page: 345 year: 2015 ident: 1641_CR26 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.04.004 – volume: 3 start-page: 293 year: 1993 ident: 1641_CR6 publication-title: Int. J. Hum. Factors Manuf. doi: 10.1002/hfm.4530030307 – volume: 21 start-page: 523 year: 1997 ident: 1641_CR14 publication-title: Appl. Math. Model. doi: 10.1016/S0307-904X(97)00055-3 – volume: 27 start-page: 272 year: 1995 ident: 1641_CR13 publication-title: IIE Trans. doi: 10.1080/07408179508936741 – volume: 92 start-page: 281 year: 2004 ident: 1641_CR15 publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2003.10.019 – volume: 10 start-page: 338 year: 1978 ident: 1641_CR19 publication-title: AIIE Trans. doi: 10.1080/05695557808975223 – volume: 218 start-page: 9438 year: 2012 ident: 1641_CR37 publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2012.03.028 – volume: 37 start-page: 4509 year: 2013 ident: 1641_CR30 publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2012.09.066 – volume: 52 start-page: 5690 year: 2014 ident: 1641_CR18 publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.904967 – volume: 27 start-page: 219 year: 1999 ident: 1641_CR24 publication-title: Omega doi: 10.1016/S0305-0483(98)00042-5 – volume: 188 start-page: 315 year: 2008 ident: 1641_CR2 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.05.040 – volume: 5 start-page: 287 year: 1979 ident: 1641_CR29 publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 35 start-page: 2068 year: 2011 ident: 1641_CR39 publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2010.11.041 – volume: 8 start-page: 189 year: 1970 ident: 1641_CR9 publication-title: Int. J. Prod. Res. doi: 10.1080/00207547008929840 – volume: 8 start-page: 484 year: 1997 ident: 1641_CR12 publication-title: Prod. Plan. Control doi: 10.1080/095372897235064 – volume: 56 start-page: 1642 year: 2018 ident: 1641_CR4 publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1355576 – volume: 19 start-page: 1 year: 2016 ident: 1641_CR31 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2015.11.002 – volume: 29 start-page: 487 year: 1997 ident: 1641_CR41 publication-title: IIE Trans. doi: 10.1023/A:1018524708016 – volume: 33 start-page: 777 year: 1995 ident: 1641_CR7 publication-title: Int. J. Prod. Res. doi: 10.1080/00207549508930179 – volume: 21 start-page: 376 year: 1989 ident: 1641_CR42 publication-title: IIE Trans. doi: 10.1080/07408178908966244 – volume: 25 start-page: 156 year: 2018 ident: 1641_CR1 publication-title: Int. J. Ind. Eng. Theory Appl. Pract. – volume: 39 start-page: 415 year: 2015 ident: 1641_CR28 publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2014.05.036 – volume: 199 start-page: 216 year: 2012 ident: 1641_CR33 publication-title: Inf. Sci. (N.Y.) doi: 10.1016/j.ins.2012.02.043 – volume: 174 start-page: 1184 year: 2006 ident: 1641_CR35 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.020 – volume: 453 start-page: 408 year: 2018 ident: 1641_CR23 publication-title: Inf. Sci. (N.Y.) doi: 10.1016/j.ins.2018.04.038 – volume: 227 start-page: 76 year: 2013 ident: 1641_CR38 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.12.007 – volume: 41 start-page: 573 year: 2011 ident: 1641_CR3 publication-title: Int. J. Ind. Ergon. doi: 10.1016/j.ergon.2011.05.001 – volume: 178 start-page: 402 year: 2007 ident: 1641_CR36 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.01.030 – volume: 115 start-page: 173 year: 1999 ident: 1641_CR34 publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(98)00246-X – volume: 45 start-page: 2775 year: 2007 ident: 1641_CR8 publication-title: Int. J. Prod. Res. doi: 10.1080/00207540600774083 – volume: 85 start-page: 33 year: 2003 ident: 1641_CR40 publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(03)00084-7 – volume: 35 start-page: 340 year: 1989 ident: 1641_CR10 publication-title: Manag. Sci. doi: 10.1287/mnsc.35.3.340 – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: 1641_CR32 – volume: 39 start-page: 176 year: 1992 ident: 1641_CR5 publication-title: IEEE Trans. Eng. Manag. doi: 10.1109/17.141275 – volume: 2 start-page: 409 year: 1991 ident: 1641_CR20 publication-title: Psychol. Sci. doi: 10.1111/j.1467-9280.1991.tb00175.x – volume: 25 start-page: 315 year: 2000 ident: 1641_CR17 publication-title: Int. J. Ind. Ergon. doi: 10.1016/S0169-8141(99)00021-9 – volume: 187 start-page: 1033 year: 2008 ident: 1641_CR21 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.03.065 – volume: 10 start-page: 217 year: 1992 ident: 1641_CR43 publication-title: Int. J. Ind. Ergon. doi: 10.1016/0169-8141(92)90035-X – volume: 56 start-page: 3439 year: 2018 ident: 1641_CR11 publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2017.1338780 – volume: 48 start-page: 743 year: 2018 ident: 1641_CR16 publication-title: IEEE Trans. Syst. Man Cybern. Syst. doi: 10.1109/TSMC.2016.2616158 – volume: 187 start-page: 985 year: 2008 ident: 1641_CR25 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.06.060 – volume: 71 start-page: 291 year: 2018 ident: 1641_CR27 publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.06.051 – volume: 21 start-page: 771 year: 1983 ident: 1641_CR22 publication-title: Int. J. Prod. Res. doi: 10.1080/00207548308942410 |
| SSID | ssj0061199 |
| Score | 2.3108683 |
| Snippet | This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1327 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects |
| URI | https://link.springer.com/article/10.1007/s11590-020-01641-9 |
| Volume | 15 |
| WOSCitedRecordID | wos000571684800001&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: 1862-4480 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0061199 issn: 1862-4472 databaseCode: RSV dateStart: 20070101 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/eLvHCXMwnV3NS8MwFA86PejBb3F-8Q7etNAuWZscRRxeHOIXu5UkTYeg3Vg78c_3JU03BzLQY-mvoeQlecnLe78fIRdS4qooaBjwnAk8oGgTcJPFgbZiSLGIuOHSiU0k_T4fDMSDLworm2z35krSrdTzYjf0vGFgjzuWFioKxCpZQ3fH7XR8fHpt1t84qlUjI27rgVjS8aUyv7ex6I4W70Kdi-lt_-_ndsiW31LCdT0GdsmKKfbI5g-iQXy6n7GzlvvkC8cG2BjBu4EPl0yJj2i8zGalD8FrzIAN0UJpqukYnAI92HqzCcgCXOTchtlglAM2DMOavBq8BsUQQRnkLtpu06rBZ40ckJfe7fPNXeAVGNBWIqoCe3zs0ARBcTfLFRN5EspQCa0kF0rxjs5xC2fwLVV5ZFjGdCikYCKMhSXep4ekVYwKc0SAS80lzWhXIw6RUgtK4yhWjCvF4m6bRI0hUu3pya1Kxns6J1a2fZxiH6euj1PRJpezb8Y1OcdS9FVju9RP1HIJ_Phv8BOy0bHpLi5Ac0pa1WRqzsi6_qzeysm5G6HfL4jgUw |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fS8MwEA46BfXB3-L8eQ--aaFdsy55FHFM3IbolL2VJE2HMLuxbuKf7yVLNwcy0MfQayi5NJdcvvs-Qq6EwFWRh77HUsrxgKK0x3QSecqIIUU8YJoJKzZRa7dZt8ufXFFYXqDdiytJu1LPi90w8vqeOe4YWqjA46tkjWLEMkC-55e3Yv2NgqlqZMBMPRCtVVypzO99LIajxbtQG2LqO__7uF2y7baUcDudA3tkRWf7ZOsH0SC2WjN21vyAfOHcAJMj6Gv4sGBKbKLzEoNK74HTmAGTooVcjydDsAr0YOrNRiAysJlzk2aDQQrYMfSm5NXgNCh6aJRAarPtBlYNDjVySF7r9527hucUGNBXPBh75vhYCWtoFFWTVFKe1nzhS66kYFxKVlEpbuE0Pg1lGmiaUOVzwSn3I26I98MjUsoGmT4mwIRiIkzCqkI7tBSKh2EURJIyKWlULZOgcESsHD25Ucnox3NiZTPGMY5xbMc45mVyPXtnOCXnWGp9U_gudj9qvsT85G_ml2Sj0Wk14-ZD-_GUbFYM9MUma85IaTya6HOyrj7H7_nows7Wb7wb4zc |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46RfTBuziv58E3Lesl65JHUYeijoEX9laSNB3C7MbWiT_fnLTdBWQgPoZ-DSUnTXJOzvk-Qi6EMKsiD1yHJZQbB0Vph-k4dBSKIYXcY5oJKzbRaLVYp8PbM1X8Ntu9vJLMaxqQpSnNaoM4qU0L38wu7Dro-iBFlOfwZbJCUTQI_fWX93ItDr1cQdJjWBtEG35RNvN7H_Nb0_y9qN1umlv__9BtslkcNeE6nxs7ZEmnu2RjhoDQtJ4nrK2jPfJt5gxg7KCn4dMmWZqmMWqM2epdKLRnAEO3MNLZeABWmR6wDm0IIgUbUcfwG_QTMB1DNye1hkKbomtAMSQ2Co_p1lBkk-yTt-bd6829UygzGBtyL3PQrfSDhgGF9TiRlCcNV7iSKykYl5L5KjFHO22eBjLxNI2pcrnglLshR0L-4IBU0n6qDwkwoZgI4qCuDM4gheJBEHqhpExKGtarxCuNEqmCthzVM3rRlHAZxzgyYxzZMY54lVxO3hnkpB0L0VelHaPiBx4tgB_9DX5O1tq3zejpofV4TNZ9zIixMZwTUsmGY31KVtVX9jEantmJ-wNjs-wb |
| 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=The+single+machine+scheduling+problem+with+setup+times+under+an+extension+of+the+general+learning+and+forgetting+effects&rft.jtitle=Optimization+letters&rft.au=Mu%C5%9Ftu%2C+Settar&rft.au=Eren%2C+Tamer&rft.date=2021-06-01&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=15&rft.issue=4&rft.spage=1327&rft.epage=1343&rft_id=info:doi/10.1007%2Fs11590-020-01641-9&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11590_020_01641_9 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon |