No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan. Conditions for a dominance rule are established. Then, a new simulated annealing algorithm utilizing block insertion and block exchange operators...
Saved in:
| Published in | Applied mathematics and computation Vol. 365; p. 124688 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
15.01.2020
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan. Conditions for a dominance rule are established. Then, a new simulated annealing algorithm utilizing block insertion and block exchange operators is proposed, which we call a block simulated annealing algorithm. The proposed block simulated annealing algorithm is combined with an iterated search algorithm where the block simulated annealing algorithm explores the search space for a smaller total tardiness while the iterated search algorithm satisfies the constraint on the makespan. The proposed combined algorithm is called PA. Moreover, six closely related and well performing algorithms in the literature are modified to the problem, and PA is compared with these six algorithms. Extensive computational experiments reveal that PA reduces the error of the best modified algorithm by more than 50% for the same CPU times. Furthermore, the results are statistically tested, and thus, PA is recommended. |
|---|---|
| AbstractList | The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan. Conditions for a dominance rule are established. Then, a new simulated annealing algorithm utilizing block insertion and block exchange operators is proposed, which we call a block simulated annealing algorithm. The proposed block simulated annealing algorithm is combined with an iterated search algorithm where the block simulated annealing algorithm explores the search space for a smaller total tardiness while the iterated search algorithm satisfies the constraint on the makespan. The proposed combined algorithm is called PA. Moreover, six closely related and well performing algorithms in the literature are modified to the problem, and PA is compared with these six algorithms. Extensive computational experiments reveal that PA reduces the error of the best modified algorithm by more than 50% for the same CPU times. Furthermore, the results are statistically tested, and thus, PA is recommended. |
| ArticleNumber | 124688 |
| Author | Aydilek, Harun Aydilek, Asiye Allahverdi, Ali |
| Author_xml | – sequence: 1 givenname: Ali surname: Allahverdi fullname: Allahverdi, Ali email: ali.allahverdi@ku.edu.kw organization: Department of Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait – sequence: 2 givenname: Harun surname: Aydilek fullname: Aydilek, Harun email: aydilek.h@gust.edu.kw organization: Department of Mathematics and Natural Sciences, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait – sequence: 3 givenname: Asiye surname: Aydilek fullname: Aydilek, Asiye email: aydilek.a@gust.edu.kw organization: Department of Economics and Finance, Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait |
| BookMark | eNp9kMtOwzAQRS1UJNrCB7DzDyTYSewkYoUqXhKCDawtZzKmLkkc2S4VfD0pZcWiq7nS3DPSnAWZDW5AQi45Sznj8mqT6h7SjPE65Vkhq-qEzHlV5omQRT0jc8ZqmeSM5WdkEcKGMVZKXsxJ_-ySnbaRms7twtqNNMAa221nh3c6etd02NOdjWsacNReR5xC3I402h4DjY72drC9_cYpR93RqH1rBwyBhm2zQYi_Hf2BYdTDOTk1ugt48TeX5O3u9nX1kDy93D-ubp4SyOoyJgAyK3neyALyXFQFiLI1IIUseYM8y7nOAQSAgYrVomiqVkjeZLUwtTHNtF0SfrgL3oXg0ajR2177L8WZ2vtSGzX5Untf6uBrYsp_DNioo3VD9Np2R8nrA4nTS58WvQpgcQBsrZ8EqNbZI_QPWnOJ7w |
| CitedBy_id | crossref_primary_10_1016_j_cie_2022_108487 crossref_primary_10_1016_j_cie_2023_108983 crossref_primary_10_1080_0305215X_2024_2367600 crossref_primary_10_1016_j_ejor_2025_02_009 crossref_primary_10_28979_jarnas_936151 crossref_primary_10_1080_0305215X_2024_2302909 crossref_primary_10_1007_s12046_020_01432_z crossref_primary_10_1155_2021_9951995 crossref_primary_10_1016_j_cie_2022_107976 crossref_primary_10_1080_0305215X_2020_1796999 crossref_primary_10_1016_j_cor_2021_105319 crossref_primary_10_1080_01605682_2022_2039569 crossref_primary_10_1111_itor_13108 crossref_primary_10_1016_j_ejor_2023_05_010 crossref_primary_10_1186_s10033_020_00462_2 crossref_primary_10_1051_ro_2023056 crossref_primary_10_1080_0305215X_2022_2144274 crossref_primary_10_1109_ACCESS_2020_3015737 |
| Cites_doi | 10.1007/s40314-018-0694-3 10.1287/opre.44.3.510 10.1287/opre.49.6.854.10014 10.1021/ie801127t 10.1016/j.ejor.2006.09.010 10.1007/s00170-011-3766-8 10.1016/j.ijpe.2013.01.025 10.4236/ica.2015.61005 10.1016/S0377-2217(02)00646-X 10.1016/j.cie.2017.10.004 10.1016/j.cie.2017.07.037 10.1007/s00170-010-3009-4 10.1080/00207540802070942 10.1080/00207543.2016.1187776 10.1016/j.ins.2013.06.025 10.1057/palgrave.jors.2601695 10.1016/j.cor.2008.10.008 10.1007/s00500-008-0350-8 10.1016/j.eswa.2017.09.028 10.1080/05695557908974469 10.1016/S0305-0548(98)00002-1 10.1080/00207543.2014.932935 10.1016/j.ejor.2016.05.036 10.1016/j.cor.2015.02.002 10.1016/j.omega.2015.12.002 10.1016/j.cor.2012.07.019 10.1016/j.ejor.2014.04.031 10.1016/j.eswa.2014.03.047 10.1109/TASE.2012.2192729 10.1016/j.ejor.2015.04.004 10.1016/j.ejor.2017.10.064 10.1016/j.ejor.2017.11.070 10.1016/j.cor.2003.08.007 10.1016/j.ijpe.2010.06.006 10.1111/j.1937-5956.2005.tb00019.x 10.1243/09544054JEM989 10.1007/s00170-013-4836-x 10.1016/j.cie.2012.12.023 10.1007/s00500-014-1453-z |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier Ltd |
| Copyright_xml | – notice: 2019 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.amc.2019.124688 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| ExternalDocumentID | 10_1016_j_amc_2019_124688 S0096300319306800 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 5VS AAQFI AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ABXDB ACRPL ACVFH ADCNI ADIYS ADMUD ADNMO AEIPS AEUPX AFFNX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN BNPGV CITATION FEDTE FGOYB G-2 HLZ HMJ HVGLF HZ~ R2- RIG SEW SSH TAE VH1 VOH WUQ |
| ID | FETCH-LOGICAL-c297t-cc62713b64c33584c57dfc65671be1231a3cc5ccfc80954b8d561b295f9ffb1a3 |
| IEDL.DBID | .~1 |
| ISSN | 0096-3003 |
| IngestDate | Tue Jul 01 01:36:13 EDT 2025 Thu Apr 24 22:59:49 EDT 2025 Fri Feb 23 02:25:31 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Makespan Scheduling No-wait flowshop Total tardiness Setup times |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-cc62713b64c33584c57dfc65671be1231a3cc5ccfc80954b8d561b295f9ffb1a3 |
| ParticipantIDs | crossref_primary_10_1016_j_amc_2019_124688 crossref_citationtrail_10_1016_j_amc_2019_124688 elsevier_sciencedirect_doi_10_1016_j_amc_2019_124688 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2020-01-15 |
| PublicationDateYYYYMMDD | 2020-01-15 |
| PublicationDate_xml | – month: 01 year: 2020 text: 2020-01-15 day: 15 |
| PublicationDecade | 2020 |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2020 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Arabameri, Salmasi (bib0013) 2013; 64 Lee, Kim (bib0028) 2017; 114 Rock (bib0035) 1984; 28 T'Kindt, Billaut (bib0041) 2002 Allahverdi, Aydilek (bib0010) 2014; 238 Jenabi, Naderi, Ghomi (bib0025) 2010 Allahverdi, Soroush (bib0012) 2008; 187 Framinan, Perez-Gonzalez (bib0019) 2018; 266 Li, Zhang (bib0029) 2012; 9 Aldowaisan, Allahverdi (bib0003) 2015; 6 Aldowaisan, Allahverdi (bib0001) 1998; 25 Hall, Posner (bib0021) 2001; 49 Allahverdi, Aydilek, Aydilek (bib0011) 2018; 219 Hecker, Stanke, Becker, Hitzmann (bib0023) 2014; 41 Yoshida, Hitomi (bib0045) 1979; 11 Ruiz-Torres, Paletta, M'Hallah (bib0038) 2017; 55 Brown, McGarvey, Ventura (bib0016) 2004; 55 Hall, Sriskandarajah (bib0022) 1996; 44 Aldowaisan, Allahverdi (bib0002) 2012; 37 Tseng, Lin (bib0043) 2010; 128 Jarboui, Eddaly, Siarry (bib0024) 2011; 54 Lin, Ying (bib0030) 2016; 64 Ding, Song, Zhang, Gupta, Wu (bib0017) 2015; 53 Kopanos, Miguel Lainez, Puigjaner (bib0026) 2009; 48 Pan, Wang, Qian (bib0033) 2009; 36 Aydilek, Allahverdi (bib0014) 2012; 219 Shao, Pi, Shao (bib0040) 2017; 111 Pan, Wang, Qian (bib0032) 2008; 222 Allahverdi (bib0005) 2016; 255 Allahverdi, Allahverdi (bib0007) 2018; 37 Ziaee (bib0047) 2013; 251 Allahverdi (bib0004) 2015; 246 Fernandez-Viagas, Framinan (bib0018) 2015; 60 Wang, Tang, Pan, Yan (bib0044) 2015; 19 Trovinger, Bohn (bib0042) 2005; 14 Zhao, Liu, Zhang, Ma, Zhang (bib0046) 2018; 91 Samarghandi, Elmekkawy (bib0039) 2012; 61 Allahverdi, Aydilek (bib0009) 2013; 68 Ruiz, Allahverdi (bib0037) 2009; 47 Guirchoun, Martineau, Billaut (bib0020) 2005; 32 Allahverdi, Allahverdi (bib0008) 2019 Qian, Wang, Huang, Wang (bib0034) 2009; 13 Lee (bib0027) 2013; 144 Allahverdi, Aldowaisan (bib0006) 2004; 152 Aydilek, Allahverdi (bib0015) 2013; 10 Liu, Song, Wu (bib0031) 2013; 40 Pan (10.1016/j.amc.2019.124688_bib0032) 2008; 222 Allahverdi (10.1016/j.amc.2019.124688_bib0012) 2008; 187 Aydilek (10.1016/j.amc.2019.124688_bib0014) 2012; 219 Jenabi (10.1016/j.amc.2019.124688_bib0025) 2010 Samarghandi (10.1016/j.amc.2019.124688_bib0039) 2012; 61 Ding (10.1016/j.amc.2019.124688_bib0017) 2015; 53 Rock (10.1016/j.amc.2019.124688_bib0035) 1984; 28 Allahverdi (10.1016/j.amc.2019.124688_bib0010) 2014; 238 Allahverdi (10.1016/j.amc.2019.124688_bib0004) 2015; 246 Tseng (10.1016/j.amc.2019.124688_bib0043) 2010; 128 Allahverdi (10.1016/j.amc.2019.124688_bib0007) 2018; 37 Kopanos (10.1016/j.amc.2019.124688_bib0026) 2009; 48 Shao (10.1016/j.amc.2019.124688_bib0040) 2017; 111 Aldowaisan (10.1016/j.amc.2019.124688_bib0003) 2015; 6 Allahverdi (10.1016/j.amc.2019.124688_bib0008) 2019 Aldowaisan (10.1016/j.amc.2019.124688_bib0001) 1998; 25 Lin (10.1016/j.amc.2019.124688_bib0030) 2016; 64 Allahverdi (10.1016/j.amc.2019.124688_bib0005) 2016; 255 Allahverdi (10.1016/j.amc.2019.124688_bib0006) 2004; 152 Arabameri (10.1016/j.amc.2019.124688_bib0013) 2013; 64 Brown (10.1016/j.amc.2019.124688_bib0016) 2004; 55 Liu (10.1016/j.amc.2019.124688_bib0031) 2013; 40 Ziaee (10.1016/j.amc.2019.124688_bib0047) 2013; 251 Aldowaisan (10.1016/j.amc.2019.124688_bib0002) 2012; 37 Qian (10.1016/j.amc.2019.124688_bib0034) 2009; 13 Wang (10.1016/j.amc.2019.124688_bib0044) 2015; 19 Ruiz-Torres (10.1016/j.amc.2019.124688_bib0038) 2017; 55 Guirchoun (10.1016/j.amc.2019.124688_bib0020) 2005; 32 Hall (10.1016/j.amc.2019.124688_bib0021) 2001; 49 Framinan (10.1016/j.amc.2019.124688_bib0019) 2018; 266 Ruiz (10.1016/j.amc.2019.124688_bib0037) 2009; 47 Lee (10.1016/j.amc.2019.124688_bib0027) 2013; 144 Lee (10.1016/j.amc.2019.124688_bib0028) 2017; 114 Trovinger (10.1016/j.amc.2019.124688_bib0042) 2005; 14 Pan (10.1016/j.amc.2019.124688_bib0033) 2009; 36 Allahverdi (10.1016/j.amc.2019.124688_bib0011) 2018; 219 Allahverdi (10.1016/j.amc.2019.124688_bib0009) 2013; 68 Fernandez-Viagas (10.1016/j.amc.2019.124688_bib0018) 2015; 60 Hecker (10.1016/j.amc.2019.124688_bib0023) 2014; 41 Aydilek (10.1016/j.amc.2019.124688_bib0015) 2013; 10 Hall (10.1016/j.amc.2019.124688_bib0022) 1996; 44 Yoshida (10.1016/j.amc.2019.124688_bib0045) 1979; 11 Jarboui (10.1016/j.amc.2019.124688_bib0024) 2011; 54 Li (10.1016/j.amc.2019.124688_bib0029) 2012; 9 Zhao (10.1016/j.amc.2019.124688_bib0046) 2018; 91 T'Kindt (10.1016/j.amc.2019.124688_bib0041) 2002 |
| References_xml | – volume: 91 start-page: 347 year: 2018 end-page: 363 ident: bib0046 article-title: A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem publication-title: Expert Syst. Appl. – volume: 49 start-page: 854 year: 2001 end-page: 865 ident: bib0021 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Oper. Res. – volume: 14 start-page: 205 year: 2005 end-page: 217 ident: bib0042 article-title: Setup time reduction for electronics assembly: combining simple (SMED) and IT-based methods publication-title: Product. Oper. Manag. – volume: 44 start-page: 510 year: 1996 end-page: 525 ident: bib0022 article-title: A survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. – volume: 9 start-page: 578 year: 2012 end-page: 595 ident: bib0029 article-title: Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem publication-title: IEEE Trans. Autom. Sci. Eng. – volume: 6 start-page: 38 year: 2015 end-page: 44 ident: bib0003 article-title: Total tardiness performance in m-machine no-wait flowshops with separate setup times publication-title: Intell. Control Autom. – volume: 41 start-page: 5882 year: 2014 end-page: 5891 ident: bib0023 article-title: Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery publication-title: Expert Syst. Appl. – volume: 222 start-page: 519 year: 2008 end-page: 539 ident: bib0032 article-title: A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems publication-title: J. Eng. Manuf. – volume: 219 start-page: 590 year: 2018 end-page: 601 ident: bib0011 article-title: No-wait flowshop scheduling problem with two criteria; total tardiness and makespan publication-title: Eur. J. Oper. Res. – volume: 64 start-page: 902 year: 2013 end-page: 916 ident: bib0013 article-title: Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem publication-title: Comput. Indust. Eng. – volume: 54 start-page: 1129 year: 2011 end-page: 1143 ident: bib0024 article-title: A hybrid genetic algorithm for solving no-wait flowshop scheduling problems publication-title: Int. J. Adv. Manufac. Technol. – volume: 114 start-page: 22 year: 2017 end-page: 30 ident: bib0028 article-title: Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine publication-title: Comput. Indust. Eng. – volume: 11 start-page: 261 year: 1979 end-page: 263 ident: bib0045 article-title: Optimal two-state production scheduling with setup times separated publication-title: AIIE Trans. – volume: 10 start-page: 29 year: 2013 end-page: 37 ident: bib0015 article-title: New heuristics for no-wait flowshops with performance measures of makespan and mean completion time publication-title: Int. J. Oper. Res. – volume: 37 start-page: 6774 year: 2018 end-page: 6794 ident: bib0007 article-title: Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness publication-title: Comput. Appl. Math. – start-page: 1048 year: 2010 end-page: 1056 ident: bib0025 article-title: A bi-objective case of no-wait flowshops publication-title: Proceedings 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications – year: 2002 ident: bib0041 article-title: Multicriteria Scheduling: Theory, Models and Algorithms – volume: 37 start-page: 149 year: 2012 end-page: 162 ident: bib0002 article-title: Minimizing total tardiness in no-wait flowshops publication-title: Found. Comput. Dec. Sci. – volume: 55 start-page: 614 year: 2004 end-page: 621 ident: bib0016 article-title: Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated publication-title: J. Oper. Res. Soc. – volume: 47 start-page: 5717 year: 2009 end-page: 5738 ident: bib0037 article-title: New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness publication-title: Int. J. Product. Res. – volume: 13 start-page: 847 year: 2009 end-page: 869 ident: bib0034 article-title: Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution publication-title: Soft Comput. – volume: 53 start-page: 1002 year: 2015 end-page: 1018 ident: bib0017 article-title: Accelerated methods for total tardiness minimization in no-wait flowshops publication-title: Int. J. Product. Res. – volume: 128 start-page: 144 year: 2010 end-page: 152 ident: bib0043 article-title: A hybrid genetic algorithm for no-wait flowshop scheduling problem publication-title: Int. J. Product. Econ. – volume: 246 start-page: 345 year: 2015 end-page: 378 ident: bib0004 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: Eur.J. Oper. Res. – volume: 152 start-page: 132 year: 2004 end-page: 147 ident: bib0006 article-title: No-wait flowshops with bicriteria of makespan and maximum lateness publication-title: Eur.J. Oper. Res. – volume: 60 start-page: 27 year: 2015 end-page: 36 ident: bib0018 article-title: NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness publication-title: Comput. Oper. Res. – volume: 251 start-page: 126 year: 2013 end-page: 135 ident: bib0047 article-title: General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach publication-title: Inf. Sci. – volume: 55 start-page: 462 year: 2017 end-page: 479 ident: bib0038 article-title: Makespan minimisation with sequence-dependent machine deterioration and maintenance events publication-title: Int. J. Product. Res. – volume: 255 start-page: 665 year: 2016 end-page: 686 ident: bib0005 article-title: A survey of scheduling problems with no-wait in process publication-title: Eur.J. Oper. Res. – volume: 61 start-page: 1101 year: 2012 end-page: 1114 ident: bib0039 article-title: A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion publication-title: Int. J. Adv. Manufac. Technol. – volume: 144 start-page: 128 year: 2013 end-page: 134 ident: bib0027 article-title: Minimizing total tardiness for the order scheduling problem publication-title: Int. J. Product. Econ. – year: 2019 ident: bib0008 article-title: Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times publication-title: J. Indust. Manag. Optim. – volume: 64 start-page: 115 year: 2016 end-page: 125 ident: bib0030 article-title: Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics publication-title: Omega – volume: 48 start-page: 6346 year: 2009 end-page: 6357 ident: bib0026 article-title: An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants publication-title: Indust. Eng. Chem. Res. – volume: 266 start-page: 840 year: 2018 end-page: 850 ident: bib0019 article-title: Order scheduling with tardiness objective: Improved approximate solutions publication-title: Eur. J. Oper. Res. – volume: 28 start-page: 1 year: 1984 end-page: 16 ident: bib0035 article-title: Some new results in no-wait flowshop scheduling publication-title: Z. Opns. Res. – volume: 32 start-page: 599 year: 2005 end-page: 611 ident: bib0020 article-title: Total completion time minimization in a computer system with a server and two parallel processors publication-title: Comput. Oper. Res. – volume: 187 start-page: 978 year: 2008 end-page: 984 ident: bib0012 article-title: The significance of reducing setup times/setup costs publication-title: Eur. J. Oper. Res. – volume: 111 start-page: 331 year: 2017 end-page: 351 ident: bib0040 article-title: Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness publication-title: Comput. Indust. Eng. – volume: 19 start-page: 2913 year: 2015 end-page: 2926 ident: bib0044 article-title: Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resources publication-title: Soft Comput. – volume: 36 start-page: 2498 year: 2009 end-page: 2511 ident: bib0033 article-title: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems publication-title: Comput. Oper. Res. – volume: 25 start-page: 757 year: 1998 end-page: 765 ident: bib0001 article-title: Total flowtime in no-wait flowshops with separated setup times publication-title: Comput. Oper. Res. – volume: 238 start-page: 724 year: 2014 end-page: 734 ident: bib0010 article-title: Total completion time with makespan constraint in no-wait flowshops with setup times publication-title: Eur. J. Oper. Res. – volume: 219 start-page: 351 year: 2012 end-page: 359 ident: bib0014 article-title: Heuristics for no-wait flowshops with makespan subject to mean completion time publication-title: Appl. Math. Comput. – volume: 68 start-page: 2237 year: 2013 end-page: 2251 ident: bib0009 article-title: Algorithms for no-wait flowshops with total completion time subject to makespan publication-title: J. Adv Manufac. Technol. – volume: 40 start-page: 521 year: 2013 end-page: 525 ident: bib0031 article-title: Some heuristics for no-wait flowshops with total tardiness criterion publication-title: Comput. Oper. Res. – volume: 37 start-page: 6774 year: 2018 ident: 10.1016/j.amc.2019.124688_bib0007 article-title: Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness publication-title: Comput. Appl. Math. doi: 10.1007/s40314-018-0694-3 – year: 2019 ident: 10.1016/j.amc.2019.124688_bib0008 article-title: Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times publication-title: J. Indust. Manag. Optim. – volume: 44 start-page: 510 year: 1996 ident: 10.1016/j.amc.2019.124688_bib0022 article-title: A survey of machine scheduling problems with blocking and no-wait in process publication-title: Oper. Res. doi: 10.1287/opre.44.3.510 – volume: 49 start-page: 854 year: 2001 ident: 10.1016/j.amc.2019.124688_bib0021 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Oper. Res. doi: 10.1287/opre.49.6.854.10014 – volume: 48 start-page: 6346 year: 2009 ident: 10.1016/j.amc.2019.124688_bib0026 article-title: An efficient mixed-integer linear programming scheduling framework for addressing sequence-dependent setup issues in batch plants publication-title: Indust. Eng. Chem. Res. doi: 10.1021/ie801127t – volume: 187 start-page: 978 year: 2008 ident: 10.1016/j.amc.2019.124688_bib0012 article-title: The significance of reducing setup times/setup costs publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.09.010 – volume: 219 start-page: 351 year: 2012 ident: 10.1016/j.amc.2019.124688_bib0014 article-title: Heuristics for no-wait flowshops with makespan subject to mean completion time publication-title: Appl. Math. Comput. – volume: 61 start-page: 1101 year: 2012 ident: 10.1016/j.amc.2019.124688_bib0039 article-title: A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion publication-title: Int. J. Adv. Manufac. Technol. doi: 10.1007/s00170-011-3766-8 – volume: 144 start-page: 128 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0027 article-title: Minimizing total tardiness for the order scheduling problem publication-title: Int. J. Product. Econ. doi: 10.1016/j.ijpe.2013.01.025 – volume: 6 start-page: 38 year: 2015 ident: 10.1016/j.amc.2019.124688_bib0003 article-title: Total tardiness performance in m-machine no-wait flowshops with separate setup times publication-title: Intell. Control Autom. doi: 10.4236/ica.2015.61005 – volume: 152 start-page: 132 year: 2004 ident: 10.1016/j.amc.2019.124688_bib0006 article-title: No-wait flowshops with bicriteria of makespan and maximum lateness publication-title: Eur.J. Oper. Res. doi: 10.1016/S0377-2217(02)00646-X – volume: 114 start-page: 22 year: 2017 ident: 10.1016/j.amc.2019.124688_bib0028 article-title: Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine publication-title: Comput. Indust. Eng. doi: 10.1016/j.cie.2017.10.004 – volume: 111 start-page: 331 year: 2017 ident: 10.1016/j.amc.2019.124688_bib0040 article-title: Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness publication-title: Comput. Indust. Eng. doi: 10.1016/j.cie.2017.07.037 – volume: 54 start-page: 1129 year: 2011 ident: 10.1016/j.amc.2019.124688_bib0024 article-title: A hybrid genetic algorithm for solving no-wait flowshop scheduling problems publication-title: Int. J. Adv. Manufac. Technol. doi: 10.1007/s00170-010-3009-4 – volume: 47 start-page: 5717 year: 2009 ident: 10.1016/j.amc.2019.124688_bib0037 article-title: New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness publication-title: Int. J. Product. Res. doi: 10.1080/00207540802070942 – volume: 55 start-page: 462 year: 2017 ident: 10.1016/j.amc.2019.124688_bib0038 article-title: Makespan minimisation with sequence-dependent machine deterioration and maintenance events publication-title: Int. J. Product. Res. doi: 10.1080/00207543.2016.1187776 – volume: 251 start-page: 126 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0047 article-title: General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach publication-title: Inf. Sci. doi: 10.1016/j.ins.2013.06.025 – volume: 55 start-page: 614 year: 2004 ident: 10.1016/j.amc.2019.124688_bib0016 article-title: Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601695 – volume: 36 start-page: 2498 year: 2009 ident: 10.1016/j.amc.2019.124688_bib0033 article-title: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.10.008 – volume: 13 start-page: 847 year: 2009 ident: 10.1016/j.amc.2019.124688_bib0034 article-title: Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution publication-title: Soft Comput. doi: 10.1007/s00500-008-0350-8 – volume: 91 start-page: 347 year: 2018 ident: 10.1016/j.amc.2019.124688_bib0046 article-title: A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2017.09.028 – volume: 11 start-page: 261 year: 1979 ident: 10.1016/j.amc.2019.124688_bib0045 article-title: Optimal two-state production scheduling with setup times separated publication-title: AIIE Trans. doi: 10.1080/05695557908974469 – volume: 25 start-page: 757 year: 1998 ident: 10.1016/j.amc.2019.124688_bib0001 article-title: Total flowtime in no-wait flowshops with separated setup times publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(98)00002-1 – volume: 53 start-page: 1002 year: 2015 ident: 10.1016/j.amc.2019.124688_bib0017 article-title: Accelerated methods for total tardiness minimization in no-wait flowshops publication-title: Int. J. Product. Res. doi: 10.1080/00207543.2014.932935 – volume: 255 start-page: 665 year: 2016 ident: 10.1016/j.amc.2019.124688_bib0005 article-title: A survey of scheduling problems with no-wait in process publication-title: Eur.J. Oper. Res. doi: 10.1016/j.ejor.2016.05.036 – volume: 60 start-page: 27 year: 2015 ident: 10.1016/j.amc.2019.124688_bib0018 article-title: NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.02.002 – year: 2002 ident: 10.1016/j.amc.2019.124688_bib0041 – volume: 64 start-page: 115 year: 2016 ident: 10.1016/j.amc.2019.124688_bib0030 article-title: Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics publication-title: Omega doi: 10.1016/j.omega.2015.12.002 – volume: 40 start-page: 521 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0031 article-title: Some heuristics for no-wait flowshops with total tardiness criterion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.07.019 – volume: 238 start-page: 724 year: 2014 ident: 10.1016/j.amc.2019.124688_bib0010 article-title: Total completion time with makespan constraint in no-wait flowshops with setup times publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.04.031 – volume: 41 start-page: 5882 year: 2014 ident: 10.1016/j.amc.2019.124688_bib0023 article-title: Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2014.03.047 – volume: 9 start-page: 578 year: 2012 ident: 10.1016/j.amc.2019.124688_bib0029 article-title: Adaptive hybrid algorithms for the sequence-dependent setup time permutation flow shop scheduling problem publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2012.2192729 – volume: 10 start-page: 29 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0015 article-title: New heuristics for no-wait flowshops with performance measures of makespan and mean completion time publication-title: Int. J. Oper. Res. – volume: 246 start-page: 345 year: 2015 ident: 10.1016/j.amc.2019.124688_bib0004 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: 266 start-page: 840 year: 2018 ident: 10.1016/j.amc.2019.124688_bib0019 article-title: Order scheduling with tardiness objective: Improved approximate solutions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.10.064 – volume: 219 start-page: 590 year: 2018 ident: 10.1016/j.amc.2019.124688_bib0011 article-title: No-wait flowshop scheduling problem with two criteria; total tardiness and makespan publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.11.070 – start-page: 1048 year: 2010 ident: 10.1016/j.amc.2019.124688_bib0025 article-title: A bi-objective case of no-wait flowshops – volume: 32 start-page: 599 year: 2005 ident: 10.1016/j.amc.2019.124688_bib0020 article-title: Total completion time minimization in a computer system with a server and two parallel processors publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2003.08.007 – volume: 128 start-page: 144 year: 2010 ident: 10.1016/j.amc.2019.124688_bib0043 article-title: A hybrid genetic algorithm for no-wait flowshop scheduling problem publication-title: Int. J. Product. Econ. doi: 10.1016/j.ijpe.2010.06.006 – volume: 14 start-page: 205 year: 2005 ident: 10.1016/j.amc.2019.124688_bib0042 article-title: Setup time reduction for electronics assembly: combining simple (SMED) and IT-based methods publication-title: Product. Oper. Manag. doi: 10.1111/j.1937-5956.2005.tb00019.x – volume: 37 start-page: 149 year: 2012 ident: 10.1016/j.amc.2019.124688_bib0002 article-title: Minimizing total tardiness in no-wait flowshops publication-title: Found. Comput. Dec. Sci. – volume: 222 start-page: 519 year: 2008 ident: 10.1016/j.amc.2019.124688_bib0032 article-title: A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems publication-title: J. Eng. Manuf. doi: 10.1243/09544054JEM989 – volume: 28 start-page: 1 year: 1984 ident: 10.1016/j.amc.2019.124688_bib0035 article-title: Some new results in no-wait flowshop scheduling publication-title: Z. Opns. Res. – volume: 68 start-page: 2237 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0009 article-title: Algorithms for no-wait flowshops with total completion time subject to makespan publication-title: J. Adv Manufac. Technol. doi: 10.1007/s00170-013-4836-x – volume: 64 start-page: 902 year: 2013 ident: 10.1016/j.amc.2019.124688_bib0013 article-title: Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem publication-title: Comput. Indust. Eng. doi: 10.1016/j.cie.2012.12.023 – volume: 19 start-page: 2913 year: 2015 ident: 10.1016/j.amc.2019.124688_bib0044 article-title: Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resources publication-title: Soft Comput. doi: 10.1007/s00500-014-1453-z |
| SSID | ssj0007614 |
| Score | 2.441297 |
| Snippet | The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan.... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 124688 |
| SubjectTerms | Makespan No-wait flowshop Scheduling Setup times Total tardiness |
| Title | No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan |
| URI | https://dx.doi.org/10.1016/j.amc.2019.124688 |
| Volume | 365 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KvehBfGJ9lD14ErbNc5M9lmKpSnuy0FvIbrJYbZNgUgoe_O3O5FEV1IOQw5LsQpgdZr7ZnfmGkGtfGyoytGSKKwhQtBsxnxuKgXcRttQu92ysRp5M-Xjm3M_deYsMm1oYTKusbX9l00trXb_p19LsZ4sF1vgK5IsCHbKxgQTG7Y7joZb33j_TPCBMr5iYBeZ4GXZzs1nmeIUrZDE0RQ-8XNV85Qff9MXfjA7Ifg0U6aD6l0PSipMjsjfZsqzmx2Q1TdkmXBRUL9NN_pRmFEJVcB1YYU7rTjEUD1ppHpcU3zEMinVGy4bytEgpEousFm8xjAGE0wLVBW0fzdcSD2jKOeFLDGYnOSGz0e3jcMzq9glMWcIrmFLcghBUckfZNuAM5XqRVoDfPFPG4LDM0FbKVUorH3CWI_0IsJS0hKuF1hK-npJ2kibxGaF2aEHowk0ET_Bw2E4RAVqyvMjyROR3iNEILlA1tzi2uFgGTRLZcwCyDlDWQSXrDrnZLskqYo2_JjvNbgTftCMAw__7svP_LbsguxZG1YbJTPeStIvXdXwF0KOQ3VK3umRncPcwnn4A1ZPYLA |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5Ke1AP4hPrcw-ehNi8kz2WYkltm1MLvYXsJovVNgkmpeCvdyaPoqAehByWZBfC7DDzze7MN4Tcu1IVkSq5ImwBAYq0IsW1VaGAd2EGl5btGFiNPPVtb24-L6xFiwyaWhhMq6xtf2XTS2tdv-nV0uxlyyXW-DLkiwIdMrCBBMTtHWSnstqk0x-NPX9nkCFSr8iYGaZ5qUZzuVmmeYVrJDLU2CM4uqr_yg_u6YvLGR6Rwxor0n71O8ekFScn5GC6I1rNT8naT5VtuCyoXKXb_CXNKESr4D2wyJzWzWIonrXSPC5ZvmMYFJuMlj3laZFS5BZZLz9iGAMOpwVqDJo_mm84ntGUc8K3GCxPckbmw6fZwFPqDgqK0JlTKELYOkSh3DaFYQDUEJYTSQEQztF4DD5LCw0hLCGkcAFqmdyNAE5xnVmSScnh6zlpJ2kSXxBqhDpEL7aG-AkeG3aURQCYdCfSHRa5XaI2ggtETS-OXS5WQZNH9hqArAOUdVDJuksedkuyilvjr8lmsxvBNwUJwPb_vuzyf8vuyJ43m06CycgfX5F9HYNsVVM065q0i_dNfANIpOC3taZ9AkyR2t0 |
| 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=No-wait+flowshop+scheduling+problem+with+separate+setup+times+to+minimize+total+tardiness+subject+to+makespan&rft.jtitle=Applied+mathematics+and+computation&rft.au=Allahverdi%2C+Ali&rft.au=Aydilek%2C+Harun&rft.au=Aydilek%2C+Asiye&rft.date=2020-01-15&rft.issn=0096-3003&rft.volume=365&rft.spage=124688&rft_id=info:doi/10.1016%2Fj.amc.2019.124688&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2019_124688 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |