Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study
► We study the multi-objective PFSP with setup times problem. ► Review state of the art on the problem and propose a new benchmark and new algorithm. ► Obtained state of the art results for the proposed benchmark. The permutation flowshop scheduling problem has been thoroughly studied in recent deca...
Saved in:
| Published in: | European journal of operational research Vol. 227; no. 2; pp. 301 - 313 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
01.06.2013
Elsevier Elsevier Sequoia S.A |
| Subjects: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | ► We study the multi-objective PFSP with setup times problem. ► Review state of the art on the problem and propose a new benchmark and new algorithm. ► Obtained state of the art results for the proposed benchmark.
The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-art method for this important and practical scheduling problem. |
|---|---|
| AbstractList | The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-art method for this important and practical scheduling problem. ► We study the multi-objective PFSP with setup times problem. ► Review state of the art on the problem and propose a new benchmark and new algorithm. ► Obtained state of the art results for the proposed benchmark. The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependent setup times are considered. As setup times and multi-criteria problems are important in industry, we must focus on this area. We propose a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria. The presented method is referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature. Comprehensive computational and statistical analyses are carried out in order to demonstrate that the proposed RIPG method clearly outperforms all other algorithms and, as a consequence, it is a state-of-art method for this important and practical scheduling problem. |
| Author | Minella, Gerardo Ciavotta, Michele Ruiz, Rubén |
| Author_xml | – sequence: 1 givenname: Michele surname: Ciavotta fullname: Ciavotta, Michele email: mciavotta@iti.upv.es – sequence: 2 givenname: Gerardo surname: Minella fullname: Minella, Gerardo email: mgerar@iti.upv.es – sequence: 3 givenname: Rubén surname: Ruiz fullname: Ruiz, Rubén email: rruiz@eio.upv.es |
| BackLink | http://www.econis.eu/PPNSET?PPN=740893157$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften |
| BookMark | eNp9kUFr3DAQhUVJoZu0f6CXCnr2ViNbkrf0EkKTFlJ6Sc5CK427MrbkSnJC_n213fTSQ2BAMLz3RvPNOTkLMSAh74FtgYH8NG5xjGnLGfBtLdbCK7KBXvFG9pKdkQ1rlWo4B_WGnOc8MsZAgNiQ8GOdim_ifkRb_APSjL9XDBapwwWDw1Bqq6wLLX7GTBdM81pM8THQYYqP-RCXz_SSBnykZvoVky-HmZrgqKE2zkvCA4b8N7is7ukteT2YKeO75_eC3F9_vbv61tz-vPl-dXnb2I6r0uCOmf3Q4iAVQudQOtayDiQ3ZlBKcpRgjBQS7LDjcs86LswOBmGUtcpB216Qj6fcJcW6Ty56jGsKdaQGIYRsey5ZVX04qdDG4LNekp9NetKqY_2uBaGqoj8pbIo5Jxy09aftSzJ-0sD0kb8e9ZG_PvLXtSr_auX_Wf_Fv2j68vyjCufBY9LZ-uM5nE_1QNpF_5L9D25bogA |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1016_j_swevo_2019_100575 crossref_primary_10_1109_ACCESS_2024_3372396 crossref_primary_10_1109_TPDS_2023_3245089 crossref_primary_10_1016_j_engappai_2021_104264 crossref_primary_10_1016_j_eswa_2018_06_020 crossref_primary_10_1109_TEVC_2024_3399314 crossref_primary_10_1016_j_asoc_2025_113273 crossref_primary_10_1016_j_engappai_2016_10_013 crossref_primary_10_1016_j_eswa_2021_116484 crossref_primary_10_1080_0305215X_2020_1797000 crossref_primary_10_3390_a14070210 crossref_primary_10_46465_endustrimuhendisligi_623030 crossref_primary_10_1080_00207543_2014_910627 crossref_primary_10_1007_s40747_022_00830_6 crossref_primary_10_3390_a12050100 crossref_primary_10_1016_j_jclepro_2017_04_032 crossref_primary_10_1016_j_swevo_2023_101399 crossref_primary_10_1109_TII_2018_2843441 crossref_primary_10_1080_00207543_2019_1630777 crossref_primary_10_1016_j_swevo_2020_100742 crossref_primary_10_1016_j_cie_2016_12_020 crossref_primary_10_1016_j_engappai_2021_104593 crossref_primary_10_1016_j_rcim_2019_101844 crossref_primary_10_1016_j_cor_2022_105733 crossref_primary_10_1016_j_ejor_2018_08_048 crossref_primary_10_1016_j_eswa_2021_115214 crossref_primary_10_1016_j_eswa_2020_114265 crossref_primary_10_1016_j_eswa_2021_115453 crossref_primary_10_1109_TEM_2015_2453264 crossref_primary_10_1109_ACCESS_2017_2732738 crossref_primary_10_1155_2020_2862186 crossref_primary_10_1016_j_ejor_2021_03_069 crossref_primary_10_1016_j_eswa_2022_116910 crossref_primary_10_1016_j_ijpe_2015_07_027 crossref_primary_10_1109_TCYB_2021_3069184 crossref_primary_10_1109_ACCESS_2016_2565622 crossref_primary_10_1016_j_cie_2016_07_027 crossref_primary_10_1007_s00521_020_05610_2 crossref_primary_10_1080_0951192X_2016_1187293 crossref_primary_10_1109_TASE_2021_3062994 crossref_primary_10_1016_j_asoc_2022_108459 crossref_primary_10_3390_math12081218 crossref_primary_10_1016_j_advengsoft_2016_06_004 crossref_primary_10_3390_math10142395 crossref_primary_10_1016_j_ejor_2017_06_027 crossref_primary_10_1016_j_engappai_2022_104725 crossref_primary_10_1080_01605682_2022_2039569 crossref_primary_10_1016_j_ejor_2016_07_030 crossref_primary_10_1080_00207543_2015_1047981 crossref_primary_10_1155_2016_1257060 crossref_primary_10_1080_00207543_2018_1468095 crossref_primary_10_1109_TASE_2018_2886303 crossref_primary_10_21597_jist_935652 crossref_primary_10_1016_j_cor_2021_105543 crossref_primary_10_1007_s40747_023_01136_x crossref_primary_10_1016_j_cie_2019_106026 crossref_primary_10_1016_j_knosys_2018_11_021 crossref_primary_10_1016_j_asoc_2021_107654 crossref_primary_10_1109_TII_2021_3056425 crossref_primary_10_1007_s40305_017_0165_3 crossref_primary_10_1016_j_jmapro_2024_01_016 crossref_primary_10_1080_10429247_2018_1522221 crossref_primary_10_1007_s10845_020_01598_7 crossref_primary_10_1007_s10951_019_00610_0 crossref_primary_10_1016_j_jocs_2013_11_002 crossref_primary_10_1016_j_jclepro_2022_132551 crossref_primary_10_1016_j_ejor_2020_10_052 crossref_primary_10_1080_00207543_2019_1656837 crossref_primary_10_1007_s10288_023_00535_7 crossref_primary_10_1111_itor_12662 crossref_primary_10_1007_s10845_020_01697_5 crossref_primary_10_1080_17477778_2018_1473908 crossref_primary_10_1177_1687814019843699 crossref_primary_10_1109_TEM_2016_2645790 crossref_primary_10_1016_j_cie_2025_111214 crossref_primary_10_1016_j_swevo_2024_101762 crossref_primary_10_1016_j_cie_2020_106570 |
| Cites_doi | 10.1016/j.ejor.2006.06.060 10.1109/4235.996017 10.1016/S0167-5060(08)70356-X 10.1109/4235.797969 10.1057/palgrave.jors.2601746 10.1080/09511920601160288 10.1007/s10852-005-9034-x 10.1080/095372897235055 10.1016/j.ejor.2006.07.029 10.1016/0377-2217(93)E0212-G 10.1287/moor.1.2.117 10.1287/ijoc.1070.0258 10.1016/j.ejor.2004.07.020 10.1023/B:HEUR.0000045320.79875.e3 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M 10.1109/TEVC.2003.810758 10.1007/s00291-007-0098-z 10.1016/0377-2217(93)90182-M 10.1016/0360-8352(96)00045-9 10.1023/A:1009691028143 10.1016/S0360-8352(97)00093-4 10.1016/j.ejor.2004.01.022 10.1016/S0377-2217(02)00485-X 10.1016/j.ejor.2006.06.010 10.1016/0305-0483(83)90088-9 10.1016/j.ejor.2005.12.009 10.1109/TEVC.2003.810752 10.1109/5326.704576 10.1162/evco.1994.2.3.221 10.1016/S0925-5273(97)00017-0 10.1057/palgrave.jors.2602625 10.1016/j.ejor.2004.07.017 10.1016/j.ejor.2003.08.029 10.1016/S0377-2217(01)00278-8 10.1016/S0305-0548(97)00079-8 10.1007/s00170-004-2249-6 10.1006/jcph.1999.6413 10.1016/0305-0483(92)90075-I 10.1016/j.cor.2011.01.010 10.1023/A:1027372722187 10.1016/0377-2217(90)90090-X |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier B.V. Copyright Elsevier Sequoia S.A. Jun 1, 2013 |
| Copyright_xml | – notice: 2013 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Jun 1, 2013 |
| DBID | AAYXX CITATION OQ6 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ejor.2012.12.031 |
| DatabaseName | CrossRef ECONIS Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering 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 Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 313 |
| ExternalDocumentID | 3411972981 740893157 10_1016_j_ejor_2012_12_031 S0377221713000052 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD AAYOK OQ6 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c427t-e90abf3ef67e14de6d0304162aaf7762e61aa6561cf926b0425a91f5a7cc7d133 |
| ISICitedReferencesCount | 84 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000315080300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sun Oct 05 00:21:09 EDT 2025 Sat Mar 08 16:22:08 EST 2025 Tue Nov 18 21:07:20 EST 2025 Sat Nov 29 01:41:07 EST 2025 Fri Feb 23 02:32:28 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Sequence dependent setup times Scheduling Permutation flowshop Multi-objective Iterated greedy |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c427t-e90abf3ef67e14de6d0304162aaf7762e61aa6561cf926b0425a91f5a7cc7d133 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0377221713000052 |
| PQID | 1555638260 |
| PQPubID | 45678 |
| PageCount | 13 |
| ParticipantIDs | proquest_journals_1555638260 econis_primary_740893157 crossref_citationtrail_10_1016_j_ejor_2012_12_031 crossref_primary_10_1016_j_ejor_2012_12_031 elsevier_sciencedirect_doi_10_1016_j_ejor_2012_12_031 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-06-01 |
| PublicationDateYYYYMMDD | 2013-06-01 |
| PublicationDate_xml | – month: 06 year: 2013 text: 2013-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Ruiz, Maroto, Alcaraz (b0200) 2005; 165 Corne, D.W., Knowles, J.D., Oates, M.J., 2000. The Pareto envelope-based selection algorithm for multiobjective optimization. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo Guervós, J.J., Schwefel, H.P. (Eds.), Parallel Problem Solving from Nature – PPSN VI, 6th International Conference, Paris, France, September 18–20, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1917. Springer, pp. 839–848. Rajendran, Ziegler (b0170) 1997; 33 Ríos-Mercado, Bard (b0185) 1998; 25 Zitzler, Knowles, Thiele (b0265) 2008; vol. 5252 Taillard (b0240) 1993; 64 Minella, Ruiz, Ciavotta (b0120) 2011; 38 Murata, Ishibuchi, Tanaka (b0135) 1996; 30 Schrimpf, Schneider, Stamm-Wilbrandt, Dueck (b0215) 2000; 159 Kollat, J.B., Reed, P.M., 2005. The value of online adaptive search: a performance comparison of NSGAII Ruiz, Stntzle (b0205) 2007; 177 Loukil, Teghem, Fortemps (b0100) 2000; 29 Nawaz, Enscore, Ham (b0140) 1983; 11 Knowles, J., Thiele, L., Zitzler, E., 2006. A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. Technical Report 214. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland. Revised Version. Parthasarathy, Rajendran (b0155) 1997; 8 Arroyo, Armentano (b0020) 2005; 167 Graham, Lawler, Lenstra, Kan (b0070) 1979; 5 Armentano, Arroyo (b0010) 2004; 10 Bagchi, T.P., 2001. Pareto-optimal solutions for multi-objective production scheduling problems. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D. (Eds.), Evolutionary Multi-Criterion Optimization, First International Conference, EMO 2001, Zurich, Switzerland, March 7–9, 2001, Proceedings. Lecture Notes in Computer Science, vol. 1993. Springer, 2001, pp. 458–471. Ishibuchi, Yoshida, Murata (b0080) 2003; 7 T’kindt, Billaut (b0245) 2006 Taillard (b0235) 1990; 47 Zitzler, Thiele, Laumanns, Fonseca, da Fonseca (b0275) 2003; 7 Minella, Ruiz, Ciavotta (b0115) 2008; 20 Deb (b0040) 2002; 6 Ruiz, Stntzle (b0210) 2008; 187 Varadharajan, Rajendran (b0250) 2005; 167 Fonseca, Fonseca, Hall (b0045) 2001; vol. 1993 Yanda, Tamura (b0255) 2007; 20 Garey, Johnson, Sethi (b0060) 1976; 1 Parthasarathy, Rajendran (b0150) 1997; 49 Ying (b0260) 2009; 60 Pan, Wang, Zhao (b0145) 2007; 38 Ishibuchi, Murata (b0075) 1998; 28 Arroyo, Armentano (b0015) 2004; 55 Framinan, Leisten, Ruiz-Usano (b0055) 2002; 141 Rajendran, Ziegler (b0175) 2003; 149 Suresh, R.K., Mohanasundaram, K.M. 2004. Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives. In: IEEE Conference on Cybernetics and Intelligent Systems (CIS), Singapore, December 1–3, 2004, Proceedings, vol. 2. pp. 712–717. Geiger (b0065) 2007; 181 Corne, Jerram, Knowles, Oates (b0030) 2001 Pasupathy, Rajendran, Suresh (b0160) 2006; 27 Zitzler, Thiele (b0270) 1999; 3 Srinivas, Deb (b0225) 1994; 2 Jacobs, Brusco (b0085) 1995; 42 Ríos-Mercado, Bard (b0190) 1999; 5 NSGAII and Rajendran (b0165) 1995; 82 Framinan, Leisten (b0050) 2008; 30 Ríos-Mercado, Bard (b0195) 2003; 7 Loukil, Teghem, Tuyttens (b0105) 2005; 161 López-Ibáñez, Paquete, Stützle (b0110) 2006; 5 Murata, Ishibuchi, Gen (b0130) 2001; vol. 1993 Rajendran, Ziegler (b0180) 2009; vol. 230 Simons (b0220) 1992; 20 Allahverdi, Ng, Cheng, Kovalyov (b0005) 2008; 187 Montgomery (b0125) 2009 MOEA. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (Eds.), Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Guanajuato, Mexico, March 9–11, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3410. Springer, pp. 386–398. Fonseca (10.1016/j.ejor.2012.12.031_b0045) 2001; vol. 1993 Rajendran (10.1016/j.ejor.2012.12.031_b0170) 1997; 33 10.1016/j.ejor.2012.12.031_b0090 Corne (10.1016/j.ejor.2012.12.031_b0030) 2001 Zitzler (10.1016/j.ejor.2012.12.031_b0275) 2003; 7 Taillard (10.1016/j.ejor.2012.12.031_b0235) 1990; 47 Ríos-Mercado (10.1016/j.ejor.2012.12.031_b0185) 1998; 25 Taillard (10.1016/j.ejor.2012.12.031_b0240) 1993; 64 10.1016/j.ejor.2012.12.031_b0095 Pasupathy (10.1016/j.ejor.2012.12.031_b0160) 2006; 27 Montgomery (10.1016/j.ejor.2012.12.031_b0125) 2009 Zitzler (10.1016/j.ejor.2012.12.031_b0265) 2008; vol. 5252 Minella (10.1016/j.ejor.2012.12.031_b0120) 2011; 38 Loukil (10.1016/j.ejor.2012.12.031_b0105) 2005; 161 T’kindt (10.1016/j.ejor.2012.12.031_b0245) 2006 Murata (10.1016/j.ejor.2012.12.031_b0130) 2001; vol. 1993 Parthasarathy (10.1016/j.ejor.2012.12.031_b0155) 1997; 8 Garey (10.1016/j.ejor.2012.12.031_b0060) 1976; 1 Rajendran (10.1016/j.ejor.2012.12.031_b0175) 2003; 149 Deb (10.1016/j.ejor.2012.12.031_b0040) 2002; 6 Murata (10.1016/j.ejor.2012.12.031_b0135) 1996; 30 Nawaz (10.1016/j.ejor.2012.12.031_b0140) 1983; 11 Minella (10.1016/j.ejor.2012.12.031_b0115) 2008; 20 Rajendran (10.1016/j.ejor.2012.12.031_b0165) 1995; 82 Ruiz (10.1016/j.ejor.2012.12.031_b0205) 2007; 177 Geiger (10.1016/j.ejor.2012.12.031_b0065) 2007; 181 Yanda (10.1016/j.ejor.2012.12.031_b0255) 2007; 20 Armentano (10.1016/j.ejor.2012.12.031_b0010) 2004; 10 Schrimpf (10.1016/j.ejor.2012.12.031_b0215) 2000; 159 Ying (10.1016/j.ejor.2012.12.031_b0260) 2009; 60 Srinivas (10.1016/j.ejor.2012.12.031_b0225) 1994; 2 Loukil (10.1016/j.ejor.2012.12.031_b0100) 2000; 29 10.1016/j.ejor.2012.12.031_b0035 10.1016/j.ejor.2012.12.031_b0230 López-Ibáñez (10.1016/j.ejor.2012.12.031_b0110) 2006; 5 Parthasarathy (10.1016/j.ejor.2012.12.031_b0150) 1997; 49 Rajendran (10.1016/j.ejor.2012.12.031_b0180) 2009; vol. 230 Ruiz (10.1016/j.ejor.2012.12.031_b0210) 2008; 187 Arroyo (10.1016/j.ejor.2012.12.031_b0020) 2005; 167 Allahverdi (10.1016/j.ejor.2012.12.031_b0005) 2008; 187 Ruiz (10.1016/j.ejor.2012.12.031_b0200) 2005; 165 Ishibuchi (10.1016/j.ejor.2012.12.031_b0080) 2003; 7 Graham (10.1016/j.ejor.2012.12.031_b0070) 1979; 5 Pan (10.1016/j.ejor.2012.12.031_b0145) 2007; 38 Jacobs (10.1016/j.ejor.2012.12.031_b0085) 1995; 42 Ishibuchi (10.1016/j.ejor.2012.12.031_b0075) 1998; 28 Framinan (10.1016/j.ejor.2012.12.031_b0055) 2002; 141 Simons (10.1016/j.ejor.2012.12.031_b0220) 1992; 20 Framinan (10.1016/j.ejor.2012.12.031_b0050) 2008; 30 10.1016/j.ejor.2012.12.031_b0025 Varadharajan (10.1016/j.ejor.2012.12.031_b0250) 2005; 167 Arroyo (10.1016/j.ejor.2012.12.031_b0015) 2004; 55 Zitzler (10.1016/j.ejor.2012.12.031_b0270) 1999; 3 Ríos-Mercado (10.1016/j.ejor.2012.12.031_b0190) 1999; 5 Ríos-Mercado (10.1016/j.ejor.2012.12.031_b0195) 2003; 7 |
| References_xml | – volume: 2 start-page: 221 year: 1994 end-page: 248 ident: b0225 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evolutionary Computation – volume: 167 start-page: 717 year: 2005 end-page: 738 ident: b0020 article-title: Genetic local search for multi-objective flowshop scheduling problems publication-title: European Journal of Operational Research – volume: 42 start-page: 1129 year: 1995 end-page: 1140 ident: b0085 article-title: A local-search heuristic for large set-covering problems publication-title: Naval Research Logistics – volume: 149 start-page: 513 year: 2003 end-page: 522 ident: b0175 article-title: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times publication-title: European Journal of Operational Research – volume: 187 start-page: 985 year: 2008 end-page: 1032 ident: b0005 article-title: A survey of scheduling problems with setup times or costs publication-title: European Journal of Operational Research – reference: Suresh, R.K., Mohanasundaram, K.M. 2004. Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives. In: IEEE Conference on Cybernetics and Intelligent Systems (CIS), Singapore, December 1–3, 2004, Proceedings, vol. 2. pp. 712–717. – reference: -NSGAII and – volume: 38 start-page: 778 year: 2007 end-page: 786 ident: b0145 article-title: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion publication-title: The International Journal of Advanced Manufacturing Technology – volume: 5 start-page: 53 year: 1999 end-page: 70 ident: b0190 article-title: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times publication-title: Journal of Heuristics – volume: 20 start-page: 215 year: 1992 end-page: 225 ident: b0220 article-title: Heuristics in flow shop scheduling with sequence dependent setup times publication-title: Omega-International Journal of Management Science – volume: 167 start-page: 772 year: 2005 end-page: 795 ident: b0250 article-title: A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs publication-title: European Journal of Operational Research – volume: 25 start-page: 351 year: 1998 end-page: 366 ident: b0185 article-title: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups publication-title: Computers & Operations Research – volume: 161 start-page: 42 year: 2005 end-page: 61 ident: b0105 article-title: Solving multi-objective production scheduling problems using metaheuristics publication-title: European Journal of Operational Research – volume: 5 start-page: 111 year: 2006 end-page: 137 ident: b0110 article-title: Hybrid population-based algorithms for the bi-objective quadratic assignment problem publication-title: Journal of Mathematical Modelling and Algorithms – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: b0040 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation – start-page: 283 year: 2001 end-page: 290 ident: b0030 article-title: PESA-II: Region-based selection in evolutionary multiobjective optimization publication-title: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) – volume: 60 start-page: 810 year: 2009 end-page: 818 ident: b0260 article-title: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks publication-title: Journal of the Operational Research Society – volume: 55 start-page: 1000 year: 2004 end-page: 1007 ident: b0015 article-title: A partial enumeration heuristic for multi-objective flowshop scheduling problems publication-title: Journal of the Operational Research Society – volume: 38 start-page: 1521 year: 2011 end-page: 1533 ident: b0120 article-title: Restarted iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems publication-title: Computers & Operations Research – volume: 8 start-page: 475 year: 1997 end-page: 483 ident: b0155 article-title: A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs – a case study publication-title: Production Planning & Control – volume: 187 start-page: 1143 year: 2008 end-page: 1159 ident: b0210 article-title: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: European Journal of Operational Research – volume: 7 start-page: 117 year: 2003 end-page: 132 ident: b0275 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE, Transactions on Evolutionary Computation – volume: 1 start-page: 117 year: 1976 end-page: 129 ident: b0060 article-title: The complexity of flow shop and job shop scheduling publication-title: Mathematics of Operations Research – volume: 30 start-page: 787 year: 2008 end-page: 804 ident: b0050 article-title: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria publication-title: OR Spectrum – volume: vol. 1993 start-page: 82 year: 2001 end-page: 95 ident: b0130 article-title: Specification of genetic search directions in cellular multi-objective genetic algorithms publication-title: Evolutionary Multi-Criterion Optimization, First International Conference, EMO 2001, Zurich, Switzerland, March 7–9, 2001, Proceedings – volume: 33 start-page: 281 year: 1997 end-page: 284 ident: b0170 article-title: A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs publication-title: Computers & Industrial Engineering – volume: 20 start-page: 465 year: 2007 end-page: 477 ident: b0255 article-title: A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems publication-title: International journal of computer integrated manufacturing – volume: 10 start-page: 463 year: 2004 end-page: 481 ident: b0010 article-title: An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem publication-title: Journal of Heuristics – reference: Knowles, J., Thiele, L., Zitzler, E., 2006. A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers. Technical Report 214. Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Switzerland. Revised Version. – volume: vol. 230 start-page: 53 year: 2009 end-page: 99 ident: b0180 article-title: A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs publication-title: Computational Intelligence in Flow Shop and Job Shop Scheduling – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: b0140 article-title: A heuristic algorithm for the m machine, n job flowshop sequencing problem publication-title: Omega-International Journal of Management Science – volume: 3 start-page: 257 year: 1999 end-page: 271 ident: b0270 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: b0240 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research – volume: 29 start-page: 819 year: 2000 end-page: 828 ident: b0100 article-title: Solving multi-objective production scheduling problems with tabu search publication-title: Control and Cybernetics – year: 2009 ident: b0125 article-title: Design and Analysis of Experiments – volume: 20 start-page: 451 year: 2008 end-page: 471 ident: b0115 article-title: A review and evaluation of multi-objective algorithms for the flowshop scheduling problem publication-title: INFORMS Journal on Computing – volume: 7 start-page: 204 year: 2003 end-page: 223 ident: b0080 article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling publication-title: IEEE Transactions on Evolutionary Computation – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: b0205 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research – year: 2006 ident: b0245 article-title: Multicriteria Scheduling: Theory, Models and Algorithms – volume: 141 start-page: 559 year: 2002 end-page: 569 ident: b0055 article-title: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation publication-title: European Journal of Operational Research – reference: -MOEA. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (Eds.), Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Guanajuato, Mexico, March 9–11, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3410. Springer, pp. 386–398. – volume: vol. 1993 start-page: 213 year: 2001 end-page: 225 ident: b0045 article-title: Inferential performance assessment of stochastic optimisers and the attainment function publication-title: Evolutionary Multi-Criterion Optimization, First International Conference – volume: 7 start-page: 291 year: 2003 end-page: 318 ident: b0195 article-title: The flow shop scheduling polyhedron with setup times publication-title: Journal of Combinatorial Optimization – reference: Bagchi, T.P., 2001. Pareto-optimal solutions for multi-objective production scheduling problems. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D. (Eds.), Evolutionary Multi-Criterion Optimization, First International Conference, EMO 2001, Zurich, Switzerland, March 7–9, 2001, Proceedings. Lecture Notes in Computer Science, vol. 1993. Springer, 2001, pp. 458–471. – volume: 181 start-page: 195 year: 2007 end-page: 206 ident: b0065 article-title: On operators and search space topology in multi-objective flow shop scheduling publication-title: European Journal of Operational Research – reference: Corne, D.W., Knowles, J.D., Oates, M.J., 2000. The Pareto envelope-based selection algorithm for multiobjective optimization. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo Guervós, J.J., Schwefel, H.P. (Eds.), Parallel Problem Solving from Nature – PPSN VI, 6th International Conference, Paris, France, September 18–20, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1917. Springer, pp. 839–848. – volume: 30 start-page: 957 year: 1996 end-page: 968 ident: b0135 article-title: Multi-objective genetic algorithm and its applications to flowshop scheduling publication-title: Computers & Industrial Engineering – volume: 82 start-page: 540 year: 1995 end-page: 555 ident: b0165 article-title: Heuristics for scheduling in flowshop with multiple objectives publication-title: European Journal of Operational Research – volume: 159 start-page: 139 year: 2000 end-page: 171 ident: b0215 article-title: Record breaking optimization results using the ruin and recreate principle publication-title: Journal of Computational Physics – volume: 47 start-page: 65 year: 1990 end-page: 74 ident: b0235 article-title: Some efficient heuristic methods for the flow-shop sequencing problem publication-title: European Journal of Operational Research – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: b0070 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics – volume: vol. 5252 start-page: 373 year: 2008 end-page: 404 ident: b0265 article-title: Quality assessment of Pareto set approximations publication-title: Multiobjective Optimization: Interactive and Evolutionary Approaches – reference: Kollat, J.B., Reed, P.M., 2005. The value of online adaptive search: a performance comparison of NSGAII, – volume: 165 start-page: 34 year: 2005 end-page: 54 ident: b0200 article-title: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics publication-title: European Journal of Operational Research – volume: 28 start-page: 392 year: 1998 end-page: 403 ident: b0075 article-title: A multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Transactions on Systems Man and Cybernetics – volume: 49 start-page: 255 year: 1997 end-page: 263 ident: b0150 article-title: An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs publication-title: International Journal of Production Economics – volume: 27 start-page: 804 year: 2006 end-page: 815 ident: b0160 article-title: A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs publication-title: The International Journal of Advanced Manufacturing Technology – volume: 187 start-page: 985 issue: 3 year: 2008 ident: 10.1016/j.ejor.2012.12.031_b0005 article-title: A survey of scheduling problems with setup times or costs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.060 – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.ejor.2012.12.031_b0040 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.996017 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.ejor.2012.12.031_b0070 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 3 start-page: 257 issue: 4 year: 1999 ident: 10.1016/j.ejor.2012.12.031_b0270 article-title: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.797969 – volume: 55 start-page: 1000 issue: 9 year: 2004 ident: 10.1016/j.ejor.2012.12.031_b0015 article-title: A partial enumeration heuristic for multi-objective flowshop scheduling problems publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601746 – volume: 20 start-page: 465 issue: 5 year: 2007 ident: 10.1016/j.ejor.2012.12.031_b0255 article-title: A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems publication-title: International journal of computer integrated manufacturing doi: 10.1080/09511920601160288 – volume: 5 start-page: 111 issue: 1 year: 2006 ident: 10.1016/j.ejor.2012.12.031_b0110 article-title: Hybrid population-based algorithms for the bi-objective quadratic assignment problem publication-title: Journal of Mathematical Modelling and Algorithms doi: 10.1007/s10852-005-9034-x – volume: 8 start-page: 475 issue: 5 year: 1997 ident: 10.1016/j.ejor.2012.12.031_b0155 article-title: A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs – a case study publication-title: Production Planning & Control doi: 10.1080/095372897235055 – volume: 187 start-page: 1143 issue: 3 year: 2008 ident: 10.1016/j.ejor.2012.12.031_b0210 article-title: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.07.029 – volume: 82 start-page: 540 issue: 3 year: 1995 ident: 10.1016/j.ejor.2012.12.031_b0165 article-title: Heuristics for scheduling in flowshop with multiple objectives publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)E0212-G – year: 2009 ident: 10.1016/j.ejor.2012.12.031_b0125 – volume: 1 start-page: 117 year: 1976 ident: 10.1016/j.ejor.2012.12.031_b0060 article-title: The complexity of flow shop and job shop scheduling publication-title: Mathematics of Operations Research doi: 10.1287/moor.1.2.117 – volume: 20 start-page: 451 issue: 3 year: 2008 ident: 10.1016/j.ejor.2012.12.031_b0115 article-title: A review and evaluation of multi-objective algorithms for the flowshop scheduling problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1070.0258 – volume: 167 start-page: 772 issue: 3 year: 2005 ident: 10.1016/j.ejor.2012.12.031_b0250 article-title: A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.020 – volume: 10 start-page: 463 issue: 5 year: 2004 ident: 10.1016/j.ejor.2012.12.031_b0010 article-title: An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem publication-title: Journal of Heuristics doi: 10.1023/B:HEUR.0000045320.79875.e3 – ident: 10.1016/j.ejor.2012.12.031_b0230 – volume: 42 start-page: 1129 issue: 7 year: 1995 ident: 10.1016/j.ejor.2012.12.031_b0085 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 – ident: 10.1016/j.ejor.2012.12.031_b0035 – volume: 7 start-page: 117 issue: 2 year: 2003 ident: 10.1016/j.ejor.2012.12.031_b0275 article-title: Performance assessment of multiobjective optimizers: an analysis and review publication-title: IEEE, Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810758 – ident: 10.1016/j.ejor.2012.12.031_b0095 – volume: 30 start-page: 787 issue: 18 year: 2008 ident: 10.1016/j.ejor.2012.12.031_b0050 article-title: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria publication-title: OR Spectrum doi: 10.1007/s00291-007-0098-z – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 10.1016/j.ejor.2012.12.031_b0240 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90182-M – ident: 10.1016/j.ejor.2012.12.031_b0025 – volume: 30 start-page: 957 issue: 4 year: 1996 ident: 10.1016/j.ejor.2012.12.031_b0135 article-title: Multi-objective genetic algorithm and its applications to flowshop scheduling publication-title: Computers & Industrial Engineering doi: 10.1016/0360-8352(96)00045-9 – volume: 5 start-page: 53 issue: 1 year: 1999 ident: 10.1016/j.ejor.2012.12.031_b0190 article-title: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times publication-title: Journal of Heuristics doi: 10.1023/A:1009691028143 – volume: 33 start-page: 281 issue: 1–2 year: 1997 ident: 10.1016/j.ejor.2012.12.031_b0170 article-title: A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(97)00093-4 – volume: 165 start-page: 34 issue: 1 year: 2005 ident: 10.1016/j.ejor.2012.12.031_b0200 article-title: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.01.022 – volume: 149 start-page: 513 issue: 3 year: 2003 ident: 10.1016/j.ejor.2012.12.031_b0175 article-title: Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00485-X – volume: 181 start-page: 195 issue: 1 year: 2007 ident: 10.1016/j.ejor.2012.12.031_b0065 article-title: On operators and search space topology in multi-objective flow shop scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.010 – ident: 10.1016/j.ejor.2012.12.031_b0090 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.ejor.2012.12.031_b0140 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: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.ejor.2012.12.031_b0205 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.009 – year: 2006 ident: 10.1016/j.ejor.2012.12.031_b0245 – volume: vol. 5252 start-page: 373 year: 2008 ident: 10.1016/j.ejor.2012.12.031_b0265 article-title: Quality assessment of Pareto set approximations – volume: 7 start-page: 204 issue: 2 year: 2003 ident: 10.1016/j.ejor.2012.12.031_b0080 article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810752 – volume: 29 start-page: 819 issue: 3 year: 2000 ident: 10.1016/j.ejor.2012.12.031_b0100 article-title: Solving multi-objective production scheduling problems with tabu search publication-title: Control and Cybernetics – volume: 28 start-page: 392 issue: 3 year: 1998 ident: 10.1016/j.ejor.2012.12.031_b0075 article-title: A multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Transactions on Systems Man and Cybernetics doi: 10.1109/5326.704576 – volume: 2 start-page: 221 issue: 3 year: 1994 ident: 10.1016/j.ejor.2012.12.031_b0225 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evolutionary Computation doi: 10.1162/evco.1994.2.3.221 – volume: 49 start-page: 255 issue: 3 year: 1997 ident: 10.1016/j.ejor.2012.12.031_b0150 article-title: An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(97)00017-0 – volume: 60 start-page: 810 issue: 6 year: 2009 ident: 10.1016/j.ejor.2012.12.031_b0260 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: vol. 230 start-page: 53 year: 2009 ident: 10.1016/j.ejor.2012.12.031_b0180 article-title: A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs – volume: 38 start-page: 778 issue: 7–8 year: 2007 ident: 10.1016/j.ejor.2012.12.031_b0145 article-title: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion publication-title: The International Journal of Advanced Manufacturing Technology – volume: 167 start-page: 717 issue: 3 year: 2005 ident: 10.1016/j.ejor.2012.12.031_b0020 article-title: Genetic local search for multi-objective flowshop scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.017 – volume: 161 start-page: 42 issue: 1 year: 2005 ident: 10.1016/j.ejor.2012.12.031_b0105 article-title: Solving multi-objective production scheduling problems using metaheuristics publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.08.029 – volume: 141 start-page: 559 issue: 3 year: 2002 ident: 10.1016/j.ejor.2012.12.031_b0055 article-title: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00278-8 – start-page: 283 year: 2001 ident: 10.1016/j.ejor.2012.12.031_b0030 article-title: PESA-II: Region-based selection in evolutionary multiobjective optimization – volume: 25 start-page: 351 issue: 5 year: 1998 ident: 10.1016/j.ejor.2012.12.031_b0185 article-title: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00079-8 – volume: 27 start-page: 804 issue: 7–8 year: 2006 ident: 10.1016/j.ejor.2012.12.031_b0160 article-title: A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-004-2249-6 – volume: 159 start-page: 139 year: 2000 ident: 10.1016/j.ejor.2012.12.031_b0215 article-title: Record breaking optimization results using the ruin and recreate principle publication-title: Journal of Computational Physics doi: 10.1006/jcph.1999.6413 – volume: vol. 1993 start-page: 213 year: 2001 ident: 10.1016/j.ejor.2012.12.031_b0045 article-title: Inferential performance assessment of stochastic optimisers and the attainment function – volume: 20 start-page: 215 issue: 2 year: 1992 ident: 10.1016/j.ejor.2012.12.031_b0220 article-title: Heuristics in flow shop scheduling with sequence dependent setup times publication-title: Omega-International Journal of Management Science doi: 10.1016/0305-0483(92)90075-I – volume: 38 start-page: 1521 issue: 11 year: 2011 ident: 10.1016/j.ejor.2012.12.031_b0120 article-title: Restarted iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.01.010 – volume: 7 start-page: 291 issue: 3 year: 2003 ident: 10.1016/j.ejor.2012.12.031_b0195 article-title: The flow shop scheduling polyhedron with setup times publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1027372722187 – volume: vol. 1993 start-page: 82 year: 2001 ident: 10.1016/j.ejor.2012.12.031_b0130 article-title: Specification of genetic search directions in cellular multi-objective genetic algorithms – volume: 47 start-page: 65 issue: 1 year: 1990 ident: 10.1016/j.ejor.2012.12.031_b0235 article-title: Some efficient heuristic methods for the flow-shop sequencing problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90090-X |
| SSID | ssj0001515 |
| Score | 2.4215577 |
| Snippet | ► We study the multi-objective PFSP with setup times problem. ► Review state of the art on the problem and propose a new benchmark and new algorithm. ►... The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as from multi-objective... |
| SourceID | proquest econis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 301 |
| SubjectTerms | Iterated greedy Iterative methods Job shops Mathematical problems Multi-objective Operations research Pareto optimum Permutation flowshop Production scheduling Scheduling Scheduling algorithms Sequence dependent setup times Studies |
| Title | Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study |
| URI | https://dx.doi.org/10.1016/j.ejor.2012.12.031 http://www.econis.eu/PPNSET?PPN=740893157 https://www.proquest.com/docview/1555638260 |
| Volume | 227 |
| WOSCitedRecordID | wos000315080300008&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fj9JAEN4gdzH64A_UHHqafTC-kF7abem2vpELFzUEjccZ3jbbdisl2CIUvP_Tf8jZ7m4paIg-mJCGbMsCna8zs7Mz8yH0WtAkTuQDaKcitLzIl_u7cWp5CaAlTWJuV2wNX0Z0PA6m0_BTq_XT1MJsFzTPg9vbcPlfRQ1jIGxZOvsP4q4nhQF4D0KHI4gdjn8l-Kqk1iqiuVJlPZMs3TN8tyUMlZulopWXfYu_bUzK4aL4sZ4VS1WuDg53jy--FqusnCkiDV5loK_ETGe973rT_im2r_1cGFiZiKNuLVSHoC8zvi1K5cCqpNRdKm4mE3C4itvDij4p6r2hTVZFvT9vIrXNnzdDFxWNRDN0UdfUXMONKDLeu74YNNSfS6lFiKrsvBBKPQeUWH6gGAiM_iaquYAGKmloY1d92W9WQgUs5hdiXsiWsA6pIsLaGu215B5_ZFc3oxGbDKeT_bPGBZC0bWHgvFl-tySVmdzy17wud9AJof0waKOTwfvh9EPtIEgfstrc0n9Q13KptMPD37TnL53KIEm23nOcDlyIyi-aPEIP9IIGDxQQH6OWyDvorqmn6KCHhjcEazPSQfcbTTCfoPwAsNgAFteAxRVgcQVY3AAsNoB9iwcY4IpruGKAK-Z4D664gutTdHM1nFy-szQLiBV7hJaWCG0epa5IfSocLxF-InfzHZ9wnlIw5cJ3OIdVCWiYkPiRNEI8dNI-p3FME8d1n6F2XuTiDGEnchOPpCJxPZghcjnlvk2564URScGadZFj7jWLdYt8ydSyYCYXcs6kfJiUD4MXyKeLevVnlqpBzNGrz5QI62upZ8OSwenTLuoboTLt_SqvlgFsj055bhDA9MO9ZrBK6INlJb79_PjpF-je7sk8R-1ytREv0Wm8LbP16pVG7i8nlNvT |
| 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=Multi-objective+sequence+dependent+setup+times+permutation+flowshop%3A+A+new+algorithm+and+a+comprehensive+study&rft.jtitle=European+journal+of+operational+research&rft.au=Ciavotta%2C+Michele&rft.au=Minella%2C+Gerardo&rft.au=Ruiz%2C+Rub%C3%A9n&rft.date=2013-06-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=227&rft.issue=2&rft.spage=301&rft_id=info:doi/10.1016%2Fj.ejor.2012.12.031&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3411972981 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |