A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
In this paper, we consider the problem of permutation flowshop scheduling with the objectives of minimizing the makespan and total flowtime of jobs, and present a Multi-Objective Simulated-annealing Algorithm (MOSA). Two initial sequences are obtained by using simple and fast existing heuristics, su...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 167; H. 3; S. 772 - 795 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.12.2005
Elsevier |
| Schriftenreihe: | European Journal of Operational Research |
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we consider the problem of permutation flowshop scheduling with the objectives of minimizing the makespan and total flowtime of jobs, and present a Multi-Objective Simulated-annealing Algorithm (MOSA). Two initial sequences are obtained by using simple and fast existing heuristics, supplemented by the implementation of three improvement schemes. Each of the two resultant sequences corresponds to a possible non-dominated solution containing the minimum value of one objective function. These sequences, taken one at a time, are given as the starting sequences to the MOSA. The MOSA seeks to obtain non-dominated solutions through the implementation of a simple probability function that attempts to generate solutions on the Pareto-optimal front. The probability function selects probabilistically a particular objective function, considering which the algorithm uncovers non-dominated solutions. Moreover, the probability function is varied in such a way that the entire objective-function space is covered uniformly so as to obtain as many non-dominated and well-dispersed solutions as possible. The parameters in the proposed MOSA are determined after conducting a pilot study. Two variants of the proposed algorithm, called MOSA-I and MOSA-II, with different parameter settings with respect to the temperature and epoch length, are considered in the performance evaluation of algorithms. In order to evaluate MOSA-I and MOSA-II, we have made use of 90 benchmark problems provided by Taillard [Eur. J. Operation. Res. 64 (1993) 278]. After an extensive literature survey, the following flowshop multi-objective scheduling algorithms have been identified as benchmark procedures: (a) MOGLS (Multi-Objective Genetic Local Search) by Ishibuchi and Murata [IEEE Trans. Syst., Man, Cybernet. C: Appl. Rev. 28 (1998) 392]; (b) Elitist Non-dominated sorting Genetic Algorithm (ENGA) by Bagchi [Multi-Objective Scheduling by Genetic Algorithms, Kluwer Academic Publishers, 1999]; (c) GPW (Gradual Priority Weighting) approach by Chang, Hsieh and Lin [Int. J. Prod. Econ. 79 (2002) 171]; and (d) a posteriori approach based heuristic by Framinan, Leisten and Ruiz-Usano [Eur. J. Operation. Res. 141 (2002) 559]. The non-dominated sets obtained from each of the existing benchmark algorithms and the proposed MOSA-I and MOSA-II are compared, and subsequently combined to obtain a net non-dominated front. It is found that most of the solutions in the net non-dominated front are yielded by MOSA-I and MOSA-II. In addition, it is noteworthy that both MOSA-I and MOSA-II require less computational effort than the MOGLS, ENGA and GPW. |
|---|---|
| AbstractList | In this paper, we consider the problem of permutation flowshop scheduling with the objectives of minimizing the makespan and total flowtime of jobs, and present a Multi-Objective Simulated-annealing Algorithm (MOSA). Two initial sequences are obtained by using simple and fast existing heuristics, supplemented by the implementation of three improvement schemes. Each of the two resultant sequences corresponds to a possible non-dominated solution containing the minimum value of one objective function. These sequences, taken one at a time, are given as the starting sequences to the MOSA. The MOSA seeks to obtain non-dominated solutions through the implementation of a simple probability function that attempts to generate solutions on the Pareto-optimal front. The probability function selects probabilistically a particular objective function, considering which the algorithm uncovers non-dominated solutions. Moreover, the probability function is varied in such a way that the entire objective-function space is covered uniformly so as to obtain as many non-dominated and well-dispersed solutions as possible. The parameters in the proposed MOSA are determined after conducting a pilot study. Two variants of the proposed algorithm, called MOSA-I and MOSA-II, with different parameter settings with respect to the temperature and epoch length, are considered in the performance evaluation of algorithms. In order to evaluate MOSA-I and MOSA-II, we have made use of 90 benchmark problems provided by Taillard [Eur. J. Operation. Res. 64 (1993) 278]. After an extensive literature survey, the following flowshop multi-objective scheduling algorithms have been identified as benchmark procedures: (a) MOGLS (Multi-Objective Genetic Local Search) by Ishibuchi and Murata [IEEE Trans. Syst., Man, Cybernet. C: Appl. Rev. 28 (1998) 392]; (b) Elitist Non-dominated sorting Genetic Algorithm (ENGA) by Bagchi [Multi-Objective Scheduling by Genetic Algorithms, Kluwer Academic Publishers, 1999]; (c) GPW (Gradual Priority Weighting) approach by Chang, Hsieh and Lin [Int. J. Prod. Econ. 79 (2002) 171]; and (d) a posteriori approach based heuristic by Framinan, Leisten and Ruiz-Usano [Eur. J. Operation. Res. 141 (2002) 559]. The non-dominated sets obtained from each of the existing benchmark algorithms and the proposed MOSA-I and MOSA-II are compared, and subsequently combined to obtain a net non-dominated front. It is found that most of the solutions in the net non-dominated front are yielded by MOSA-I and MOSA-II. In addition, it is noteworthy that both MOSA-I and MOSA-II require less computational effort than the MOGLS, ENGA and GPW. |
| Author | Varadharajan, T.K. Rajendran, Chandrasekharan |
| Author_xml | – sequence: 1 givenname: T.K. surname: Varadharajan fullname: Varadharajan, T.K. – sequence: 2 givenname: Chandrasekharan surname: Rajendran fullname: Rajendran, Chandrasekharan email: craj@iitm.ac.in |
| BackLink | http://econpapers.repec.org/article/eeeejores/v_3a167_3ay_3a2005_3ai_3a3_3ap_3a772-795.htm$$DView record in RePEc |
| BookMark | eNp9Uctu1TAQtVCRuC38ACv_QIIfSWwkNlXFS1RiA2vLsSfNhMSObPeisuHX8e2FDYtaOh5pZs7R6JxLchFiAEJec9Zyxoc3SwtLTK1grGuZaplgz8iBayWaQQ_sghyYVKoRgqsX5DLnhTHGe94fyO9rut2vBZs4LuAKHoFmrB1bwDc2BLArhjtq17uYsMwbnWKi2c3g7x8HGOi0xp95jnumJdINA274C2iZgW72B-TdBmqDr8Ni18flghvQONEljvkleT7ZNcOrv_WKfP_w_tvNp-b268fPN9e3jetkV5peM9310-jU2GuvYdCeeSe6HrSQVjPpO9V7GJhWnHXjNA3aSRACYPByUiCvyJezboIdnNkTbjY9GKivGgfZHI20fFD1f6ioRva1YIWs2CuUEka97c1ctqqmz2ouxZwTTMZhsQVjKMniajgzp1jMYk7q5hSLYcrUWCpV_Ef9d8uTpHdnElSLjgjJZIcQHHhMNTXjIz5F_wMRkquy |
| CitedBy_id | crossref_primary_10_1016_j_advengsoft_2011_05_015 crossref_primary_10_1016_j_knosys_2020_106556 crossref_primary_10_1080_21681015_2017_1383313 crossref_primary_10_1080_24725854_2019_1647478 crossref_primary_10_1016_j_omega_2013_07_004 crossref_primary_10_1007_s10845_015_1129_2 crossref_primary_10_1016_j_enconman_2021_114730 crossref_primary_10_1016_j_asoc_2018_07_011 crossref_primary_10_1061__ASCE_CP_1943_5487_0000639 crossref_primary_10_1287_ijoc_1070_0258 crossref_primary_10_1109_TED_2016_2605091 crossref_primary_10_1016_j_jclepro_2015_06_002 crossref_primary_10_1007_s10479_013_1517_y crossref_primary_10_1016_j_cor_2011_01_010 crossref_primary_10_1016_j_ijpe_2007_03_018 crossref_primary_10_1016_j_trb_2021_10_007 crossref_primary_10_1016_j_ijheatmasstransfer_2019_118469 crossref_primary_10_1016_j_ejor_2019_11_024 crossref_primary_10_1007_s00170_008_1771_3 crossref_primary_10_1016_j_engappai_2022_104854 crossref_primary_10_1155_2020_2862186 crossref_primary_10_1016_j_ejor_2021_03_069 crossref_primary_10_1007_s11831_020_09491_5 crossref_primary_10_1038_s41598_024_54991_0 crossref_primary_10_1007_s10696_018_9310_5 crossref_primary_10_1016_j_eswa_2010_11_022 crossref_primary_10_1016_j_cor_2010_10_008 crossref_primary_10_1016_j_cor_2012_05_018 crossref_primary_10_1016_j_ress_2022_108652 crossref_primary_10_1016_j_energy_2013_06_039 crossref_primary_10_1007_s00500_010_0673_0 crossref_primary_10_1080_23302674_2025_2456212 crossref_primary_10_1155_2020_8846250 crossref_primary_10_4018_IJAEC_2017040104 crossref_primary_10_1007_s00170_009_2475_z crossref_primary_10_1080_09511920601160288 crossref_primary_10_1080_00207540701500486 crossref_primary_10_1016_j_cie_2018_06_017 crossref_primary_10_1016_j_ejor_2009_02_014 crossref_primary_10_1016_j_procs_2013_05_259 crossref_primary_10_1007_s00170_011_3620_z crossref_primary_10_1016_j_cor_2006_07_013 crossref_primary_10_1186_2251_712X_8_3 crossref_primary_10_1016_j_cor_2011_08_009 crossref_primary_10_1016_j_jmsy_2014_09_006 crossref_primary_10_1016_j_applthermaleng_2015_06_050 crossref_primary_10_1016_j_asoc_2025_112729 crossref_primary_10_1016_j_cor_2013_11_019 crossref_primary_10_1016_j_cor_2012_03_010 crossref_primary_10_1007_s00291_007_0098_z crossref_primary_10_1016_j_est_2022_104453 crossref_primary_10_1016_j_simpat_2010_01_015 crossref_primary_10_3233_IA_160097 crossref_primary_10_1007_s00170_011_3650_6 crossref_primary_10_1016_j_applthermaleng_2024_123106 crossref_primary_10_3934_jimo_2025075 crossref_primary_10_1016_j_asoc_2016_11_031 crossref_primary_10_1016_j_cor_2009_04_018 crossref_primary_10_1016_j_jcde_2017_08_001 crossref_primary_10_1177_1548512909348233 crossref_primary_10_1016_j_ejor_2023_11_013 crossref_primary_10_1080_17509653_2011_10671153 crossref_primary_10_1016_j_ejor_2012_12_031 crossref_primary_10_1016_j_ijnaoe_2025_100675 crossref_primary_10_1016_j_applthermaleng_2016_11_059 crossref_primary_10_4018_jaec_2012040103 crossref_primary_10_1080_10426914_2014_984209 crossref_primary_10_1007_s00170_010_3094_4 crossref_primary_10_1016_j_cor_2008_10_008 crossref_primary_10_1080_00207543_2010_543937 crossref_primary_10_1007_s10845_008_0088_2 crossref_primary_10_1007_s00158_023_03639_0 crossref_primary_10_1007_s00170_012_4031_5 crossref_primary_10_1007_s12351_012_0125_y crossref_primary_10_1016_j_eswa_2009_06_105 crossref_primary_10_1016_j_engappai_2023_107116 crossref_primary_10_3390_math10142395 crossref_primary_10_1016_j_engappai_2012_06_011 crossref_primary_10_1016_j_jmsy_2014_06_009 crossref_primary_10_1016_j_asoc_2017_02_003 crossref_primary_10_1007_s00170_013_5267_4 crossref_primary_10_1016_j_seps_2025_102271 crossref_primary_10_1007_s00170_010_3100_x crossref_primary_10_1080_00207543_2018_1468095 crossref_primary_10_1007_s40305_017_0165_3 crossref_primary_10_1007_s00521_020_05174_1 crossref_primary_10_1002_hfm_21046 crossref_primary_10_1016_j_asoc_2014_02_019 crossref_primary_10_1088_1757_899X_377_1_012192 crossref_primary_10_1155_2014_872526 crossref_primary_10_1007_s00170_008_1770_4 crossref_primary_10_1057_jors_2012_61 crossref_primary_10_1007_s00170_013_5252_y crossref_primary_10_1016_j_cor_2016_10_003 crossref_primary_10_3390_pr10091786 crossref_primary_10_1016_j_jclepro_2020_122927 crossref_primary_10_1007_s00607_018_00693_1 crossref_primary_10_1080_00207160701331376 |
| Cites_doi | 10.1016/0305-0483(83)90088-9 10.1051/ro:2001109 10.1016/S0305-0548(97)00050-6 10.1016/0377-2217(93)E0353-Y 10.1016/0925-5273(93)90024-F 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H 10.15807/jorsj.23.118 10.1109/5326.704576 10.1287/mnsc.16.10.B630 10.1057/jors.1995.102 10.1016/0377-2217(95)00347-9 10.1016/S0377-2217(01)00278-8 10.1016/S0377-2217(02)00908-6 10.1162/evco.1994.2.3.221 10.1016/S0925-5273(02)00141-X 10.1016/0360-8352(94)90337-9 10.1016/0377-2217(93)E0212-G 10.1080/03052150008940911 10.1016/0377-2217(93)E0235-P 10.1287/opre.13.3.400 10.1016/S0377-2217(97)00136-7 10.1016/0377-2217(93)90182-M 10.1016/S0377-2217(00)00137-5 10.1002/nav.3800010110 10.1016/S0360-8352(97)00139-3 10.1080/09537289608930365 10.15807/jorsj.21.287 10.1023/A:1009670112978 10.1016/0377-2217(89)90383-4 10.1080/00207547808930015 10.1016/0360-8352(96)00045-9 |
| ContentType | Journal Article |
| Copyright | 2004 Elsevier B.V. |
| Copyright_xml | – notice: 2004 Elsevier B.V. |
| DBID | AAYXX CITATION DKI X2L |
| DOI | 10.1016/j.ejor.2004.07.020 |
| DatabaseName | CrossRef RePEc IDEAS RePEc |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 795 |
| ExternalDocumentID | eeeejores_v_3a167_3ay_3a2005_3ai_3a3_3ap_3a772_795_htm 10_1016_j_ejor_2004_07_020 S0377221704004771 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L |
| ID | FETCH-LOGICAL-c434t-580845fbc7b58d8e68d0dc245e823a803d475de6087104bff68c3e22ee6d3f7e3 |
| ISICitedReferencesCount | 132 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000231298300011&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 | Wed Aug 18 03:50:57 EDT 2021 Sat Nov 29 01:40:42 EST 2025 Tue Nov 18 21:24:20 EST 2025 Fri Feb 23 02:32:20 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Multiple objectives Makespan Total flowtime Flowshop scheduling Simulated annealing |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c434t-580845fbc7b58d8e68d0dc245e823a803d475de6087104bff68c3e22ee6d3f7e3 |
| PageCount | 24 |
| ParticipantIDs | repec_primary_eeeejores_v_3a167_3ay_3a2005_3ai_3a3_3ap_3a772_795_htm crossref_citationtrail_10_1016_j_ejor_2004_07_020 crossref_primary_10_1016_j_ejor_2004_07_020 elsevier_sciencedirect_doi_10_1016_j_ejor_2004_07_020 |
| PublicationCentury | 2000 |
| PublicationDate | 2005-12-16 |
| PublicationDateYYYYMMDD | 2005-12-16 |
| PublicationDate_xml | – month: 12 year: 2005 text: 2005-12-16 day: 16 |
| PublicationDecade | 2000 |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2005 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Ben-Daya, Al-Fawzan (bib2) 1998; 109 Rajendran (bib21) 1993; 29 Framinan, Leisten, Ruiz-Usano (bib6) 2002; 141 Woo, Yim (bib32) 1998; 25 Murata, Ishibuchi, Tanaka (bib17) 1996; 130 Campbell, Dudek, Smith (bib3) 1970; 16 Johnson (bib13) 1954; 1 Miyazaki, Nishiyama, Hashimoto (bib16) 1978; 21 Tuyttens, Teghem, Fortemps, Nieuwenhuyze (bib29) 2000; 6 Nawaz, Enscore, Ham (bib19) 1983; 11 Miyazaki, Nishiyama (bib15) 1980; 23 Ho (bib9) 1995; 81 Liu, Reeves (bib14) 2001; 132 Parthasarathy, Rajendran (bib20) 1998; 34 Ignall, Schrage (bib10) 1965; 13 Gelders, Sambandam (bib8) 1978; 16 Sridhar, Rajendran (bib24) 1996; 7 Taillard (bib27) 1993; 64 Chang, Hsieh, Lin (bib4) 2002; 79 Ishibuchi, Murata (bib12) 1998; 28 Bagchi (bib1) 1999 Ishibushi, Misaki, Tanaka (bib11) 1995; 81 Nagar, Heragu, Haddock (bib18) 1995; 46 Daniels, Chambers (bib5) 1990; 37 Rajendran (bib22) 1995; 82 Rajendran, Ziegler (bib23) 2004; 155 Srinivas, Deb (bib25) 1995; 2 T’kindt, Billaut (bib28) 2001; 35 Wang, Chu, Proth (bib30) 1997; 96 Widmer, Hertz (bib31) 1989; 41 Gangadharan, Rajendran (bib7) 1994; 27 Suppapitnarm, Seffen, Parks, Clarkson (bib26) 2000; 33 Miyazaki (10.1016/j.ejor.2004.07.020_bib16) 1978; 21 Taillard (10.1016/j.ejor.2004.07.020_bib27) 1993; 64 Framinan (10.1016/j.ejor.2004.07.020_bib6) 2002; 141 Tuyttens (10.1016/j.ejor.2004.07.020_bib29) 2000; 6 Ben-Daya (10.1016/j.ejor.2004.07.020_bib2) 1998; 109 Srinivas (10.1016/j.ejor.2004.07.020_bib25) 1995; 2 Daniels (10.1016/j.ejor.2004.07.020_bib5) 1990; 37 Ishibushi (10.1016/j.ejor.2004.07.020_bib11) 1995; 81 Sridhar (10.1016/j.ejor.2004.07.020_bib24) 1996; 7 Murata (10.1016/j.ejor.2004.07.020_bib17) 1996; 130 Nawaz (10.1016/j.ejor.2004.07.020_bib19) 1983; 11 Widmer (10.1016/j.ejor.2004.07.020_bib31) 1989; 41 Johnson (10.1016/j.ejor.2004.07.020_bib13) 1954; 1 Nagar (10.1016/j.ejor.2004.07.020_bib18) 1995; 46 Rajendran (10.1016/j.ejor.2004.07.020_bib22) 1995; 82 T’kindt (10.1016/j.ejor.2004.07.020_bib28) 2001; 35 Gangadharan (10.1016/j.ejor.2004.07.020_bib7) 1994; 27 Rajendran (10.1016/j.ejor.2004.07.020_bib23) 2004; 155 Gelders (10.1016/j.ejor.2004.07.020_bib8) 1978; 16 Campbell (10.1016/j.ejor.2004.07.020_bib3) 1970; 16 Suppapitnarm (10.1016/j.ejor.2004.07.020_bib26) 2000; 33 Woo (10.1016/j.ejor.2004.07.020_bib32) 1998; 25 Ignall (10.1016/j.ejor.2004.07.020_bib10) 1965; 13 Chang (10.1016/j.ejor.2004.07.020_bib4) 2002; 79 Bagchi (10.1016/j.ejor.2004.07.020_bib1) 1999 Parthasarathy (10.1016/j.ejor.2004.07.020_bib20) 1998; 34 Ishibuchi (10.1016/j.ejor.2004.07.020_bib12) 1998; 28 Liu (10.1016/j.ejor.2004.07.020_bib14) 2001; 132 Miyazaki (10.1016/j.ejor.2004.07.020_bib15) 1980; 23 Wang (10.1016/j.ejor.2004.07.020_bib30) 1997; 96 Rajendran (10.1016/j.ejor.2004.07.020_bib21) 1993; 29 Ho (10.1016/j.ejor.2004.07.020_bib9) 1995; 81 |
| References_xml | – volume: 141 start-page: 559 year: 2002 end-page: 569 ident: bib6 article-title: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation publication-title: European Journal of Operational Research – volume: 23 start-page: 118 year: 1980 end-page: 132 ident: bib15 article-title: Analysis for minimizing weighted mean flowtime in flowshop scheduling publication-title: Journal of the Operations Research Society of Japan – volume: 2 start-page: 221 year: 1995 end-page: 248 ident: bib25 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evolutionary Computation – volume: 6 start-page: 295 year: 2000 end-page: 310 ident: bib29 article-title: Performance of the MOSA method for the bicriteria assignment problem publication-title: Journal of Heuristics – volume: 28 start-page: 392 year: 1998 end-page: 403 ident: bib12 article-title: A multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews – volume: 13 start-page: 400 year: 1965 end-page: 412 ident: bib10 article-title: Application of the branch-and-bound technique to some scheduling problems publication-title: Operations Research – volume: 46 start-page: 721 year: 1995 end-page: 734 ident: bib18 article-title: A branch and bound approach for a two-machine flowshop scheduling problem publication-title: Journal of the Operational Research Society – volume: 130 start-page: 957 year: 1996 end-page: 968 ident: bib17 article-title: Multi-objective genetic algorithm and its applications to flowshop scheduling publication-title: Computers & Industrial Engineering – volume: 27 start-page: 473 year: 1994 end-page: 476 ident: bib7 article-title: A simulated annealing heuristic for scheduling in a flowshop with bicriteria publication-title: Computers & Industrial Engineering – volume: 82 start-page: 540 year: 1995 end-page: 555 ident: bib22 article-title: Heuristics for scheduling in flowshop with multiple objectives publication-title: European Journal of Operational Research – volume: 34 start-page: 531 year: 1998 end-page: 546 ident: bib20 article-title: Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline based manufacturing cell publication-title: Computers & Industrial Engineering – volume: 29 start-page: 65 year: 1993 end-page: 73 ident: bib21 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flowtime publication-title: International Journal of Production Economics – volume: 81 start-page: 571 year: 1995 end-page: 578 ident: bib9 article-title: Flowshop sequencing with mean flow time objective publication-title: European Journal of Operational Research – volume: 41 start-page: 186 year: 1989 end-page: 193 ident: bib31 article-title: A new heuristic method for the flowshop sequencing problem publication-title: European Journal of Operational Research – volume: 79 start-page: 171 year: 2002 end-page: 183 ident: bib4 article-title: The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem publication-title: International Journal of Production Economics – volume: 7 start-page: 374 year: 1996 end-page: 382 ident: bib24 article-title: Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach publication-title: Production Planning & Control – volume: 155 start-page: 426 year: 2004 end-page: 438 ident: bib23 article-title: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs publication-title: European Journal of Operational Research – volume: 16 start-page: B630 year: 1970 end-page: B637 ident: bib3 article-title: A heuristic algorithm for the publication-title: Management Science – volume: 21 start-page: 287 year: 1978 end-page: 299 ident: bib16 article-title: An adjacent pairwise approach to the mean flowtime scheduling problem publication-title: Journal of the Operations Research Society of Japan – volume: 35 start-page: 143 year: 2001 end-page: 163 ident: bib28 article-title: Multicriteria scheduling problems: A survey publication-title: RAIRO Operations Research – year: 1999 ident: bib1 article-title: Multiobjective Scheduling by Genetic Algorithms – volume: 33 start-page: 59 year: 2000 end-page: 85 ident: bib26 article-title: A simulated annealing algorithm for multiobjective optimization publication-title: Engineering Optimization – volume: 37 start-page: 981 year: 1990 end-page: 995 ident: bib5 article-title: Multiobjective flowshop scheduling publication-title: Naval Research Logistics Quarterly – volume: 81 start-page: 388 year: 1995 end-page: 398 ident: bib11 article-title: Modified simulated annealing algorithms for the flowshop sequencing problems publication-title: European Journal of Operational Research – volume: 96 start-page: 636 year: 1997 end-page: 644 ident: bib30 article-title: Heuristic approaches for publication-title: European Journal of Operational Research – volume: 132 start-page: 439 year: 2001 end-page: 452 ident: bib14 article-title: Constructive and composite heuristic solutions to the publication-title: European Journal of Operational Research – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: bib13 article-title: Optimal two and three-stage production schedules with set-up times included publication-title: Naval Research Logistics Quarterly – volume: 16 start-page: 221 year: 1978 end-page: 231 ident: bib8 article-title: Four simple heuristics for scheduling a flowshop publication-title: International Journal of Production Research – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib19 article-title: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem publication-title: OMEGA – volume: 25 start-page: 175 year: 1998 end-page: 182 ident: bib32 article-title: A heuristic algorithm for mean flowtime objective in flowshop scheduling publication-title: Computers & Operations Research – volume: 109 start-page: 88 year: 1998 end-page: 95 ident: bib2 article-title: A tabu search approach for the flowshop scheduling problem publication-title: European Journal of Operational Research – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib27 article-title: Benchmark for basic scheduling problems publication-title: European Journal of Operational Research – volume: 11 start-page: 91 year: 1983 ident: 10.1016/j.ejor.2004.07.020_bib19 article-title: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem publication-title: OMEGA doi: 10.1016/0305-0483(83)90088-9 – volume: 35 start-page: 143 year: 2001 ident: 10.1016/j.ejor.2004.07.020_bib28 article-title: Multicriteria scheduling problems: A survey publication-title: RAIRO Operations Research doi: 10.1051/ro:2001109 – volume: 25 start-page: 175 year: 1998 ident: 10.1016/j.ejor.2004.07.020_bib32 article-title: A heuristic algorithm for mean flowtime objective in flowshop scheduling publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00050-6 – volume: 81 start-page: 571 year: 1995 ident: 10.1016/j.ejor.2004.07.020_bib9 article-title: Flowshop sequencing with mean flow time objective publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)E0353-Y – volume: 29 start-page: 65 year: 1993 ident: 10.1016/j.ejor.2004.07.020_bib21 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flowtime publication-title: International Journal of Production Economics doi: 10.1016/0925-5273(93)90024-F – volume: 37 start-page: 981 year: 1990 ident: 10.1016/j.ejor.2004.07.020_bib5 article-title: Multiobjective flowshop scheduling publication-title: Naval Research Logistics Quarterly doi: 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H – volume: 23 start-page: 118 year: 1980 ident: 10.1016/j.ejor.2004.07.020_bib15 article-title: Analysis for minimizing weighted mean flowtime in flowshop scheduling publication-title: Journal of the Operations Research Society of Japan doi: 10.15807/jorsj.23.118 – volume: 28 start-page: 392 year: 1998 ident: 10.1016/j.ejor.2004.07.020_bib12 article-title: A multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews doi: 10.1109/5326.704576 – volume: 16 start-page: B630 year: 1970 ident: 10.1016/j.ejor.2004.07.020_bib3 article-title: A heuristic algorithm for the n-job, m-machine sequencing problem publication-title: Management Science doi: 10.1287/mnsc.16.10.B630 – volume: 46 start-page: 721 year: 1995 ident: 10.1016/j.ejor.2004.07.020_bib18 article-title: A branch and bound approach for a two-machine flowshop scheduling problem publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1995.102 – volume: 96 start-page: 636 year: 1997 ident: 10.1016/j.ejor.2004.07.020_bib30 article-title: Heuristic approaches for n/m/F/∑Ci scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00347-9 – volume: 141 start-page: 559 year: 2002 ident: 10.1016/j.ejor.2004.07.020_bib6 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 – volume: 155 start-page: 426 year: 2004 ident: 10.1016/j.ejor.2004.07.020_bib23 article-title: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00908-6 – volume: 2 start-page: 221 year: 1995 ident: 10.1016/j.ejor.2004.07.020_bib25 article-title: Multiobjective optimization using nondominated sorting in genetic algorithms publication-title: Evolutionary Computation doi: 10.1162/evco.1994.2.3.221 – volume: 79 start-page: 171 year: 2002 ident: 10.1016/j.ejor.2004.07.020_bib4 article-title: The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(02)00141-X – volume: 27 start-page: 473 year: 1994 ident: 10.1016/j.ejor.2004.07.020_bib7 article-title: A simulated annealing heuristic for scheduling in a flowshop with bicriteria publication-title: Computers & Industrial Engineering doi: 10.1016/0360-8352(94)90337-9 – volume: 82 start-page: 540 year: 1995 ident: 10.1016/j.ejor.2004.07.020_bib22 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 – volume: 33 start-page: 59 year: 2000 ident: 10.1016/j.ejor.2004.07.020_bib26 article-title: A simulated annealing algorithm for multiobjective optimization publication-title: Engineering Optimization doi: 10.1080/03052150008940911 – volume: 81 start-page: 388 year: 1995 ident: 10.1016/j.ejor.2004.07.020_bib11 article-title: Modified simulated annealing algorithms for the flowshop sequencing problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)E0235-P – volume: 13 start-page: 400 year: 1965 ident: 10.1016/j.ejor.2004.07.020_bib10 article-title: Application of the branch-and-bound technique to some scheduling problems publication-title: Operations Research doi: 10.1287/opre.13.3.400 – volume: 109 start-page: 88 year: 1998 ident: 10.1016/j.ejor.2004.07.020_bib2 article-title: A tabu search approach for the flowshop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00136-7 – volume: 64 start-page: 278 year: 1993 ident: 10.1016/j.ejor.2004.07.020_bib27 article-title: Benchmark for basic scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90182-M – volume: 132 start-page: 439 year: 2001 ident: 10.1016/j.ejor.2004.07.020_bib14 article-title: Constructive and composite heuristic solutions to the P//∑Ci scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00137-5 – volume: 1 start-page: 61 year: 1954 ident: 10.1016/j.ejor.2004.07.020_bib13 article-title: Optimal two and three-stage production schedules with set-up times included publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010110 – volume: 34 start-page: 531 year: 1998 ident: 10.1016/j.ejor.2004.07.020_bib20 article-title: Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline based manufacturing cell publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(97)00139-3 – volume: 7 start-page: 374 year: 1996 ident: 10.1016/j.ejor.2004.07.020_bib24 article-title: Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach publication-title: Production Planning & Control doi: 10.1080/09537289608930365 – volume: 21 start-page: 287 year: 1978 ident: 10.1016/j.ejor.2004.07.020_bib16 article-title: An adjacent pairwise approach to the mean flowtime scheduling problem publication-title: Journal of the Operations Research Society of Japan doi: 10.15807/jorsj.21.287 – volume: 6 start-page: 295 year: 2000 ident: 10.1016/j.ejor.2004.07.020_bib29 article-title: Performance of the MOSA method for the bicriteria assignment problem publication-title: Journal of Heuristics doi: 10.1023/A:1009670112978 – volume: 41 start-page: 186 year: 1989 ident: 10.1016/j.ejor.2004.07.020_bib31 article-title: A new heuristic method for the flowshop sequencing problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(89)90383-4 – year: 1999 ident: 10.1016/j.ejor.2004.07.020_bib1 – volume: 16 start-page: 221 year: 1978 ident: 10.1016/j.ejor.2004.07.020_bib8 article-title: Four simple heuristics for scheduling a flowshop publication-title: International Journal of Production Research doi: 10.1080/00207547808930015 – volume: 130 start-page: 957 year: 1996 ident: 10.1016/j.ejor.2004.07.020_bib17 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 |
| SSID | ssj0001515 |
| Score | 2.2339864 |
| Snippet | In this paper, we consider the problem of permutation flowshop scheduling with the objectives of minimizing the makespan and total flowtime of jobs, and... |
| SourceID | repec crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 772 |
| SubjectTerms | Flowshop scheduling Makespan Multiple objectives Simulated annealing Total flowtime |
| Title | A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs |
| URI | https://dx.doi.org/10.1016/j.ejor.2004.07.020 http://econpapers.repec.org/article/eeeejores/v_3a167_3ay_3a2005_3ai_3a3_3ap_3a772-795.htm |
| Volume | 167 |
| WOSCitedRecordID | wos000231298300011&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/eLvHCXMwtV1Lj9MwELZKixAceBQQy0s-cFulysZO7BwrWMRLKw7LqrcoiR2abJtUSSgLF_4Nv5NxbKel0BV7oJKdyHLctPONZ2zPA6EX0k9cCeqQQ1KXOSrOpBODWHYy0A0yFqQu6QJpn31gJyd8Ngs_DgY_rS_MesHKkl9chKv_SmpoA2Ir19krkLsfFBrgHogONZAd6n8i_FQbCTpVUujJ7LDJlypJlxRODLNq3Dmgx4vPVZ2382VnZwhLXBA5C-Pfki2qr828WnXBH1TskWX-XXYa6jI-lzAFaQPmtlKOlKqzSlCvtM6iSpq9W_1G7YWG2m5AmkhD_Y70WVzHQkWQLkzS5Mn7yeYgqpClqGNrJKDuG3muepe_bV34ygxEe1Zaly3GHM_Tzpv9dKzTcxjcka3JlekkP0ZOM52c8w8RoHcjioksqi7eK-2Cs3ruRuDZQ_4dOdhbJ1rDtyJSY6hEnTRyWQRjXEMjj_khH6LR9O3x7F0v85Va2J1XmR9k3LO0JeHum-xTgUa1XMl0S705vYtum3UJnmo83UMDWY7RDesWMUZ3bPoPbKTBGN3aimV5H_2Y4h3c4b_gDve4w4A7vMEdzkvc4w63Fba4w4A7bHGHgey4wx22uMNVhhXuHqBPr49PX75xTHYPJ6WEto7PXU79LElZ4nPBZcCFK1KP-pJ7JOYuEZT5QgYuLOldmmRZwFMiPU_KQJCMSfIQDcuqlI8QDoSgR1QdMAcphdFDEYQ0SzMeeiDsM_8AHdk_PEpN6HuVgWUR7Sf1ATrsn1npwC-X9vYtHSOjumqVNAJYXvrcq47o_VdI-EAf2UTriMTAC1B_g6LYBy45FAJlBQXYIQImiObt8vGVXvYJurnhxqdo2NZf5DN0PV23eVM_N9D-Be612CA |
| 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=A+multi-objective+simulated-annealing+algorithm+for+scheduling+in+flowshops+to+minimize+the+makespan+and+total+flowtime+of+jobs&rft.jtitle=European+journal+of+operational+research&rft.au=Varadharajan%2C+T.K.&rft.au=Rajendran%2C+Chandrasekharan&rft.date=2005-12-16&rft.issn=0377-2217&rft.volume=167&rft.issue=3&rft.spage=772&rft.epage=795&rft_id=info:doi/10.1016%2Fj.ejor.2004.07.020&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2004_07_020 |
| 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 |