Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks
•This paper is the first research to solve the distributed hybrid flowshop scheduling problem.•The proposed SIG algorithm provides a practical means of solving this problem.•This study contributes significantly to expand the research on distributed scheduling problems. The trend of globalization has...
Saved in:
| Published in: | Expert systems with applications Vol. 92; pp. 132 - 141 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.02.2018
Elsevier BV |
| Subjects: | |
| ISSN: | 0957-4174, 1873-6793 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •This paper is the first research to solve the distributed hybrid flowshop scheduling problem.•The proposed SIG algorithm provides a practical means of solving this problem.•This study contributes significantly to expand the research on distributed scheduling problems.
The trend of globalization has recently seen the study of distributed scheduling problems. This study attempts to solve the distributed hybrid flowshop scheduling problem with multiprocessor tasks, and is the first attempt to address this problem. To solve this strongly NP-hard problem, a mixed integer linear programming formulation and self-tuning iterated greedy (SIG) algorithm that incorporates an adaptive cocktail decoding mechanism are presented to minimize the makespan. Comprehensive computational results demonstrate that the proposed SIG algorithm is extremely efficient and effective. This paper successfully expands the research area of distributed scheduling problems. |
|---|---|
| AbstractList | The trend of globalization has recently seen the study of distributed scheduling problems. This study attempts to solve the distributed hybrid flowshop scheduling problem with multiprocessor tasks, and is the first attempt to address this problem. To solve this strongly NP-hard problem, a mixed integer linear programming formulation and self-tuning iterated greedy (SIG) algorithm that incorporates an adaptive cocktail decoding mechanism are presented to minimize the makespan. Comprehensive computational results demonstrate that the proposed SIG algorithm is extremely efficient and effective. This paper successfully expands the research area of distributed scheduling problems. •This paper is the first research to solve the distributed hybrid flowshop scheduling problem.•The proposed SIG algorithm provides a practical means of solving this problem.•This study contributes significantly to expand the research on distributed scheduling problems. The trend of globalization has recently seen the study of distributed scheduling problems. This study attempts to solve the distributed hybrid flowshop scheduling problem with multiprocessor tasks, and is the first attempt to address this problem. To solve this strongly NP-hard problem, a mixed integer linear programming formulation and self-tuning iterated greedy (SIG) algorithm that incorporates an adaptive cocktail decoding mechanism are presented to minimize the makespan. Comprehensive computational results demonstrate that the proposed SIG algorithm is extremely efficient and effective. This paper successfully expands the research area of distributed scheduling problems. |
| Author | Lin, Shih-Wei Ying, Kuo-Ching |
| Author_xml | – sequence: 1 givenname: Kuo-Ching surname: Ying fullname: Ying, Kuo-Ching email: kcying@ntut.edu.tw organization: Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan, ROC – sequence: 2 givenname: Shih-Wei surname: Lin fullname: Lin, Shih-Wei email: swlin@mail.cgu.edu.tw organization: Department of Information Management, Chang Gung University, Taoyuan, Taiwan, ROC |
| BookMark | eNp9kE9r3DAQxUVJoZs0X6AnQc92pJVtydBLCf0TSMilPQtZGsWzsa2tJHdJP31ltqcecpmB4f3eY94luVjCAoR84KzmjHc3hxrSydR7xmXN-pqJ_Ruy40qKqpO9uCA71reyarhs3pHLlA6sCBmTO-IecMEZ_-DyRGfzDOloFupDpHkE6jDliMOawdHxZYjoqJ_CKY3hSJMdwa3Txh1jGCaY6QnzSOd1ylguFlLabEx6Tu_JW2-mBNf_9hX5-fXLj9vv1f3jt7vbz_eVFYrnyoFjTorBu960UgkrfQvOtuCdGgYH3CvRyqFp2oZ7I0B6GMS-b0B1ZbpOXJGPZ9-S_2uFlPUhrHEpkZr3nWoYb5UoKnVW2RhSiuC1xWwyhiVHg5PmTG-d6oPeOtVbp5r1unRa0P1_6DHibOLL69CnMwTl9d8IUSeLsFhwGMFm7QK-hv8FjdyWQg |
| CitedBy_id | crossref_primary_10_1109_TASE_2021_3119353 crossref_primary_10_32604_cmc_2024_055244 crossref_primary_10_1016_j_jmsy_2024_07_011 crossref_primary_10_1016_j_eswa_2025_126603 crossref_primary_10_1016_j_ejor_2023_02_001 crossref_primary_10_1007_s40747_023_01288_w crossref_primary_10_1016_j_eswa_2021_115422 crossref_primary_10_1016_j_engappai_2024_109915 crossref_primary_10_1109_TETCI_2022_3174915 crossref_primary_10_1080_00207543_2025_2553820 crossref_primary_10_1016_j_eswa_2022_116921 crossref_primary_10_1016_j_jmsy_2023_09_017 crossref_primary_10_1016_j_jmsy_2021_09_012 crossref_primary_10_1109_TEVC_2021_3106168 crossref_primary_10_1080_00207543_2024_2427344 crossref_primary_10_1016_j_cie_2020_106288 crossref_primary_10_3390_math13152401 crossref_primary_10_1016_j_eswa_2024_125344 crossref_primary_10_1016_j_swevo_2022_101190 crossref_primary_10_1007_s12190_024_02364_1 crossref_primary_10_1080_0305215X_2024_2425724 crossref_primary_10_3390_sym15040786 crossref_primary_10_1109_ACCESS_2018_2873401 crossref_primary_10_1016_j_asoc_2023_110563 crossref_primary_10_1016_j_eswa_2023_119805 crossref_primary_10_1016_j_swevo_2023_101409 crossref_primary_10_1007_s10462_021_10081_5 crossref_primary_10_1016_j_knosys_2023_110252 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1007_s40747_021_00400_2 crossref_primary_10_1080_00207543_2020_1842938 crossref_primary_10_1016_j_cor_2024_106919 crossref_primary_10_2478_jaiscr_2024_0006 crossref_primary_10_1016_j_eswa_2022_117555 crossref_primary_10_1016_j_asoc_2024_111508 crossref_primary_10_1109_TETCI_2023_3271331 crossref_primary_10_1080_00207543_2024_2383781 crossref_primary_10_1016_j_cie_2024_110624 crossref_primary_10_1016_j_swevo_2025_101991 crossref_primary_10_1016_j_eswa_2020_113716 crossref_primary_10_1016_j_asoc_2020_106946 crossref_primary_10_1016_j_engappai_2020_103540 crossref_primary_10_1177_00202940241245241 crossref_primary_10_1007_s12293_025_00468_0 crossref_primary_10_1007_s42452_020_03895_5 crossref_primary_10_1007_s42979_023_02517_2 crossref_primary_10_1016_j_eswa_2023_121947 crossref_primary_10_1016_j_eswa_2023_122914 crossref_primary_10_1016_j_eswa_2023_121667 crossref_primary_10_1007_s10489_020_01809_x crossref_primary_10_1016_j_engappai_2025_110537 crossref_primary_10_3390_pr13010095 crossref_primary_10_1016_j_eswa_2025_126523 crossref_primary_10_1080_00207543_2021_1880656 crossref_primary_10_1016_j_eswa_2020_113721 crossref_primary_10_1016_j_eswa_2022_119151 crossref_primary_10_1007_s42979_022_01398_1 crossref_primary_10_1007_s00521_022_07714_3 crossref_primary_10_1007_s12293_022_00364_x crossref_primary_10_1007_s40092_018_0278_2 crossref_primary_10_1016_j_engappai_2025_112292 crossref_primary_10_1080_0305215X_2024_2328188 crossref_primary_10_1016_j_cor_2021_105482 crossref_primary_10_1016_j_knosys_2020_105536 crossref_primary_10_1038_s41598_022_19215_3 crossref_primary_10_1007_s40815_021_01050_9 crossref_primary_10_1016_j_jii_2024_100574 crossref_primary_10_1002_dac_5022 crossref_primary_10_1016_j_cie_2022_108200 crossref_primary_10_1007_s40747_024_01484_2 crossref_primary_10_1016_j_eswa_2021_115339 crossref_primary_10_1016_j_cie_2021_107337 crossref_primary_10_3233_JIFS_191175 crossref_primary_10_1016_j_asoc_2024_112650 crossref_primary_10_1016_j_eswa_2021_115453 crossref_primary_10_1016_j_cie_2020_106638 crossref_primary_10_1016_j_knosys_2020_105527 crossref_primary_10_1016_j_cie_2020_106998 crossref_primary_10_1016_j_rcim_2021_102277 crossref_primary_10_1007_s10479_022_04537_2 crossref_primary_10_1007_s11081_024_09911_6 crossref_primary_10_1016_j_micpro_2022_104685 crossref_primary_10_1080_00207543_2020_1837982 crossref_primary_10_1016_j_cor_2019_05_002 crossref_primary_10_1080_0305215X_2019_1674295 crossref_primary_10_3390_sym15040836 crossref_primary_10_1007_s12293_021_00329_6 crossref_primary_10_1080_0951192X_2025_2478005 crossref_primary_10_3390_pr11061846 crossref_primary_10_1080_00207543_2020_1797207 crossref_primary_10_1016_j_knosys_2019_104894 crossref_primary_10_1109_TII_2020_3043734 crossref_primary_10_3390_pr13030728 crossref_primary_10_1109_ACCESS_2020_3041369 crossref_primary_10_1016_j_jii_2023_100514 crossref_primary_10_1007_s12652_022_04392_w crossref_primary_10_1016_j_swevo_2025_101936 crossref_primary_10_1016_j_ejor_2022_08_009 crossref_primary_10_1016_j_swevo_2024_101771 crossref_primary_10_1016_j_engappai_2024_108491 crossref_primary_10_1016_j_eswa_2023_121570 crossref_primary_10_1016_j_swevo_2022_101058 crossref_primary_10_1080_0305215X_2024_2410844 crossref_primary_10_1109_ACCESS_2019_2917273 crossref_primary_10_1016_j_knosys_2023_110309 crossref_primary_10_1016_j_eswa_2025_126713 crossref_primary_10_1080_00207543_2020_1753897 crossref_primary_10_1016_j_asoc_2024_112230 crossref_primary_10_1016_j_eswa_2019_113147 crossref_primary_10_1080_00207543_2022_2031331 crossref_primary_10_1109_ACCESS_2020_2973575 crossref_primary_10_1016_j_eswa_2018_07_055 crossref_primary_10_1016_j_eswa_2020_114282 crossref_primary_10_1080_00207543_2023_2262616 crossref_primary_10_1080_00207543_2020_1780333 crossref_primary_10_1109_TETCI_2020_3022372 |
| Cites_doi | 10.1016/j.cor.2010.09.020 10.1016/j.ejor.2009.09.024 10.1080/00207543.2014.910627 10.1016/j.asoc.2015.11.034 10.1016/j.eswa.2014.06.023 10.1080/00207540701294627 10.1080/00207543.2012.737948 10.1016/j.eswa.2015.08.025 10.4028/www.scientific.net/AMM.284-287.3712 10.1504/EJIE.2012.045605 10.1016/0305-0483(83)90088-9 10.1057/jors.1988.63 10.1007/s11740-017-0716-9 10.1016/j.eswa.2015.03.012 10.1504/EJIE.2013.058392 10.1016/j.eswa.2017.01.006 10.1080/00207543.2014.948578 10.1016/j.eswa.2008.08.033 10.1016/j.ijpe.2012.05.015 10.1080/18756891.2011.9727808 10.1016/j.omega.2013.10.002 10.1080/00207540500536939 10.1016/j.ejor.2014.05.024 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M 10.1016/j.asoc.2010.03.008 10.1057/palgrave.jors.2602625 10.1016/j.asoc.2010.12.006 10.1016/j.cor.2009.11.001 10.1007/s10951-005-1640-y 10.1080/00207540701871085 10.1016/j.ejor.2014.01.035 10.1080/00207543.2011.644819 10.1016/j.omega.2010.07.007 10.1057/palgrave.jors.2601716 10.1016/j.eswa.2005.04.009 10.1016/j.cor.2012.12.014 10.1016/j.ijpe.2016.10.001 10.1016/j.eswa.2011.01.173 10.1007/s10845-015-1084-y 10.1016/j.compeleceng.2005.09.004 10.1080/0305215X.2013.827673 10.1016/S0377-2217(02)00644-6 10.1080/00207543.2013.790571 10.1016/j.cor.2009.06.019 10.1504/IJAIP.2016.080191 10.1016/j.cie.2013.08.004 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier Ltd Copyright Elsevier BV Feb 2018 |
| Copyright_xml | – notice: 2017 Elsevier Ltd – notice: Copyright Elsevier BV Feb 2018 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.eswa.2017.09.032 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| EndPage | 141 |
| ExternalDocumentID | 10_1016_j_eswa_2017_09_032 S0957417417306371 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABBOA ABFNM ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACDAQ ACGFS ACHRH ACNNM ACNTT ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABUFD ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c381t-ded0d73bfd9a5783c7f5edc5efd8bbde1f8357b44541fa3e7feb3294e86294d63 |
| ISICitedReferencesCount | 128 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000414107100011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Mon Jul 14 09:36:31 EDT 2025 Sat Nov 29 04:44:48 EST 2025 Tue Nov 18 21:40:59 EST 2025 Fri Feb 23 02:24:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Adaptive cocktail decoding mechanism Self-tuning iterated greedy algorithm Scheduling Distributed hybrid flowshop |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c381t-ded0d73bfd9a5783c7f5edc5efd8bbde1f8357b44541fa3e7feb3294e86294d63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1968401583 |
| PQPubID | 2045477 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_1968401583 crossref_citationtrail_10_1016_j_eswa_2017_09_032 crossref_primary_10_1016_j_eswa_2017_09_032 elsevier_sciencedirect_doi_10_1016_j_eswa_2017_09_032 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-02-01 |
| PublicationDateYYYYMMDD | 2018-02-01 |
| PublicationDate_xml | – month: 02 year: 2018 text: 2018-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2018 |
| Publisher | Elsevier Ltd Elsevier BV |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier BV |
| References | Chan, Chung, Chan (bib0002) 2005; 29 Ying, Lin, Huang (bib0054) 2009; 36 Chang, Liu (bib0004) 2015 Nawaz, Enscore, Ham (bib0033) 1983; 11 Gao, Chen, Deng (bib0013) 2013; 51 Choong, Phon-Amnuaisuk, Alias (bib0005) 2011; 38 Lei, Guo (bib0024) 2015; 42 Lin, Ying (bib0025) 2014; 237 Naderi, Ruiz (bib0031) 2014; 239 Ying, Lin (bib0052) 2006; 44 Engin, Ceran, Yilmaz (bib0008) 2011; 11 Lahimer, Lopez, Haouari (bib0023) 2013; 66 Ying, Lin, Wan (bib0055) 2014; 52 Naderi, Azab (bib0030) 2014; 41 Lin, Ying, Huang (bib0027) 2013; 40 Ruiz, Vázquez-Rodríguez (bib0044) 2010; 205 Tseng, Liao (bib0047) 2008; 46 Pan, Ruiz (bib0036) 2014; 44 Ribas, Leisten, Framiñan (bib0042) 2010; 37 Chan, Prakash, Ma, Wong (bib0003) 2013; 51 Gao, Chen (bib0011) 2011; 4 Montgomery (bib0029) 2007 Ying (bib0051) 2012; 6 Hidri (bib0015) 2016; 182 Ying, Lin (bib0053) 2009; 47 Hidri, Gharbi (bib0016) 2017; 5 Rani, Zoraida (bib0038) 2016; 8 Chou (bib0006) 2013; 141 Kahraman, Engin, Kaya, Öztürk (bib0020) 2010; 10 Ribas, Companys, Tort-Martorell (bib0041) 2017; 74 Komaki, Malakooti (bib0022) 2017; 11 Xu, Wang, Wang, Liu (bib0049) 2014; 46 Oguz, Ercan (bib0034) 2005; 8 Gao, Chen (bib0012) 2011; 6 Ribas, Companys, Tort-Martorell (bib0039) 2011; 39 Akkoyunlu, Engin, Büyuközkan (bib0001) 2015 Komaki, Mobin, Teymourian, Sheikh (bib0021) 2015; 9 Oğuz, Zinder, Ha, Janiak, Lichtenstein (bib0035) 2004; 152 Ribas, Companys, Tort-Martorell (bib0040) 2013; 7 Jacobs, Brusco (bib0018) 1995; 42 Rifai, Nguyen, Dawal (bib0043) 2016; 40 Naderi, Ruiz (bib0032) 2010; 37 Lin, Ying, Huang (bib0028) 2013; 51 Pinedo (bib0037) 2012 Lin, Lee, Ying, Lu (bib0026) 2011; 38 Gupta (bib0014) 1988; 39 Sivrikaya, Tiryaki (bib0046) 2002 Ercan, Oguz (bib0009) 2005; 31 Fernandez-Viagas, Framinan (bib0010) 2015; 53 Ying (bib0050) 2009; 60 Jun, Park (bib0019) 2015; 42 Huang, Yu, Yang (bib0017) 2013; 284–287 Wang, Wang, Shen (bib0048) 2016 Du, Ji, Li, Liu (bib0007) 2016 Serifoğlu, Ulusoy (bib0045) 2004; 55 Engin (10.1016/j.eswa.2017.09.032_bib0008) 2011; 11 Ribas (10.1016/j.eswa.2017.09.032_bib0040) 2013; 7 Serifoğlu (10.1016/j.eswa.2017.09.032_bib0045) 2004; 55 Ribas (10.1016/j.eswa.2017.09.032_bib0041) 2017; 74 Huang (10.1016/j.eswa.2017.09.032_bib0017) 2013; 284–287 Gao (10.1016/j.eswa.2017.09.032_bib0012) 2011; 6 Rifai (10.1016/j.eswa.2017.09.032_bib0043) 2016; 40 Kahraman (10.1016/j.eswa.2017.09.032_bib0020) 2010; 10 Oguz (10.1016/j.eswa.2017.09.032_bib0034) 2005; 8 Fernandez-Viagas (10.1016/j.eswa.2017.09.032_bib0010) 2015; 53 Komaki (10.1016/j.eswa.2017.09.032_bib0021) 2015; 9 Ying (10.1016/j.eswa.2017.09.032_bib0051) 2012; 6 Gao (10.1016/j.eswa.2017.09.032_bib0013) 2013; 51 Xu (10.1016/j.eswa.2017.09.032_bib0049) 2014; 46 Chang (10.1016/j.eswa.2017.09.032_bib0004) 2015 Tseng (10.1016/j.eswa.2017.09.032_bib0047) 2008; 46 Jacobs (10.1016/j.eswa.2017.09.032_bib0018) 1995; 42 Komaki (10.1016/j.eswa.2017.09.032_bib0022) 2017; 11 Hidri (10.1016/j.eswa.2017.09.032_bib0016) 2017; 5 Pinedo (10.1016/j.eswa.2017.09.032_bib0037) 2012 Akkoyunlu (10.1016/j.eswa.2017.09.032_bib0001) 2015 Ying (10.1016/j.eswa.2017.09.032_bib0055) 2014; 52 Ying (10.1016/j.eswa.2017.09.032_bib0053) 2009; 47 Lei (10.1016/j.eswa.2017.09.032_bib0024) 2015; 42 Ruiz (10.1016/j.eswa.2017.09.032_bib0044) 2010; 205 Chan (10.1016/j.eswa.2017.09.032_bib0003) 2013; 51 Ercan (10.1016/j.eswa.2017.09.032_bib0009) 2005; 31 Montgomery (10.1016/j.eswa.2017.09.032_bib0029) 2007 Lahimer (10.1016/j.eswa.2017.09.032_bib0023) 2013; 66 Pan (10.1016/j.eswa.2017.09.032_bib0036) 2014; 44 Wang (10.1016/j.eswa.2017.09.032_bib0048) 2016 Rani (10.1016/j.eswa.2017.09.032_bib0038) 2016; 8 Ying (10.1016/j.eswa.2017.09.032_bib0054) 2009; 36 Du (10.1016/j.eswa.2017.09.032_bib0007) 2016 Chou (10.1016/j.eswa.2017.09.032_bib0006) 2013; 141 Ribas (10.1016/j.eswa.2017.09.032_bib0042) 2010; 37 Lin (10.1016/j.eswa.2017.09.032_bib0027) 2013; 40 Lin (10.1016/j.eswa.2017.09.032_bib0028) 2013; 51 Sivrikaya (10.1016/j.eswa.2017.09.032_bib0046) 2002 Jun (10.1016/j.eswa.2017.09.032_bib0019) 2015; 42 Nawaz (10.1016/j.eswa.2017.09.032_bib0033) 1983; 11 Ying (10.1016/j.eswa.2017.09.032_bib0052) 2006; 44 Naderi (10.1016/j.eswa.2017.09.032_bib0031) 2014; 239 Hidri (10.1016/j.eswa.2017.09.032_bib0015) 2016; 182 Gao (10.1016/j.eswa.2017.09.032_bib0011) 2011; 4 Gupta (10.1016/j.eswa.2017.09.032_bib0014) 1988; 39 Lin (10.1016/j.eswa.2017.09.032_bib0026) 2011; 38 Choong (10.1016/j.eswa.2017.09.032_bib0005) 2011; 38 Naderi (10.1016/j.eswa.2017.09.032_bib0032) 2010; 37 Lin (10.1016/j.eswa.2017.09.032_bib0025) 2014; 237 Oğuz (10.1016/j.eswa.2017.09.032_bib0035) 2004; 152 Ribas (10.1016/j.eswa.2017.09.032_bib0039) 2011; 39 Ying (10.1016/j.eswa.2017.09.032_bib0050) 2009; 60 Naderi (10.1016/j.eswa.2017.09.032_bib0030) 2014; 41 Chan (10.1016/j.eswa.2017.09.032_bib0002) 2005; 29 |
| References_xml | – volume: 8 start-page: 377 year: 2016 end-page: 391 ident: bib0038 article-title: Multistage multiprocessor task scheduling in hybrid flow shop problems using discrete firefly algorithm publication-title: International Journal of Advanced Intelligence Paradigms – volume: 182 start-page: 531 year: 2016 end-page: 534 ident: bib0015 article-title: Note on the hybrid flowshop scheduling problem with multiprocessor tasks publication-title: International Journal of Production Economics – volume: 46 start-page: 1269 year: 2014 end-page: 1283 ident: bib0049 article-title: An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem publication-title: Engineering Optimization – volume: 40 start-page: 42 year: 2016 end-page: 57 ident: bib0043 article-title: Multi-objective adaptive large neighborhood search for distributedreentrant permutation flow shop scheduling publication-title: Applied Soft Computing – volume: 74 start-page: 41 year: 2017 end-page: 54 ident: bib0041 article-title: Efficient heuristics for the parallel blocking flow shop scheduling problem publication-title: Expert Systems with Applications – volume: 4 start-page: 497 year: 2011 end-page: 508 ident: bib0011 article-title: A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Computational Intelligence Systems – volume: 37 start-page: 1439 year: 2010 end-page: 1454 ident: bib0042 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research – start-page: 1 year: 2016 end-page: 7 ident: bib0007 article-title: Scheduling of stochastic distributed assembly flowshop under complex constraints publication-title: Proceedings of 2016 IEEE symposium series on computational intelligence (SSCI), Athens, Greece, December 2016 – year: 2007 ident: bib0029 article-title: Design and Analysis of Experiments – volume: 47 start-page: 3525 year: 2009 end-page: 3538 ident: bib0053 article-title: Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic publication-title: International Journal of Production Research – volume: 7 start-page: 729 year: 2013 end-page: 754 ident: bib0040 article-title: A competitive variable neighbourhood search algorithm for the blocking flow shop problem publication-title: European Journal of Industrial Engineering – volume: 51 start-page: 5029 year: 2013 end-page: 5038 ident: bib0028 article-title: Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm publication-title: International Journal of Production Research – volume: 284–287 start-page: 3712 year: 2013 end-page: 3716 ident: bib0017 article-title: Multiprocessor flow shop scheduling problem with common due window publication-title: Applied Mechanics and Materials – volume: 37 start-page: 754 year: 2010 end-page: 768 ident: bib0032 article-title: The distributed permutation flowshop scheduling problem publication-title: Computers & Operations Research – volume: 8 start-page: 323 year: 2005 end-page: 351 ident: bib0034 article-title: A genetic algorithm for hybrid fow-shop scheduling with multiprocessor tasks publication-title: Journal of Scheduling – volume: 31 start-page: 37 year: 2005 end-page: 555 ident: bib0009 article-title: Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks publication-title: Computers & Electrical Engineering – volume: 6 start-page: 199 year: 2012 end-page: 215 ident: bib0051 article-title: Minimizing makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm publication-title: European Journal of Industrial Engineering – volume: 39 start-page: 359 year: 1988 end-page: 364 ident: bib0014 article-title: Two-stage, hybrid flowshop scheduling problem publication-title: Journal of the Operational Research Society – volume: 237 start-page: 323 year: 2014 end-page: 334 ident: bib0025 article-title: Minimizing shifts for personnel task scheduling problems: A three-phase algorithm publication-title: European Journal of Operational Research – volume: 152 start-page: 115 year: 2004 end-page: 131 ident: bib0035 article-title: Hybrid flow-shop scheduling problems with multiprocessor task systems publication-title: European Journal of Operational Research – year: 2015 ident: bib0004 article-title: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms publication-title: Journal of Intelligent Manufacturing – volume: 44 start-page: 3161 year: 2006 end-page: 3177 ident: bib0052 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops an ant colony system approach publication-title: International Journal of Production Research – volume: 39 start-page: 293 year: 2011 end-page: 301 ident: bib0039 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega—International Journal of Management Science – volume: 6 start-page: 3094 year: 2011 end-page: 3100 ident: bib0012 article-title: An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems publication-title: Scientific Research and Essays – volume: 42 start-page: 1129 year: 1995 end-page: 1140 ident: bib0018 article-title: A local-search heuristic for large set-covering problems publication-title: Naval Research Logistics – volume: 9 start-page: 2701 year: 2015 end-page: 2708 ident: bib0021 article-title: A general variable neighborhood search algorithm to minimize makespan of the distributed permutation flowshop scheduling problem publication-title: International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering – start-page: 2240 year: 2016 end-page: 2246 ident: bib0048 article-title: A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem publication-title: Proceedings of 2016 IEEE congress on evolutionary computation (CEC), Vancouver, BC, Canada, July 2016 – start-page: 1 year: 2015 end-page: 3 ident: bib0001 article-title: A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems publication-title: Proceedings of the 6th international conference on modeling, simulation, and applied optimization (ICMSAO), Istanbul, Turkey, May 2015 – volume: 141 start-page: 137 year: 2013 end-page: 145 ident: bib0006 article-title: Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks publication-title: International Journal of Production Economics – volume: 10 start-page: 1293 year: 2010 end-page: 1300 ident: bib0020 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach publication-title: Applied Soft Computing – volume: 36 start-page: 7087 year: 2009 end-page: 7092 ident: bib0054 article-title: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic publication-title: Expert Systems with Applications – volume: 66 start-page: 1106 year: 2013 end-page: 1114 ident: bib0023 article-title: Improved bounds for hybrid flow shop scheduling with multiprocessor tasks publication-title: Computers & Industrial Engineering – volume: 5 start-page: 6121 year: 2017 end-page: 6133 ident: bib0016 article-title: New efficient lower bound for the hybrid flow shop scheduling problem with multiprocessor tasks publication-title: IEEE Access – volume: 53 start-page: 1111 year: 2015 end-page: 1123 ident: bib0010 article-title: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Production Research – volume: 38 start-page: 809 year: 2011 end-page: 815 ident: bib0026 article-title: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates publication-title: Computers & Operations Research – volume: 38 start-page: 10787 year: 2011 end-page: 10793 ident: bib0005 article-title: Metaheuristic methods in hybrid flow shop scheduling problem publication-title: Expert Systems with Applications – volume: 42 start-page: 6196 year: 2015 end-page: 6204 ident: bib0019 article-title: A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry publication-title: Expert Systems with Applications – volume: 51 start-page: 641 year: 2013 end-page: 651 ident: bib0013 article-title: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Production Research – volume: 205 start-page: 1 year: 2010 end-page: 18 ident: bib0044 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research – volume: 51 start-page: 2602 year: 2013 end-page: 2619 ident: bib0003 article-title: A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem publication-title: International Journal of Production Research – volume: 42 start-page: 9333 year: 2015 end-page: 9339 ident: bib0024 article-title: A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents publication-title: Expert Systems with Applications – volume: 52 start-page: 5735 year: 2014 end-page: 5747 ident: bib0055 article-title: Bi-objective reentrant hybrid flowshop scheduling: An iterated Pareto greedy algorithm publication-title: International Journal of Production Research – volume: 11 start-page: 315 year: 2017 end-page: 329 ident: bib0022 article-title: General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem publication-title: Production Engineering – volume: 55 start-page: 504 year: 2004 end-page: 512 ident: bib0045 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach publication-title: The Journal of the Operational Research Society – start-page: 270 year: 2002 end-page: 274 ident: bib0046 article-title: Multiprocessor task scheduling in multistage hybrid fowshops: A simulated annealing approach publication-title: Proceedings of the 2nd international conference on responsive manufacturing (ICRM), Gaziantep, Turkey, June 2002 – volume: 11 start-page: 3056 year: 2011 end-page: 3065 ident: bib0008 article-title: An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems publication-title: Applied Soft Computing – volume: 29 start-page: 364 year: 2005 end-page: 371 ident: bib0002 article-title: An adaptive genetic algorithm with dominated genes for distributed scheduling problems publication-title: Expert Systems with Applications – volume: 46 start-page: 4655 year: 2008 end-page: 4670 ident: bib0047 article-title: A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks publication-title: International Journal of Production Research – volume: 60 start-page: 810 year: 2009 end-page: 817 ident: bib0050 article-title: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks publication-title: Journal of the Operational Research Society – volume: 239 start-page: 323 year: 2014 end-page: 334 ident: bib0031 article-title: A scatter search algorithm for the distributed permutation flowshop scheduling problem publication-title: European Journal of Operational Research – volume: 41 start-page: 7754 year: 2014 end-page: 7763 ident: bib0030 article-title: Modeling and heuristics for scheduling of distributed job shops publication-title: Expert Systems with Applications – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0033 article-title: A heuristic algorithm for the m machine, n job flowshop sequencing problem publication-title: Omega—International Journal of Management Science – volume: 44 start-page: 41 year: 2014 end-page: 50 ident: bib0036 article-title: An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem publication-title: Omega—International Journal of Management Science – volume: 40 start-page: 1186 year: 2013 end-page: 1195 ident: bib0027 article-title: Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning publication-title: Computers & Operations Research – year: 2012 ident: bib0037 article-title: Scheduling: Theory, Algorithms, and Systems – volume: 38 start-page: 809 issue: 5 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0026 article-title: Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.09.020 – volume: 205 start-page: 1 issue: 1 year: 2010 ident: 10.1016/j.eswa.2017.09.032_bib0044 article-title: The hybrid flow shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.09.024 – volume: 52 start-page: 5735 issue: 19 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0055 article-title: Bi-objective reentrant hybrid flowshop scheduling: An iterated Pareto greedy algorithm publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.910627 – volume: 40 start-page: 42 issue: 1 year: 2016 ident: 10.1016/j.eswa.2017.09.032_bib0043 article-title: Multi-objective adaptive large neighborhood search for distributedreentrant permutation flow shop scheduling publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2015.11.034 – volume: 41 start-page: 7754 issue: 17 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0030 article-title: Modeling and heuristics for scheduling of distributed job shops publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.06.023 – volume: 46 start-page: 4655 issue: 17 year: 2008 ident: 10.1016/j.eswa.2017.09.032_bib0047 article-title: A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks publication-title: International Journal of Production Research doi: 10.1080/00207540701294627 – volume: 51 start-page: 2602 issue: 9 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0003 article-title: A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2012.737948 – volume: 42 start-page: 9333 issue: 23 year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0024 article-title: A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2015.08.025 – start-page: 270 year: 2002 ident: 10.1016/j.eswa.2017.09.032_bib0046 article-title: Multiprocessor task scheduling in multistage hybrid fowshops: A simulated annealing approach – start-page: 2240 year: 2016 ident: 10.1016/j.eswa.2017.09.032_bib0048 article-title: A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem – start-page: 1 year: 2016 ident: 10.1016/j.eswa.2017.09.032_bib0007 article-title: Scheduling of stochastic distributed assembly flowshop under complex constraints – volume: 284–287 start-page: 3712 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0017 article-title: Multiprocessor flow shop scheduling problem with common due window publication-title: Applied Mechanics and Materials doi: 10.4028/www.scientific.net/AMM.284-287.3712 – volume: 6 start-page: 199 issue: 2 year: 2012 ident: 10.1016/j.eswa.2017.09.032_bib0051 article-title: Minimizing makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm publication-title: European Journal of Industrial Engineering doi: 10.1504/EJIE.2012.045605 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.eswa.2017.09.032_bib0033 article-title: A heuristic algorithm for the m machine, n job flowshop sequencing problem publication-title: Omega—International Journal of Management Science doi: 10.1016/0305-0483(83)90088-9 – volume: 39 start-page: 359 issue: 4 year: 1988 ident: 10.1016/j.eswa.2017.09.032_bib0014 article-title: Two-stage, hybrid flowshop scheduling problem publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1988.63 – volume: 11 start-page: 315 issue: 3 year: 2017 ident: 10.1016/j.eswa.2017.09.032_bib0022 article-title: General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem publication-title: Production Engineering doi: 10.1007/s11740-017-0716-9 – volume: 42 start-page: 6196 issue: 15–16 year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0019 article-title: A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2015.03.012 – volume: 7 start-page: 729 issue: 6 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0040 article-title: A competitive variable neighbourhood search algorithm for the blocking flow shop problem publication-title: European Journal of Industrial Engineering doi: 10.1504/EJIE.2013.058392 – volume: 74 start-page: 41 year: 2017 ident: 10.1016/j.eswa.2017.09.032_bib0041 article-title: Efficient heuristics for the parallel blocking flow shop scheduling problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.01.006 – volume: 53 start-page: 1111 issue: 4 year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0010 article-title: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.948578 – year: 2007 ident: 10.1016/j.eswa.2017.09.032_bib0029 – volume: 6 start-page: 3094 issue: 14 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0012 article-title: An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems publication-title: Scientific Research and Essays – volume: 36 start-page: 7087 issue: 3 year: 2009 ident: 10.1016/j.eswa.2017.09.032_bib0054 article-title: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2008.08.033 – volume: 141 start-page: 137 issue: 1 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0006 article-title: Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2012.05.015 – volume: 4 start-page: 497 issue: 4 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0011 article-title: A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Computational Intelligence Systems doi: 10.1080/18756891.2011.9727808 – year: 2012 ident: 10.1016/j.eswa.2017.09.032_bib0037 – volume: 44 start-page: 41 issue: 1 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0036 article-title: An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem publication-title: Omega—International Journal of Management Science doi: 10.1016/j.omega.2013.10.002 – volume: 44 start-page: 3161 issue: 16 year: 2006 ident: 10.1016/j.eswa.2017.09.032_bib0052 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops an ant colony system approach publication-title: International Journal of Production Research doi: 10.1080/00207540500536939 – volume: 239 start-page: 323 issue: 2 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0031 article-title: A scatter search algorithm for the distributed permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.05.024 – volume: 42 start-page: 1129 issue: 7 year: 1995 ident: 10.1016/j.eswa.2017.09.032_bib0018 article-title: A local-search heuristic for large set-covering problems publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M – volume: 10 start-page: 1293 issue: 4 year: 2010 ident: 10.1016/j.eswa.2017.09.032_bib0020 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2010.03.008 – volume: 60 start-page: 810 issue: 6 year: 2009 ident: 10.1016/j.eswa.2017.09.032_bib0050 article-title: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602625 – volume: 11 start-page: 3056 issue: 3 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0008 article-title: An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2010.12.006 – volume: 37 start-page: 1439 issue: 8 year: 2010 ident: 10.1016/j.eswa.2017.09.032_bib0042 article-title: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.11.001 – volume: 8 start-page: 323 issue: 4 year: 2005 ident: 10.1016/j.eswa.2017.09.032_bib0034 article-title: A genetic algorithm for hybrid fow-shop scheduling with multiprocessor tasks publication-title: Journal of Scheduling doi: 10.1007/s10951-005-1640-y – volume: 47 start-page: 3525 issue: 13 year: 2009 ident: 10.1016/j.eswa.2017.09.032_bib0053 article-title: Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic publication-title: International Journal of Production Research doi: 10.1080/00207540701871085 – volume: 237 start-page: 323 issue: 1 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0025 article-title: Minimizing shifts for personnel task scheduling problems: A three-phase algorithm publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.01.035 – volume: 51 start-page: 641 issue: 3 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0013 article-title: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.644819 – volume: 39 start-page: 293 issue: 3 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0039 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega—International Journal of Management Science doi: 10.1016/j.omega.2010.07.007 – volume: 9 start-page: 2701 issue: 8 year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0021 article-title: A general variable neighborhood search algorithm to minimize makespan of the distributed permutation flowshop scheduling problem publication-title: International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering – volume: 55 start-page: 504 issue: 5 year: 2004 ident: 10.1016/j.eswa.2017.09.032_bib0045 article-title: Multiprocessor task scheduling in multistage hybrid flow-shops: A genetic algorithm approach publication-title: The Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601716 – volume: 29 start-page: 364 issue: 2 year: 2005 ident: 10.1016/j.eswa.2017.09.032_bib0002 article-title: An adaptive genetic algorithm with dominated genes for distributed scheduling problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2005.04.009 – volume: 40 start-page: 1186 issue: 5 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0027 article-title: Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.12.014 – volume: 182 start-page: 531 year: 2016 ident: 10.1016/j.eswa.2017.09.032_bib0015 article-title: Note on the hybrid flowshop scheduling problem with multiprocessor tasks publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2016.10.001 – volume: 38 start-page: 10787 issue: 9 year: 2011 ident: 10.1016/j.eswa.2017.09.032_bib0005 article-title: Metaheuristic methods in hybrid flow shop scheduling problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.01.173 – volume: 5 start-page: 6121 year: 2017 ident: 10.1016/j.eswa.2017.09.032_bib0016 article-title: New efficient lower bound for the hybrid flow shop scheduling problem with multiprocessor tasks publication-title: IEEE Access – year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0004 article-title: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-015-1084-y – volume: 31 start-page: 37 issue: 8 year: 2005 ident: 10.1016/j.eswa.2017.09.032_bib0009 article-title: Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks publication-title: Computers & Electrical Engineering doi: 10.1016/j.compeleceng.2005.09.004 – volume: 46 start-page: 1269 issue: 9 year: 2014 ident: 10.1016/j.eswa.2017.09.032_bib0049 article-title: An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem publication-title: Engineering Optimization doi: 10.1080/0305215X.2013.827673 – start-page: 1 year: 2015 ident: 10.1016/j.eswa.2017.09.032_bib0001 article-title: A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems – volume: 152 start-page: 115 issue: 1 year: 2004 ident: 10.1016/j.eswa.2017.09.032_bib0035 article-title: Hybrid flow-shop scheduling problems with multiprocessor task systems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00644-6 – volume: 51 start-page: 5029 issue: 16 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0028 article-title: Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.790571 – volume: 37 start-page: 754 issue: 4 year: 2010 ident: 10.1016/j.eswa.2017.09.032_bib0032 article-title: The distributed permutation flowshop scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.06.019 – volume: 8 start-page: 377 issue: 4 year: 2016 ident: 10.1016/j.eswa.2017.09.032_bib0038 article-title: Multistage multiprocessor task scheduling in hybrid flow shop problems using discrete firefly algorithm publication-title: International Journal of Advanced Intelligence Paradigms doi: 10.1504/IJAIP.2016.080191 – volume: 66 start-page: 1106 issue: 4 year: 2013 ident: 10.1016/j.eswa.2017.09.032_bib0023 article-title: Improved bounds for hybrid flow shop scheduling with multiprocessor tasks publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2013.08.004 |
| SSID | ssj0017007 |
| Score | 2.564819 |
| Snippet | •This paper is the first research to solve the distributed hybrid flowshop scheduling problem.•The proposed SIG algorithm provides a practical means of solving... The trend of globalization has recently seen the study of distributed scheduling problems. This study attempts to solve the distributed hybrid flowshop... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 132 |
| SubjectTerms | Adaptive algorithms Adaptive cocktail decoding mechanism Algorithms Decoding Distributed hybrid flowshop Globalization Greedy algorithms Integer programming Linear programming Mixed integer Multiprocessing Scheduling Scheduling algorithms Self-tuning iterated greedy algorithm Task scheduling |
| Title | Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks |
| URI | https://dx.doi.org/10.1016/j.eswa.2017.09.032 https://www.proquest.com/docview/1968401583 |
| Volume | 92 |
| WOSCitedRecordID | wos000414107100011&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLag44EXxlWMDeQHxEvlqYmd2nmcUCcupSDRQd-sJLbX7JKWpWODX89xbSftEBU88BJFaS6Vz-fj43P7EHoJy0IhDO8TqlVBWFz0iNAmJZESfcNzRXMn6SEfjcRkkn7yoZh6SSfAq0pcX6fz_ypquAbCtqWz_yDu5qVwAc5B6HAEscPxrwT_oazK8_KndQGcZ6caNEabS6hsm1zLcAVm5vSHLdbqmrPZVT2dzbuwzYVlx1enL1lmnJPWpRy6egL7mqw-rdf8-bZZ8sK3hA7Fcith8UavePaU95czYlm7j5tcINfG4PO0nJKvulz1Q0QipC4H51hTIPNlzcnICYscD8--dipWcEr63PEiBh3s-PC8Eo2cx_M35e78DCf7ur6yHaMi7jrUxu1SFsL3o4_y8Gg4lOPBZPxq_o1YkjEbjPeMK7fRVsyTVHTQ1sHbweRdE3biPVdfH_62r7JyCYE3P_snS-bGmr40VMb30T2_w8AHDhkP0C1dPUTbgb0De2X-CKkWKDgABQNQMAAFrwAFO6DgABTcAgV7oGArdLwOFLwEymN0dDgYv35DPOcGKcB2WxClVU9xmhuVZqDMacFNArM40UaJPFc6MmCy85yxhEUmo5obndM4ZRp2xilTffoEdapZpZ8iHOWMU-sfiI1mseKpHWAlepkoYpqnZgdFYfxk4RvSW16UMxkyD0-kHXNpx1z2UgljvoO6zTNz145l491JEIv0BqUzFCVAauNze0GG0s_sWsJSJRgYz4I-2_zzLrrbzo891FlcXOrn6E7xfVHWFy885H4ByqKlLQ |
| linkProvider | Elsevier |
| 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=Minimizing+makespan+for+the+distributed+hybrid+flowshop+scheduling+problem+with+multiprocessor+tasks&rft.jtitle=Expert+systems+with+applications&rft.au=Ying%2C+Kuo-Ching&rft.au=Lin%2C+Shih-Wei&rft.date=2018-02-01&rft.pub=Elsevier+BV&rft.issn=0957-4174&rft.eissn=1873-6793&rft.volume=92&rft.spage=132&rft_id=info:doi/10.1016%2Fj.eswa.2017.09.032&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |