Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing objectives related to machine utilisation and to customer satisfaction....
Saved in:
| Published in: | Computers & operations research Vol. 64; pp. 86 - 96 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.12.2015
Pergamon Press Inc |
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing objectives related to machine utilisation and to customer satisfaction. Although several approximate algorithms have been proposed for this NP-hard problem, none of them can use the excellent speed-up method by Taillard (1990) [22] for makespan minimisation due to the special structure of the problem under consideration. In this paper, several properties of the problem are defined in order to be able to partly apply Taillard׳s acceleration. This mechanism, together with a novel feasible tabu local search method, allows us to further exploit the structure of solutions of the problem, and are incorporated in two proposed algorithms: a bounded-insertion-based constructive heuristic and an advanced non-population-based algorithm. These algorithms are compared with state-of-the-art algorithms under the same computer conditions. The results show that both algorithms improve existing ones and therefore, constitute the new state-of-art approximate solution procedures for the problem.
•We address the permutation flowshop problem to minimise makespan subject to a maximum tardiness.•We propose two new non-population-based algorithms for the problem.•We define several properties of the problem to be able to partly apply Taillard׳s acceleration.•We compare the proposals with each efficient algorithm in the literature. |
|---|---|
| AbstractList | This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing objectives related to machine utilisation and to customer satisfaction. Although several approximate algorithms have been proposed for this NP-hard problem, none of them can use the excellent speed-up method by Taillard (1990) [22] for makespan minimisation due to the special structure of the problem under consideration. In this paper, several properties of the problem are defined in order to be able to partly apply Taillard's acceleration. This mechanism, together with a novel feasible tabu local search method, allows us to further exploit the structure of solutions of the problem, and are incorporated in two proposed algorithms: a bounded-insertion-based constructive heuristic and an advanced non-population-based algorithm. These algorithms are compared with state-of-the-art algorithms under the same computer conditions. The results show that both algorithms improve existing ones and therefore, constitute the new state-of-art approximate solution procedures for the problem. This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines two desirable manufacturing objectives related to machine utilisation and to customer satisfaction. Although several approximate algorithms have been proposed for this NP-hard problem, none of them can use the excellent speed-up method by Taillard (1990) [22] for makespan minimisation due to the special structure of the problem under consideration. In this paper, several properties of the problem are defined in order to be able to partly apply Taillard׳s acceleration. This mechanism, together with a novel feasible tabu local search method, allows us to further exploit the structure of solutions of the problem, and are incorporated in two proposed algorithms: a bounded-insertion-based constructive heuristic and an advanced non-population-based algorithm. These algorithms are compared with state-of-the-art algorithms under the same computer conditions. The results show that both algorithms improve existing ones and therefore, constitute the new state-of-art approximate solution procedures for the problem. •We address the permutation flowshop problem to minimise makespan subject to a maximum tardiness.•We propose two new non-population-based algorithms for the problem.•We define several properties of the problem to be able to partly apply Taillard׳s acceleration.•We compare the proposals with each efficient algorithm in the literature. |
| 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 | eNp9kc9q3DAQh0VJoJukD9CboJdevB1ZtrSmpxLSPxDopYHehCyPsnJtyZXkpn2OvnC0dU85RAxoDt83DPO7IGc-eCTkNYM9AybejXsT4r4G1u6hFIgXZMcOkldStN_PyA44tBW0zeEluUhphPJkzXbk7421zjj0mZaJ1RKWddLZlbbXCQeqp_sQXT7OidoQaT4iXTDOa_4HUTuFh3QMC03miMM6OX9Plxj6CWf6UDQ66x-YFu3p7LybXdq0tPYjmkxzoLogv928zjTrODiPKV2Rc6unhK_-_5fk7uPNt-vP1e3XT1-uP9xWpgGWK250Z23PjZGNZrXprLR46GXXNn0jWkQYOlGD1Y3s676TYtDImW5lUYDXyC_J221u2fjniimrsqDBadIew5oUkxK4gI5DQd88QcewRl-2KxTUB8GAy0KxjTIxpBTRqiW6Wcc_ioE6xaRGVWJSp5gUlAJRHPnEMW47bo7aTc-a7zcTy41-OYwqnYI0OLhYjquG4J6xHwHmb7OO |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1016_j_cie_2022_108276 crossref_primary_10_1016_j_eswa_2021_115903 crossref_primary_10_1115_1_4038074 crossref_primary_10_1016_j_cie_2017_10_034 crossref_primary_10_1016_j_ejor_2019_10_017 crossref_primary_10_1016_j_cor_2022_105744 crossref_primary_10_1016_j_simpat_2018_04_005 crossref_primary_10_1108_JM2_11_2020_0302 crossref_primary_10_1016_j_ejor_2024_11_026 crossref_primary_10_1016_j_cie_2018_03_014 crossref_primary_10_1016_j_cor_2016_12_013 crossref_primary_10_1016_j_eswa_2016_05_040 crossref_primary_10_1016_j_swevo_2016_06_002 crossref_primary_10_1080_0305215X_2016_1227615 crossref_primary_10_1016_j_cor_2016_05_006 crossref_primary_10_1109_ACCESS_2021_3052562 crossref_primary_10_1016_j_cie_2020_106288 crossref_primary_10_1007_s10489_022_04090_2 crossref_primary_10_1016_j_cor_2019_104793 crossref_primary_10_1016_j_swevo_2024_101696 crossref_primary_10_1016_j_compind_2018_02_008 crossref_primary_10_1016_j_eswa_2017_10_050 |
| Cites_doi | 10.1016/0305-0483(89)90059-5 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H 10.1016/j.cor.2007.12.013 10.1016/0377-2217(93)90182-M 10.1016/j.cor.2006.08.016 10.1080/00207547808930015 10.1080/095372899232777 10.1080/00207543.2014.948578 10.1016/j.cor.2013.12.012 10.1016/j.ijpe.2004.12.004 10.1016/j.ejor.2004.04.017 10.1007/s00170-006-0726-9 10.1016/j.ejor.2005.12.009 10.1016/S0377-2217(97)00019-2 10.1016/j.cor.2014.08.004 10.1016/j.cie.2008.03.003 10.1007/s00170-010-3094-4 10.1016/0305-0483(83)90088-9 10.1016/0377-2217(90)90090-X 10.1016/j.cor.2015.02.002 10.1016/j.omega.2009.04.002 10.1080/00207540701418960 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd Copyright Pergamon Press Inc. Dec 2015 |
| Copyright_xml | – notice: 2015 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Dec 2015 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2015.05.006 |
| 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 Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 96 |
| ExternalDocumentID | 3773852801 10_1016_j_cor_2015_05_006 S0305054815001239 |
| 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 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c401t-3ca9ffb3cc74a12c9f7fe8b7954b465ee0d9620fa47b2b976dae31a57b3c032e3 |
| ISICitedReferencesCount | 27 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000360513300008&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 | Thu Oct 02 12:21:02 EDT 2025 Sun Oct 05 00:16:30 EDT 2025 Sat Nov 29 03:23:38 EST 2025 Tue Nov 18 22:04:17 EST 2025 Fri Feb 23 02:33:27 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | NEH Maximum tardiness Non-population algorithm Bounded insertion Heuristics PFSP Scheduling Makespan Flowshop |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c401t-3ca9ffb3cc74a12c9f7fe8b7954b465ee0d9620fa47b2b976dae31a57b3c032e3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0001-8498-8885 |
| OpenAccessLink | https://idus.us.es/handle//11441/95262 |
| PQID | 1702861037 |
| PQPubID | 45870 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_1770360930 proquest_journals_1702861037 crossref_primary_10_1016_j_cor_2015_05_006 crossref_citationtrail_10_1016_j_cor_2015_05_006 elsevier_sciencedirect_doi_10_1016_j_cor_2015_05_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-12-01 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Nawaz, Enscore, Ham (bib14) 1983; 11 Taillard (bib22) 1990; 47 Fernandez-Viagas, Framinan (bib5) 2015; 60 Framinan, Leisten, Ruiz (bib10) 2014 Ruiz, Maroto (bib19) 2005; 165 Pan, Tasgetiren, Liang (bib16) 2008; 55 Osman, Potts (bib15) 1989; 17 Framinan, Leisten (bib9) 2008; 46 Ruiz, Stützle (bib20) 2007; 177 Vallada, Ruiz, Minella (bib26) 2008; 35 Daniels, Chambers (bib2) 1990; 37 Chakravarthy, Rajendran (bib1) 1999; 10 Gelders, Sambandam (bib11) 1978; 16 Hopp W, Spearman M. Factory physics. Boston, Massachusetts: McGraw-Hill/Irwin; 2000. T׳Kindt, Billaut (bib24) 2006 Vallada, Ruiz (bib25) 2010; 38 Ruiz, Allahverdi (bib17) 2007; 35 Taillard (bib23) 1993; 64 Fernandez-Viagas, Framinan (bib7) 2014; 45 Framinan, Leisten (bib8) 2006; 99 Demirkol, Mehta, Uzsoy (bib3) 1998; 109 Fernandez-Viagas, Framinan (bib4) 2015; 53 Fernandez-Viagas, Framinan (bib6) 2015; 53 Holm (bib12) 1979; 6 Ruiz, Allahverdi (bib18) 2009; 36 Sun, Zhang, Gao, Wang (bib21) 2011; 55 Chakravarthy (10.1016/j.cor.2015.05.006_bib1) 1999; 10 Vallada (10.1016/j.cor.2015.05.006_bib26) 2008; 35 Fernandez-Viagas (10.1016/j.cor.2015.05.006_bib5) 2015; 60 Fernandez-Viagas (10.1016/j.cor.2015.05.006_bib6) 2015; 53 Vallada (10.1016/j.cor.2015.05.006_bib25) 2010; 38 Taillard (10.1016/j.cor.2015.05.006_bib23) 1993; 64 Gelders (10.1016/j.cor.2015.05.006_bib11) 1978; 16 Fernandez-Viagas (10.1016/j.cor.2015.05.006_bib4) 2015; 53 Nawaz (10.1016/j.cor.2015.05.006_bib14) 1983; 11 10.1016/j.cor.2015.05.006_bib13 Pan (10.1016/j.cor.2015.05.006_bib16) 2008; 55 Fernandez-Viagas (10.1016/j.cor.2015.05.006_bib7) 2014; 45 Framinan (10.1016/j.cor.2015.05.006_bib9) 2008; 46 Sun (10.1016/j.cor.2015.05.006_bib21) 2011; 55 Daniels (10.1016/j.cor.2015.05.006_bib2) 1990; 37 Demirkol (10.1016/j.cor.2015.05.006_bib3) 1998; 109 Holm (10.1016/j.cor.2015.05.006_bib12) 1979; 6 Ruiz (10.1016/j.cor.2015.05.006_bib17) 2007; 35 Framinan (10.1016/j.cor.2015.05.006_bib10) 2014 Ruiz (10.1016/j.cor.2015.05.006_bib18) 2009; 36 Osman (10.1016/j.cor.2015.05.006_bib15) 1989; 17 Ruiz (10.1016/j.cor.2015.05.006_bib20) 2007; 177 Taillard (10.1016/j.cor.2015.05.006_bib22) 1990; 47 T׳Kindt (10.1016/j.cor.2015.05.006_bib24) 2006 Ruiz (10.1016/j.cor.2015.05.006_bib19) 2005; 165 Framinan (10.1016/j.cor.2015.05.006_bib8) 2006; 99 |
| References_xml | – volume: 53 start-page: 1111 year: 2015 end-page: 1123 ident: bib4 article-title: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem publication-title: Int J Prod Res – volume: 53 start-page: 68 year: 2015 end-page: 80 ident: bib6 article-title: A new set of high-performing heuristics to minimise flowtime in permutation flowshops publication-title: Comput Oper Res – volume: 45 start-page: 60 year: 2014 end-page: 67 ident: bib7 article-title: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem publication-title: Comput Oper Res – volume: 109 start-page: 137 year: 1998 end-page: 141 ident: bib3 article-title: Benchmarks for shop scheduling problems publication-title: Eur J Oper Res – volume: 6 start-page: 65 year: 1979 end-page: 70 ident: bib12 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand J Stat – reference: Hopp W, Spearman M. Factory physics. Boston, Massachusetts: McGraw-Hill/Irwin; 2000. – volume: 55 start-page: 723 year: 2011 end-page: 739 ident: bib21 article-title: Multi-objective optimization algorithms for flow shop scheduling problem publication-title: Int J Adv Manuf Technol – volume: 17 start-page: 551 year: 1989 end-page: 557 ident: bib15 article-title: Simulated annealing for permutation flow-shop scheduling publication-title: Omega – volume: 35 start-page: 551 year: 2007 end-page: 565 ident: bib17 article-title: No-wait flowshop with separate setup times to minimize maximum lateness publication-title: Int J Adv Manuf Technol – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib14 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: OMEGA Int J Manage Sci – volume: 16 start-page: 221 year: 1978 end-page: 231 ident: bib11 article-title: Four simple heuristics for scheduling a flow-shop publication-title: Int J Prod Res – volume: 55 start-page: 795 year: 2008 end-page: 816 ident: bib16 article-title: A discrete differential evolution algorithm for the permutation flowshop scheduling problem publication-title: Comput Ind Eng – volume: 10 start-page: 707 year: 1999 end-page: 714 ident: bib1 article-title: Heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization publication-title: Prod Plan Control – year: 2006 ident: bib24 article-title: Multicriteria scheduling: theory, models and algorithms – volume: 46 start-page: 6479 year: 2008 end-page: 6498 ident: bib9 article-title: Total tardiness minimization in permutation flow shops publication-title: Int J Prod Res – volume: 165 start-page: 479 year: 2005 end-page: 494 ident: bib19 article-title: A comprehensive review and evaluation of permutation flowshop heuristics publication-title: Eur J Oper Res – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib23 article-title: Benchmarks for basic scheduling problems publication-title: Eur J Oper Res – volume: 37 start-page: 981 year: 1990 end-page: 995 ident: bib2 article-title: Multiobjective flow-shop scheduling publication-title: Nav Res Logist – year: 2014 ident: bib10 article-title: Manufacturing scheduling systems: an integrated view on models, methods, and tools – volume: 47 start-page: 65 year: 1990 end-page: 74 ident: bib22 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: Eur J Oper Res – volume: 35 start-page: 1350 year: 2008 end-page: 1373 ident: bib26 article-title: Minimising total tardiness in the m-machine flowshop problem publication-title: Comput Oper Res – volume: 36 start-page: 1268 year: 2009 end-page: 1283 ident: bib18 article-title: Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness publication-title: Comput Oper Res – volume: 99 start-page: 28 year: 2006 end-page: 40 ident: bib8 article-title: A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness publication-title: Int J Prod Econ – volume: 38 start-page: 57 year: 2010 end-page: 67 ident: bib25 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib20 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res – volume: 60 start-page: 27 year: 2015 end-page: 36 ident: bib5 article-title: Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness publication-title: Comput Oper Res – volume: 6 start-page: 65 year: 1979 ident: 10.1016/j.cor.2015.05.006_bib12 article-title: A simple sequentially rejective multiple test procedure publication-title: Scand J Stat – volume: 17 start-page: 551 issue: 6 year: 1989 ident: 10.1016/j.cor.2015.05.006_bib15 article-title: Simulated annealing for permutation flow-shop scheduling publication-title: Omega doi: 10.1016/0305-0483(89)90059-5 – year: 2006 ident: 10.1016/j.cor.2015.05.006_bib24 – year: 2014 ident: 10.1016/j.cor.2015.05.006_bib10 – volume: 37 start-page: 981 issue: 6 year: 1990 ident: 10.1016/j.cor.2015.05.006_bib2 article-title: Multiobjective flow-shop scheduling publication-title: Nav Res Logist doi: 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H – volume: 36 start-page: 1268 issue: 4 year: 2009 ident: 10.1016/j.cor.2015.05.006_bib18 article-title: Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness publication-title: Comput Oper Res doi: 10.1016/j.cor.2007.12.013 – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 10.1016/j.cor.2015.05.006_bib23 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.2015.05.006_bib26 article-title: Minimising total tardiness in the m-machine flowshop problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.08.016 – volume: 16 start-page: 221 issue: 3 year: 1978 ident: 10.1016/j.cor.2015.05.006_bib11 article-title: Four simple heuristics for scheduling a flow-shop publication-title: Int J Prod Res doi: 10.1080/00207547808930015 – volume: 10 start-page: 707 issue: 7 year: 1999 ident: 10.1016/j.cor.2015.05.006_bib1 article-title: Heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization publication-title: Prod Plan Control doi: 10.1080/095372899232777 – volume: 53 start-page: 1111 issue: 4 year: 2015 ident: 10.1016/j.cor.2015.05.006_bib4 article-title: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem publication-title: Int J Prod Res doi: 10.1080/00207543.2014.948578 – volume: 45 start-page: 60 issue: 0 year: 2014 ident: 10.1016/j.cor.2015.05.006_bib7 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: 99 start-page: 28 issue: 1–2 year: 2006 ident: 10.1016/j.cor.2015.05.006_bib8 article-title: A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2004.12.004 – ident: 10.1016/j.cor.2015.05.006_bib13 – volume: 165 start-page: 479 issue: 2 year: 2005 ident: 10.1016/j.cor.2015.05.006_bib19 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: 35 start-page: 551 issue: 5–6 year: 2007 ident: 10.1016/j.cor.2015.05.006_bib17 article-title: No-wait flowshop with separate setup times to minimize maximum lateness publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-006-0726-9 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.cor.2015.05.006_bib20 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: 109 start-page: 137 issue: 1 year: 1998 ident: 10.1016/j.cor.2015.05.006_bib3 article-title: Benchmarks for shop scheduling problems publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(97)00019-2 – volume: 53 start-page: 68 year: 2015 ident: 10.1016/j.cor.2015.05.006_bib6 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: 55 start-page: 795 issue: 4 year: 2008 ident: 10.1016/j.cor.2015.05.006_bib16 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: 55 start-page: 723 issue: 5–8 year: 2011 ident: 10.1016/j.cor.2015.05.006_bib21 article-title: Multi-objective optimization algorithms for flow shop scheduling problem publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-010-3094-4 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.cor.2015.05.006_bib14 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: 47 start-page: 65 issue: 1 year: 1990 ident: 10.1016/j.cor.2015.05.006_bib22 article-title: Some efficient heuristic methods for the flow shop sequencing problem publication-title: Eur J Oper Res doi: 10.1016/0377-2217(90)90090-X – volume: 60 start-page: 27 year: 2015 ident: 10.1016/j.cor.2015.05.006_bib5 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: 38 start-page: 57 issue: 1–2 year: 2010 ident: 10.1016/j.cor.2015.05.006_bib25 article-title: Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem publication-title: Omega doi: 10.1016/j.omega.2009.04.002 – volume: 46 start-page: 6479 issue: 22 year: 2008 ident: 10.1016/j.cor.2015.05.006_bib9 article-title: Total tardiness minimization in permutation flow shops publication-title: Int J Prod Res doi: 10.1080/00207540701418960 |
| SSID | ssj0000721 |
| Score | 2.2954903 |
| Snippet | This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 86 |
| SubjectTerms | Algorithms Approximation Bounded insertion Customer satisfaction Flowshop Heuristic Heuristics Job shops Makespan Mathematical models Maximum tardiness NEH Non-population algorithm Operations research Permutations PFSP Production scheduling Scheduling State of the art Studies |
| Title | Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness |
| URI | https://dx.doi.org/10.1016/j.cor.2015.05.006 https://www.proquest.com/docview/1702861037 https://www.proquest.com/docview/1770360930 |
| Volume | 64 |
| WOSCitedRecordID | wos000360513300008&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/eLvHCXMwtV1ti9NAEF5qT0Q_-FIVq6es4CdDjmSzySYfD6mo6CF4ln4Lm2Rzl7NNSpue_R_-Cv-ls29pqHqoIJTQptlm23k6Mzs78wxCL0jOQC0S6tIoDlzqk8LNAsZcwgvC8jgriApdTN-zk5N4Nks-DgbfbS3M5ZzVdbzdJsv_Kmo4B8KWpbN_Ie7uQ-EEPAehwxHEDsc_EvxEkULILX5Y2bvLrkGXKw1W4fD5WbOq2nNNxKArpUA7b2zW4bz5uj5vlg6sesEKmWJ11XRGx2wX_IsALVQ7kpRkYZKBnPUmkwEd6clyuGRbLTYLp5Xoq22Kh6VDMG0k1gp0zVKsTDKeoR3qwtNdhNudVvxM151Nq1yzI5uKFa4SeexOhvPhqB_E8MO9hJCuumaXyqQqumRiYaiZOI-EVtAxC1wWhbO-Bo9oTwVbZm31QnfL_clM6IjFBUhZUsL6oSJv9fYouZWR_yQnIecAjrN0P5Nr6ICwMImH6OD47WT2bmf2mSry6yZtt9BVMuHejX7nBO25A8rHOb2LbpvFCT7WoLqHBqIeoRu2NmKE7ljhYWMSRuhWj9DyPvrWgQ__Cnx4Bz4M4MMAPtwDH7bgwzvwYQM-LMGHLfhwH3zYgA-3DebYgA934HuAPr-enL5645q2H24Oi_3WDXKelGUW5Dmj3Cd5UrJSxBlLQprRKBTCK5KIeCWnLCMZuNMFF4HPQwZDvICI4CEawncUjxDmtCQRiT2ShQXNyoRHgmWijOIoEJQG5Rh5Vg5pbjjxZWuWeWqTHy9SEF0qRZd68PCiMXrZDVlqQpirLqZWuKnxaLWnmgISrxp2aIGQGs2yTn0GS4FIlvWO0fPubfip5Q4fr0WzkddIPj0vCbzH_3bnJ-jm7u95iIbtaiOeouv5ZVutV88M5H8A1pDkgw |
| 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=Efficient+non-population-based+algorithms+for+the+permutation+flowshop+scheduling+problem+with+makespan+minimisation+subject+to+a+maximum+tardiness&rft.jtitle=Computers+%26+operations+research&rft.au=Fernandez-Viagas%2C+Victor&rft.au=Framinan%2C+Jose+M.&rft.date=2015-12-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=64&rft.spage=86&rft.epage=96&rft_id=info:doi/10.1016%2Fj.cor.2015.05.006&rft.externalDocID=S0305054815001239 |
| 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 |