A beam-search-based constructive heuristic for the PFSP to minimise total flowtime

In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed in the literature. The proposed algorithm is inspired...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 81; S. 167 - 177
Hauptverfasser:	Fernandez-Viagas, Victor, Framinan, Jose M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.05.2017 Pergamon Press Inc
Schlagworte:	Algorithms Beam search Flowshop Flowtime Heuristic Heuristics Job shops PFSP Scheduling Scheduling algorithms Studies Total completion time Heuristics PFSP Beam search Scheduling Flowshop Flowtime Total completion time
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed in the literature. The proposed algorithm is inspired in the logic of the beam search, although it remains a fast constructive heuristic. The results obtained by the proposed algorithm outperform those obtained by other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In addition, the proposed algorithm even outperforms two of the best metaheuristics for many instances of the problem, using much lesser computation effort. The excellent performance of the proposal is also proved by the fact that the new heuristic found new best upper bounds for 35 of the 120 instances in Taillard’s benchmark.
AbstractList	In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed in the literature. The proposed algorithm is inspired in the logic of the beam search, although it remains a fast constructive heuristic. The results obtained by the proposed algorithm outperform those obtained by other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In addition, the proposed algorithm even outperforms two of the best metaheuristics for many instances of the problem, using much lesser computation effort. The excellent performance of the proposal is also proved by the fact that the new heuristic found new best upper bounds for 35 of the 120 instances in Taillard's benchmark. In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as objective. This well-known problem is NP-hard, and several heuristics have been developed in the literature. The proposed algorithm is inspired in the logic of the beam search, although it remains a fast constructive heuristic. The results obtained by the proposed algorithm outperform those obtained by other constructive heuristics in the literature for the problem, thus modifying substantially the state-of-the-art of efficient approximate procedures for the problem. In addition, the proposed algorithm even outperforms two of the best metaheuristics for many instances of the problem, using much lesser computation effort. The excellent performance of the proposal is also proved by the fact that the new heuristic found new best upper bounds for 35 of the 120 instances in Taillard’s benchmark.
Author	Fernandez-Viagas, Victor Framinan, Jose M.
Author_xml	– sequence: 1 givenname: Victor orcidid: 0000-0001-8498-8885 surname: Fernandez-Viagas fullname: Fernandez-Viagas, Victor email: vfernandezviagas@us.es – sequence: 2 givenname: Jose M. surname: Framinan fullname: Framinan, Jose M. email: framinan@us.es
BookMark	eNp9kE9LAzEQxYNUsK1-AG8Bz7sm2c1mF0-lWBUEi3_AW8gmszSlu6lJWvHbm1JPHjqXeYf3m-G9CRoNbgCErinJKaHV7TrXzucsyZyynDByhsa0FkUmKv45QmNSEJ4RXtYXaBLCmqQRjI7R6wy3oPosgPJ6lbUqgMHaDSH6nY52D3gFO29DtBp3zuO4ArxcvC1xdLi3g-1tgKSj2uBu476j7eESnXdqE-Dqb0_Rx-L-ff6YPb88PM1nz5kuaRUzEIwZ3vGmaIXQZd0pYkyrO2CctxXjUJNKN8bwkhRKiYKzumkaU5cVq1QyF1N0c7y79e5rByHKtdv5Ib2UKXkteFnVZXLRo0t7F4KHTm697ZX_kZTIQ3VyLVN18lCdpEym6hIj_jHaRhWtG6JXdnOSvDuSkILvLXgZtIVBg7EedJTG2RP0L1Fkir0
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1007_s10696_025_09606_9 crossref_primary_10_1016_j_cie_2021_107843 crossref_primary_10_1016_j_eswa_2020_113462 crossref_primary_10_1016_j_swevo_2019_02_007 crossref_primary_10_1080_01605682_2019_1671149 crossref_primary_10_1155_2018_1973604 crossref_primary_10_1016_j_cie_2020_106369 crossref_primary_10_1016_j_swevo_2021_100869 crossref_primary_10_1016_j_cie_2019_106223 crossref_primary_10_1016_j_eswa_2019_03_007 crossref_primary_10_1080_21642583_2018_1555063 crossref_primary_10_1109_ACCESS_2020_3015737 crossref_primary_10_1016_j_eswa_2017_10_050 crossref_primary_10_1016_j_ejor_2019_01_018 crossref_primary_10_1016_j_jii_2021_100281 crossref_primary_10_1016_j_asoc_2017_07_062 crossref_primary_10_1111_itor_12862 crossref_primary_10_1016_j_ejor_2021_10_015 crossref_primary_10_1016_j_cor_2020_104965 crossref_primary_10_1111_itor_12902 crossref_primary_10_1016_j_cor_2019_104824 crossref_primary_10_1016_j_eswa_2018_07_055 crossref_primary_10_1016_j_cirpj_2025_01_005 crossref_primary_10_1007_s00500_018_3660_5 crossref_primary_10_3390_a12120263
Cites_doi	10.1016/j.cor.2012.08.021 10.1016/j.cor.2003.11.002 10.1016/j.ejor.2004.04.017 10.1016/0305-0483(83)90088-9 10.1016/j.cor.2015.02.002 10.1016/j.ejor.2005.12.009 10.1016/j.cor.2016.04.007 10.1016/S0925-5273(01)00228-6 10.1016/j.omega.2006.11.003 10.1016/j.cor.2012.05.018 10.1016/j.cor.2013.12.012 10.1080/00207540701418960 10.1057/palgrave.jors.2601784 10.1016/0925-5273(93)90024-F 10.1016/j.cie.2005.01.020 10.1287/moor.1.2.117 10.1016/j.ejor.2012.04.034 10.1080/0020754050056417 10.1057/jors.2008.191 10.1016/j.cor.2007.05.005 10.1016/j.cor.2014.08.004 10.1016/j.omega.2008.05.002 10.1016/j.cie.2008.03.003 10.1016/S0377-2217(98)00319-1 10.1057/palgrave.jors.2601389 10.1002/nav.3800010110 10.1016/S0377-2217(01)00278-8 10.1016/S0377-2217(96)00273-1 10.1016/S0305-0548(98)00060-4 10.1016/S0377-2217(00)00137-5 10.1016/j.cor.2006.11.004 10.1016/0377-2217(93)90182-M 10.1016/j.cor.2006.08.016
ContentType	Journal Article
Copyright	2016 Elsevier Ltd Copyright Pergamon Press Inc. May 2017
Copyright_xml	– notice: 2016 Elsevier Ltd – notice: Copyright Pergamon Press Inc. May 2017
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cor.2016.12.020
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	Engineering Computer Science Business
EISSN	1873-765X 0305-0548
EndPage	177
ExternalDocumentID	4320981035 10_1016_j_cor_2016_12_020 S0305054816303288
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AGCQF JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c416t-e722d5f593b77c48fa0ddbcfe255b625e806c9dd5403aa73528999d84626afa03
ISICitedReferencesCount	28
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000394079400014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Sun Sep 07 03:13:36 EDT 2025 Tue Nov 18 22:17:18 EST 2025 Sat Nov 29 03:23:40 EST 2025 Fri Feb 23 02:33:29 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Heuristics PFSP Beam search Scheduling Flowshop Flowtime Total completion time
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c416t-e722d5f593b77c48fa0ddbcfe255b625e806c9dd5403aa73528999d84626afa03
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
ORCID	0000-0001-8498-8885
OpenAccessLink	https://idus.us.es/handle//11441/95250
PQID	1878754684
PQPubID	45870
PageCount	11
ParticipantIDs	proquest_journals_1878754684 crossref_primary_10_1016_j_cor_2016_12_020 crossref_citationtrail_10_1016_j_cor_2016_12_020 elsevier_sciencedirect_doi_10_1016_j_cor_2016_12_020
PublicationCentury	2000
PublicationDate	2017-05-01
PublicationDateYYYYMMDD	2017-05-01
PublicationDate_xml	– month: 05 year: 2017 text: 2017-05-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & operations research
PublicationYear	2017
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Rajendran, Ziegler (bib0027) 1997; 103 Johnson (bib0017) 1954; 1 Lowerre (bib0021) 1976 Della Croce, T’kindt (bib0004) 2002; 53 Framinan, Leisten, Ruiz-Usano (bib0013) 2002; 141 Valente (bib0033) 2010; 61 Pan, Ruiz (bib0024) 2013; 40 Fernandez-Viagas, Framinan (bib0009) 2015; 53 Pan, Tasgetiren, Liang (bib0025) 2008; 55 Ruiz, Stützle (bib0030) 2007; 177 Liu, Reeves (bib0020) 2001; 132 Ruiz, Maroto (bib0029) 2005; 165 Dong, Huang, Chen (bib0006) 2008; 35 Framinan, Leisten, Ruiz-Usano (bib0014) 2005; 32 Holm (bib0016) 1979; 6 Fernandez-Viagas, Framinan (bib0008) 2014; 45 Framinan, Leisten, Ruiz (bib0012) 2014 Li, Wang, Wu (bib0019) 2009; 37 Garey, Johnson, Sethi (bib0015) 1976; 1 Allahverdi, Aldowaisan (bib0002) 2002; 77 Abedinnia, Glock, Brill (bib0001) 2016; 74 Framinan, Gupta, Leisten (bib0010) 2004; 55 Framinan, Leisten (bib0011) 2008; 46 Pan, Ruiz (bib0023) 2012; 222 Valente, Alves (bib0035) 2008; 35 Armentano, Ronconi (bib0003) 1999; 26 Nawaz, Enscore Jr., Ham (bib0022) 1983; 11 Taillard (bib0032) 1993; 64 Dong, Chen, Huang, Nowak (bib0005) 2013; 40 Rajendran (bib0026) 1993; 29 Sabuncuoglu, Bayiz (bib0031) 1999; 118 Valente, Alves (bib0034) 2005; 48 Laha, Sarin (bib0018) 2009; 37 Reza Hejazi, Saghafian (bib0028) 2005; 43 Fernandez-Viagas, Framinan (bib0007) 2015; 60 Vallada, Ruiz, Minella (bib0036) 2008; 35 Johnson (10.1016/j.cor.2016.12.020_bib0017) 1954; 1 Liu (10.1016/j.cor.2016.12.020_bib0020) 2001; 132 Pan (10.1016/j.cor.2016.12.020_sbref0023) 2012; 222 Vallada (10.1016/j.cor.2016.12.020_sbref0036) 2008; 35 Framinan (10.1016/j.cor.2016.12.020_bib0012) 2014 Holm (10.1016/j.cor.2016.12.020_bib0016) 1979; 6 Allahverdi (10.1016/j.cor.2016.12.020_sbref0002) 2002; 77 Fernandez-Viagas (10.1016/j.cor.2016.12.020_sbref0008) 2014; 45 Rajendran (10.1016/j.cor.2016.12.020_sbref0026) 1993; 29 Fernandez-Viagas (10.1016/j.cor.2016.12.020_sbref0007) 2015; 60 Dong (10.1016/j.cor.2016.12.020_sbref0005) 2013; 40 Ruiz (10.1016/j.cor.2016.12.020_bib0029) 2005; 165 Armentano (10.1016/j.cor.2016.12.020_sbref0003) 1999; 26 Framinan (10.1016/j.cor.2016.12.020_sbref0011) 2008; 46 Reza Hejazi (10.1016/j.cor.2016.12.020_bib0028) 2005; 43 Framinan (10.1016/j.cor.2016.12.020_sbref0013) 2002; 141 Della Croce (10.1016/j.cor.2016.12.020_sbref0004) 2002; 53 Fernandez-Viagas (10.1016/j.cor.2016.12.020_sbref0009) 2015; 53 Sabuncuoglu (10.1016/j.cor.2016.12.020_sbref0031) 1999; 118 Valente (10.1016/j.cor.2016.12.020_sbref0033) 2010; 61 Framinan (10.1016/j.cor.2016.12.020_sbref0014) 2005; 32 Dong (10.1016/j.cor.2016.12.020_sbref0006) 2008; 35 Taillard (10.1016/j.cor.2016.12.020_bib0032) 1993; 64 Laha (10.1016/j.cor.2016.12.020_bib0018) 2009; 37 Valente (10.1016/j.cor.2016.12.020_sbref0035) 2008; 35 Garey (10.1016/j.cor.2016.12.020_sbref0015) 1976; 1 Framinan (10.1016/j.cor.2016.12.020_bib0010) 2004; 55 Pan (10.1016/j.cor.2016.12.020_sbref0025) 2008; 55 Rajendran (10.1016/j.cor.2016.12.020_bib0027) 1997; 103 Li (10.1016/j.cor.2016.12.020_sbref0019) 2009; 37 Nawaz (10.1016/j.cor.2016.12.020_bib0022) 1983; 11 Ruiz (10.1016/j.cor.2016.12.020_bib0030) 2007; 177 Lowerre (10.1016/j.cor.2016.12.020_bib0021) 1976 Valente (10.1016/j.cor.2016.12.020_sbref0034) 2005; 48 Abedinnia (10.1016/j.cor.2016.12.020_bib0001) 2016; 74 Pan (10.1016/j.cor.2016.12.020_sbref0024) 2013; 40
References_xml	– volume: 6 start-page: 65 year: 1979 end-page: 70 ident: bib0016 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand J Stat – volume: 141 start-page: 559 year: 2002 end-page: 569 ident: bib0013 article-title: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation publication-title: Eur J Oper Res – volume: 222 start-page: 31 year: 2012 end-page: 43 ident: bib0023 article-title: Local search methods for the flowshop scheduling problem with flowtime minimization publication-title: Eur J Oper Res – volume: 55 start-page: 795 year: 2008 end-page: 816 ident: bib0025 article-title: A discrete differential evolution algorithm for the permutation flowshop scheduling problem publication-title: Comput Ind Eng – volume: 35 start-page: 2388 year: 2008 end-page: 2405 ident: bib0035 article-title: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups publication-title: Comput Oper Res – volume: 40 start-page: 117 year: 2013 end-page: 128 ident: bib0024 article-title: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime publication-title: Comput Oper Res – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib0022 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: OMEGA Int J Manage Sci – volume: 40 start-page: 627 year: 2013 end-page: 632 ident: bib0005 article-title: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time publication-title: Comput Oper Res – year: 2014 ident: bib0012 article-title: Manufacturing scheduling systems: an integrated view on models, methods and tools – volume: 37 start-page: 155 year: 2009 end-page: 164 ident: bib0019 article-title: Efficient composite heuristics for total flowtime minimization in permutation flow shops publication-title: Omega – year: 1976 ident: bib0021 publication-title: The HARPY speecch recognition system – volume: 77 start-page: 71 year: 2002 end-page: 83 ident: bib0002 article-title: New heuristics to minimize total completion time in m-machine flowshops publication-title: Int J Prod Econ – volume: 53 start-page: 1275 year: 2002 end-page: 1280 ident: bib0004 article-title: A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem publication-title: J Oper Res Soc – volume: 60 start-page: 27 year: 2015 end-page: 36 ident: bib0007 article-title: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness publication-title: Comput Oper Res – volume: 165 start-page: 479 year: 2005 end-page: 494 ident: bib0029 article-title: A comprehensive review and evaluation of permutation flowshop heuristics publication-title: Eur J Oper Res – volume: 74 start-page: 165 year: 2016 end-page: 174 ident: bib0001 article-title: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem publication-title: Comput Oper Res – volume: 53 start-page: 68 year: 2015 end-page: 80 ident: bib0009 article-title: A new set of high-performing heuristics to minimise flowtime in permutation flowshops publication-title: Comput Oper Res – volume: 1 start-page: 117 year: 1976 end-page: 129 ident: bib0015 article-title: Complexity of flowshop and jobshop scheduling publication-title: Math Oper Res – volume: 35 start-page: 1350 year: 2008 end-page: 1373 ident: bib0036 article-title: Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics publication-title: Comput Oper Res – volume: 35 start-page: 3962 year: 2008 end-page: 3968 ident: bib0006 article-title: An improved NEH-based heuristic for the permutation flowshop problem publication-title: Comput Oper Res – volume: 45 start-page: 60 year: 2014 end-page: 67 ident: bib0008 article-title: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem publication-title: Comput Oper Res – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: bib0017 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Nav Res Logist Q – volume: 103 start-page: 129 year: 1997 end-page: 138 ident: bib0027 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: Eur J Oper Res – volume: 29 start-page: 65 year: 1993 end-page: 73 ident: bib0026 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flowtime publication-title: Int J Prod Econ – volume: 43 start-page: 2895 year: 2005 end-page: 2929 ident: bib0028 article-title: Flowshop-scheduling problems with makespan criterion: a review publication-title: Int J Prod Res – volume: 61 start-page: 620 year: 2010 end-page: 631 ident: bib0033 article-title: Beam search heuristics for quadratic earliness and tardiness scheduling publication-title: J Oper Res Soc – volume: 26 start-page: 219 year: 1999 end-page: 235 ident: bib0003 article-title: Tabu search for total tardiness minimization in flowshop scheduling problems publication-title: Comput Oper Res – volume: 55 start-page: 1243 year: 2004 end-page: 1255 ident: bib0010 article-title: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective publication-title: J Oper Res Soc – volume: 132 start-page: 439 year: 2001 end-page: 452 ident: bib0020 article-title: Constructive and composite heuristic solutions to the publication-title: Eur J Oper Res – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib0032 article-title: Benchmarks for basic scheduling problems publication-title: Eur J Oper Res – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib0030 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res – volume: 118 start-page: 390 year: 1999 end-page: 412 ident: bib0031 article-title: Job shop scheduling with beam search publication-title: Eur J Oper Res – volume: 46 start-page: 6479 year: 2008 end-page: 6498 ident: bib0011 article-title: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm publication-title: Int J Prod Res – volume: 48 start-page: 363 year: 2005 end-page: 375 ident: bib0034 article-title: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time publication-title: Comput Ind Eng – volume: 32 start-page: 1237 year: 2005 end-page: 1254 ident: bib0014 article-title: Comparison of heuristics for flowtime minimisation in permutation flowshops publication-title: Comput Oper Res – volume: 37 start-page: 734 year: 2009 end-page: 739 ident: bib0018 article-title: A heuristic to minimize total flow time in permutation flow shop publication-title: Omega – volume: 40 start-page: 627 issue: 2 year: 2013 ident: 10.1016/j.cor.2016.12.020_sbref0005 article-title: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.08.021 – volume: 32 start-page: 1237 issue: 5 year: 2005 ident: 10.1016/j.cor.2016.12.020_sbref0014 article-title: Comparison of heuristics for flowtime minimisation in permutation flowshops publication-title: Comput Oper Res doi: 10.1016/j.cor.2003.11.002 – volume: 165 start-page: 479 issue: 2 year: 2005 ident: 10.1016/j.cor.2016.12.020_bib0029 article-title: A comprehensive review and evaluation of permutation flowshop heuristics publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.04.017 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.cor.2016.12.020_bib0022 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: OMEGA Int J Manage Sci doi: 10.1016/0305-0483(83)90088-9 – volume: 60 start-page: 27 year: 2015 ident: 10.1016/j.cor.2016.12.020_sbref0007 article-title: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness publication-title: Comput Oper Res doi: 10.1016/j.cor.2015.02.002 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.cor.2016.12.020_bib0030 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.12.009 – volume: 74 start-page: 165 year: 2016 ident: 10.1016/j.cor.2016.12.020_bib0001 article-title: New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.04.007 – volume: 77 start-page: 71 issue: 1 year: 2002 ident: 10.1016/j.cor.2016.12.020_sbref0002 article-title: New heuristics to minimize total completion time in m-machine flowshops publication-title: Int J Prod Econ doi: 10.1016/S0925-5273(01)00228-6 – year: 2014 ident: 10.1016/j.cor.2016.12.020_bib0012 – volume: 37 start-page: 155 issue: 1 year: 2009 ident: 10.1016/j.cor.2016.12.020_sbref0019 article-title: Efficient composite heuristics for total flowtime minimization in permutation flow shops publication-title: Omega doi: 10.1016/j.omega.2006.11.003 – volume: 40 start-page: 117 issue: 1 year: 2013 ident: 10.1016/j.cor.2016.12.020_sbref0024 article-title: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime publication-title: Comput Oper Res doi: 10.1016/j.cor.2012.05.018 – volume: 45 start-page: 60 issue: 0 year: 2014 ident: 10.1016/j.cor.2016.12.020_sbref0008 article-title: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.12.012 – volume: 46 start-page: 6479 issue: 22 year: 2008 ident: 10.1016/j.cor.2016.12.020_sbref0011 article-title: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm publication-title: Int J Prod Res doi: 10.1080/00207540701418960 – volume: 55 start-page: 1243 issue: 12 year: 2004 ident: 10.1016/j.cor.2016.12.020_bib0010 article-title: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601784 – volume: 29 start-page: 65 issue: 1 year: 1993 ident: 10.1016/j.cor.2016.12.020_sbref0026 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flowtime publication-title: Int J Prod Econ doi: 10.1016/0925-5273(93)90024-F – volume: 48 start-page: 363 issue: 2 year: 2005 ident: 10.1016/j.cor.2016.12.020_sbref0034 article-title: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time publication-title: Comput Ind Eng doi: 10.1016/j.cie.2005.01.020 – volume: 1 start-page: 117 issue: 2 year: 1976 ident: 10.1016/j.cor.2016.12.020_sbref0015 article-title: Complexity of flowshop and jobshop scheduling publication-title: Math Oper Res doi: 10.1287/moor.1.2.117 – volume: 222 start-page: 31 issue: 1 year: 2012 ident: 10.1016/j.cor.2016.12.020_sbref0023 article-title: Local search methods for the flowshop scheduling problem with flowtime minimization publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2012.04.034 – volume: 43 start-page: 2895 issue: 14 year: 2005 ident: 10.1016/j.cor.2016.12.020_bib0028 article-title: Flowshop-scheduling problems with makespan criterion: a review publication-title: Int J Prod Res doi: 10.1080/0020754050056417 – volume: 61 start-page: 620 issue: 4 year: 2010 ident: 10.1016/j.cor.2016.12.020_sbref0033 article-title: Beam search heuristics for quadratic earliness and tardiness scheduling publication-title: J Oper Res Soc doi: 10.1057/jors.2008.191 – volume: 35 start-page: 3962 issue: 12 year: 2008 ident: 10.1016/j.cor.2016.12.020_sbref0006 article-title: An improved NEH-based heuristic for the permutation flowshop problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2007.05.005 – volume: 53 start-page: 68 issue: 0 year: 2015 ident: 10.1016/j.cor.2016.12.020_sbref0009 article-title: A new set of high-performing heuristics to minimise flowtime in permutation flowshops publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.08.004 – volume: 37 start-page: 734 issue: 3 year: 2009 ident: 10.1016/j.cor.2016.12.020_bib0018 article-title: A heuristic to minimize total flow time in permutation flow shop publication-title: Omega doi: 10.1016/j.omega.2008.05.002 – volume: 6 start-page: 65 year: 1979 ident: 10.1016/j.cor.2016.12.020_bib0016 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand J Stat – volume: 55 start-page: 795 issue: 4 year: 2008 ident: 10.1016/j.cor.2016.12.020_sbref0025 article-title: A discrete differential evolution algorithm for the permutation flowshop scheduling problem publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.03.003 – volume: 118 start-page: 390 issue: 2 year: 1999 ident: 10.1016/j.cor.2016.12.020_sbref0031 article-title: Job shop scheduling with beam search publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(98)00319-1 – volume: 53 start-page: 1275 issue: 11 year: 2002 ident: 10.1016/j.cor.2016.12.020_sbref0004 article-title: A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601389 – volume: 1 start-page: 61 year: 1954 ident: 10.1016/j.cor.2016.12.020_bib0017 article-title: Optimal two- and three-stage production schedules with setup times included publication-title: Nav Res Logist Q doi: 10.1002/nav.3800010110 – year: 1976 ident: 10.1016/j.cor.2016.12.020_bib0021 – volume: 141 start-page: 559 issue: 3 year: 2002 ident: 10.1016/j.cor.2016.12.020_sbref0013 article-title: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00278-8 – volume: 103 start-page: 129 year: 1997 ident: 10.1016/j.cor.2016.12.020_bib0027 article-title: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(96)00273-1 – volume: 26 start-page: 219 issue: 3 year: 1999 ident: 10.1016/j.cor.2016.12.020_sbref0003 article-title: Tabu search for total tardiness minimization in flowshop scheduling problems publication-title: Comput Oper Res doi: 10.1016/S0305-0548(98)00060-4 – volume: 132 start-page: 439 year: 2001 ident: 10.1016/j.cor.2016.12.020_bib0020 article-title: Constructive and composite heuristic solutions to the P\|\|∑ci scheduling problem publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00137-5 – volume: 35 start-page: 2388 issue: 7 year: 2008 ident: 10.1016/j.cor.2016.12.020_sbref0035 article-title: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.11.004 – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 10.1016/j.cor.2016.12.020_bib0032 article-title: Benchmarks for basic scheduling problems publication-title: Eur J Oper Res doi: 10.1016/0377-2217(93)90182-M – volume: 35 start-page: 1350 issue: 4 year: 2008 ident: 10.1016/j.cor.2016.12.020_sbref0036 article-title: Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.08.016
SSID	ssj0000721
Score	2.3668745
Snippet	In this paper we present a beam-search-based constructive heuristic to solve the permutation flowshop scheduling problem with total flowtime minimisation as...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	167
SubjectTerms	Algorithms Beam search Flowshop Flowtime Heuristic Heuristics Job shops PFSP Scheduling Scheduling algorithms Studies Total completion time
Title	A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
URI	https://dx.doi.org/10.1016/j.cor.2016.12.020 https://www.proquest.com/docview/1878754684
Volume	81
WOSCitedRecordID	wos000394079400014&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-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdgQwgeBhTQBgP5gScmT2m-7DxWaNOGxFSxMfXNcmxn6jTSau3G_nzu_JFGmzYBEi9RFDmp6_vF95G73xHyqQbHB5mcWG1EyXKtayaUUoyLJK1z06CR4JpN8KMjMZlU45AStHDtBHjbipubav5fRQ3XQNhYOvsX4u4eChfgHIQORxA7HP9I8KOd2qqfzP8vhloKC9ciUey1BdvwytMzdymG4_3jMRqhyDMCcsduGlgj2VzMfmHv-b4BG7tALBxmZnN7GXLpAmtQF13uAtTsdKrOfNnY6VR7cuNQcKJcHk78ELHzbbcfgwC91mX8-cBYLI5ZZSK5giwcVXgizV3r91fBM8bLYtLfgH3PlrCDDn13jqCMh77Hy5193occzkFMyOk6LF1IN01WSq1LNTzGaeAswPBE7kDxmKynvKhgE18fHe5Nvq70NndVet204zdwlw1464fus2Ju6XNnpJy8JBvBu6Ajj4pX5JFtB-RpLG4YkBdRfDTs6QPyvMdI-Zp8H9E76KF99NAOPRTQQwE9FNFDlzMa0UMdemhEzxvyY3_v5MsBC203mAbrfMksT1NTNEWV1ZzrXDQqMabWjQXvswZ32Yqk1JUx8BpnSnGkBwIvw4Ahm5YKBmdvyVo7a-0moUkD6kBXWSOEyW2iRaXBXNUGTuoiLdQWSeIySh046bE1yoWMyYfnElZe4srLYSph5bfI5-6WuSdkeWhwHmUjg0XpLUUJQHrotu0oRxne7IUE6IJvn5cif_dvT31Pnq3enW2yBoKzH8gTfb2cLi4_BjT-Bi0oo6g
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+beam-search-based+constructive+heuristic+for+the+PFSP+to+minimise+total+flowtime&rft.jtitle=Computers+%26+operations+research&rft.au=Fernandez-Viagas%2C+Victor&rft.au=Framinan%2C+Jose+M.&rft.date=2017-05-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=81&rft.spage=167&rft.epage=177&rft_id=info:doi/10.1016%2Fj.cor.2016.12.020&rft.externalDocID=S0305054816303288
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon