Improved Heuristic Kalman Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem
The Flexible Job Shop Scheduling Problem (FJSSP), as a typical NP-hard optimization problem, has a significant value in manufacturing environment. This paper presents an improved estimation method of Multi-Objective Heuristic Kalman Algorithm (MOHKA) for solving Multi-Objective Flexible Job Shop Sch...
Saved in:
| Published in | Procedia manufacturing Vol. 17; pp. 895 - 902 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
2018
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2351-9789 2351-9789 |
| DOI | 10.1016/j.promfg.2018.10.142 |
Cover
| Abstract | The Flexible Job Shop Scheduling Problem (FJSSP), as a typical NP-hard optimization problem, has a significant value in manufacturing environment. This paper presents an improved estimation method of Multi-Objective Heuristic Kalman Algorithm (MOHKA) for solving Multi-Objective Flexible Job Shop Scheduling Problem (MOFJSSP). The optimization results of improved MOHKA for the MOFJSSP were implemented in the five Kacem and ten Brendimarte benchmarks. First, an improved mathematical model of MOHKA was proposed and implemented in MATLAB. Then we applied MOHKA to solve MOFJSSP with an improved real number encoding system, optimized for three benchmark optimization parameters, the maximum completion time of on all jobs (makespan), the total workload on all machine, the workload of the critical machine (the maximum workload among the machines). The results presented in the paper show that the improved method of MOHKA for solving MOFJSSP can optimize multi-objective parameters especially for some of these selected cases in which our algorithm gives us high-quality results. |
|---|---|
| AbstractList | The Flexible Job Shop Scheduling Problem (FJSSP), as a typical NP-hard optimization problem, has a significant value in manufacturing environment. This paper presents an improved estimation method of Multi-Objective Heuristic Kalman Algorithm (MOHKA) for solving Multi-Objective Flexible Job Shop Scheduling Problem (MOFJSSP). The optimization results of improved MOHKA for the MOFJSSP were implemented in the five Kacem and ten Brendimarte benchmarks. First, an improved mathematical model of MOHKA was proposed and implemented in MATLAB. Then we applied MOHKA to solve MOFJSSP with an improved real number encoding system, optimized for three benchmark optimization parameters, the maximum completion time of on all jobs (makespan), the total workload on all machine, the workload of the critical machine (the maximum workload among the machines). The results presented in the paper show that the improved method of MOHKA for solving MOFJSSP can optimize multi-objective parameters especially for some of these selected cases in which our algorithm gives us high-quality results. |
| Author | Robert, Ojstersek Borut, Buchmeister Hankun, Zhang Shifeng, Liu |
| Author_xml | – sequence: 1 givenname: Ojstersek surname: Robert fullname: Robert, Ojstersek email: robert.ojstersek@um.si organization: Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, 2000 Maribor, Slovenia – sequence: 2 givenname: Zhang surname: Hankun fullname: Hankun, Zhang email: zhanghankun@bjtu.edu.cn organization: School of Economics & Management, Beijing Jiaotong University, Beijing 100044, P.R. China – sequence: 3 givenname: Liu surname: Shifeng fullname: Shifeng, Liu email: shfliu@bjtu.edu.cn organization: School of Economics & Management, Beijing Jiaotong University, Beijing 100044, P.R. China – sequence: 4 givenname: Buchmeister surname: Borut fullname: Borut, Buchmeister email: borut.buchmeister@um.si organization: Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, 2000 Maribor, Slovenia |
| BookMark | eNqNkMtOwzAQRS1UJErpH7DwDyQ4b4cFUlUBLRQVqbCOHHvSOnLiyHlA_56EsEAsgNWMZu4Zac45mpS6BIQuHWI7xAmvcrsyusj2tkscag9T3z1BU9cLHCuOaDz51p-heV3nhPScG4ZRPEViXfR4BwKvoDWybiTHj0wVrMQLtddGNocCZ9rgnVadLPf4qVWNtLZpDryRHeA7Be8yVYAfdIp3B13hHT-AaNUQfja6XxUX6DRjqob5V52h17vbl-XK2mzv18vFxuJeHDQWTZ3U9yLGMqC-l3kpEYSG3KcZuDyNhevHBETcP8P6JBFhJNIAaEQDLiiE1JuhYLzblhU7vjGlksrIgplj4pBksJXkyWgrGWx9Tn235_yR40bXtYHsv9j1D4zLhjVSl41hUv0F34ww9EI6CSapuYSSg5CmV5sILX8_8AHn4Z3Z |
| CitedBy_id | crossref_primary_10_3390_met12111790 crossref_primary_10_1007_s10846_022_01793_z crossref_primary_10_3390_math9080909 crossref_primary_10_1016_j_eswa_2021_114567 crossref_primary_10_3390_su12104103 crossref_primary_10_1088_1742_6596_1952_4_042065 crossref_primary_10_1111_itor_13108 crossref_primary_10_1088_1742_6596_2638_1_012009 crossref_primary_10_1016_j_cor_2022_105731 crossref_primary_10_3390_met12101631 crossref_primary_10_3390_sym12010157 crossref_primary_10_1016_j_promfg_2020_10_201 crossref_primary_10_1007_s10845_020_01547_4 |
| Cites_doi | 10.1016/j.ins.2011.06.004 10.1109/TASE.2013.2274517 10.1016/j.ins.2015.09.042 10.14743/apem2016.4.228 10.1016/j.cie.2015.12.004 10.1109/4235.996017 10.5545/sv-jme.2016.3545 10.1016/j.promfg.2017.07.309 10.1016/j.ins.2009.12.028 10.1109/TIE.2011.2169637 10.2507/IJSIMM16(4)7.400 10.2507/28th.daaam.proceedings.106 10.1016/j.automatica.2012.09.011 10.1016/S0378-4754(02)00019-8 10.1016/j.ins.2016.07.057 10.1016/j.ijpe.2012.03.034 10.1080/00207543.2011.555427 10.2507/IJSIMM16(1)5.368 10.1109/SIS.2003.1202243 |
| ContentType | Journal Article |
| Copyright | 2018 |
| Copyright_xml | – notice: 2018 |
| DBID | 6I. AAFTH AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1016/j.promfg.2018.10.142 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2351-9789 |
| EndPage | 902 |
| ExternalDocumentID | 10.1016/j.promfg.2018.10.142 10_1016_j_promfg_2018_10_142 S2351978918312629 |
| GroupedDBID | 0R~ 0SF 457 6I. AACTN AAEDW AAFTH AALRI AAXUO ABMAC ACGFS ADBBV ADEZE AEXQZ AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ EBS EJD FDB KQ8 M~E NCXOZ O9- OK1 ROL SSZ AAYWO AAYXX ACVFH ADCNI ADVLN AEUPX AFPUW AIGII AKBMS AKRWK AKYEP CITATION ADTOC UNPAY |
| ID | FETCH-LOGICAL-c395t-8b1b437aafe843f3b0d086c48fe2cb9d2490ed9351ab1b0d67db5e8785cd8e683 |
| IEDL.DBID | UNPAY |
| ISSN | 2351-9789 |
| IngestDate | Tue Aug 19 19:33:49 EDT 2025 Thu Apr 24 23:08:11 EDT 2025 Tue Jul 01 00:35:36 EDT 2025 Wed May 17 01:05:35 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | Flexible Job Shop Scheduling Problem Improved Heuristic Kalman Algorithm Multi-Objective Optimization |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. cc-by-nc-nd |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c395t-8b1b437aafe843f3b0d086c48fe2cb9d2490ed9351ab1b0d67db5e8785cd8e683 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.promfg.2018.10.142 |
| PageCount | 8 |
| ParticipantIDs | unpaywall_primary_10_1016_j_promfg_2018_10_142 crossref_primary_10_1016_j_promfg_2018_10_142 crossref_citationtrail_10_1016_j_promfg_2018_10_142 elsevier_sciencedirect_doi_10_1016_j_promfg_2018_10_142 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2018 2018-00-00 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – year: 2018 text: 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Procedia manufacturing |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Pinedo (bib0003) 2012 Singh, Mahapatra (bib00022) 2016; 93 Kacem, Hammadi, Borne (bib0008) 2002; 60 R. Ojstersek, B. Buchmeister, Use of Simulation Software Environments for The Purpose of Production Optimization, Annals of DAAAM & Proceedings, 28 (2017). Zhang, Gong, Ding (bib00020) 2012; 192 R. Ojstersek, H. Zhang, I. Palcic, B. Buchmeister, Use of Heuristic Kalman Algorithm for JSSPin A. Andraš (Ed.), XVII International Scientific Conference on Industrial Systems, Faculty of Technical Sciences, Novi Sad, Serbia, (2017) 72–77. Yuan, Xu (bib0001) 2015; 12 Mousavi, Yap, Musa (bib00012) 2017; 16 Lin, Wang (bib00015) 2013; 49 Toscano, Lyonnet (bib00013) 2010; 180 Xu, Wang, Wang (bib00023) 2013 Palacios, Puente, Vela, González-Rodríguez (bib00018) 2016; 329 Tang, Gong, Liu, Zhang (bib00011) 2016; 11 Y. Marinakis, M. Marinaki, A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem, M. Dorigo, M. Birattari, C. Blum, A. L. Christensen, A. P. Engelbrecht, R. Groß, T. Stützle (Ed.), Swarm Intelligence: 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012. Proceedings, Springer Berlin Heidelberg, Berlin, Heidelberg, (2012)180–187. (accessed: 20-10-1999). Li, Yao, Zhou (bib00010) 2016; 62 E. Pérez, Job Shop Schedulind Problem: Benchmarking Instances, available at M. Mastrolilli, Flexible Job Shop Problem, available at Chiang, Lin (bib00026) 2013; 141 Toscano, Lyonnet (bib00014) 2012; 59 Silva, Ribeiro, Coelho, Magalhães, Neto (bib0007) 2017; 11 Zhang, Liu, Moraca, Ojstersek (bib0005) 2017; 16 Deb, Pratap, Agarwal, Meyarivan (bib00021) 2002; 6 Li, Pan, Chen (bib0009) 2012; 50 S. Mostaghim, J. Teich, Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO), Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS’03 (Cat. No.03EX706), IEEE, 2 (2003) 26–33. V. T’kindt, J.-C. Billaut, Multicriteria Scheduling, Springer-Verlag, Berlin/Heidelberg, (2006). Pakrashi, Chaudhuri (bib00016) 2016; 369 Glover, Kochenberger (bib0004) 2006 (accessed: 07-06-2011). Li (10.1016/j.promfg.2018.10.142_bib0009) 2012; 50 Silva (10.1016/j.promfg.2018.10.142_bib0007) 2017; 11 Xu (10.1016/j.promfg.2018.10.142_bib00023) 2013 10.1016/j.promfg.2018.10.142_bib00019 Toscano (10.1016/j.promfg.2018.10.142_bib00014) 2012; 59 Zhang (10.1016/j.promfg.2018.10.142_bib0005) 2017; 16 Pakrashi (10.1016/j.promfg.2018.10.142_bib00016) 2016; 369 10.1016/j.promfg.2018.10.142_bib00025 10.1016/j.promfg.2018.10.142_bib00024 Lin (10.1016/j.promfg.2018.10.142_bib00015) 2013; 49 10.1016/j.promfg.2018.10.142_bib00027 Zhang (10.1016/j.promfg.2018.10.142_bib00020) 2012; 192 Kacem (10.1016/j.promfg.2018.10.142_bib0008) 2002; 60 Singh (10.1016/j.promfg.2018.10.142_bib00022) 2016; 93 Li (10.1016/j.promfg.2018.10.142_bib00010) 2016; 62 Pinedo (10.1016/j.promfg.2018.10.142_bib0003) 2012 Tang (10.1016/j.promfg.2018.10.142_bib00011) 2016; 11 10.1016/j.promfg.2018.10.142_bib0002 Yuan (10.1016/j.promfg.2018.10.142_bib0001) 2015; 12 10.1016/j.promfg.2018.10.142_bib0006 Mousavi (10.1016/j.promfg.2018.10.142_bib00012) 2017; 16 10.1016/j.promfg.2018.10.142_bib00017 Toscano (10.1016/j.promfg.2018.10.142_bib00013) 2010; 180 Deb (10.1016/j.promfg.2018.10.142_bib00021) 2002; 6 Chiang (10.1016/j.promfg.2018.10.142_bib00026) 2013; 141 Palacios (10.1016/j.promfg.2018.10.142_bib00018) 2016; 329 Glover (10.1016/j.promfg.2018.10.142_bib0004) 2006 |
| References_xml | – volume: 60 start-page: 245 year: 2002 end-page: 276 ident: bib0008 article-title: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic publication-title: Mathematics and Computers in Simulation – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: bib00021 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation – volume: 16 start-page: 644 year: 2017 end-page: 657 ident: bib0005 article-title: An Effective Use of Hybrid Metaheuristics Algorithm for Job Shop Scheduling Problem publication-title: International Journal of Simulation Modelling – volume: 59 start-page: 4456 year: 2012 end-page: 4464 ident: bib00014 article-title: A Kalman Optimization Approach for Solving Some Industrial Electronics Problems publication-title: IEEE Transactions on Industrial Electronics – volume: 49 start-page: 9 year: 2013 end-page: 16 ident: bib00015 article-title: Scheduling parallel Kalman filters for multiple processes publication-title: Automatica – reference: Y. Marinakis, M. Marinaki, A Hybrid Particle Swarm Optimization Algorithm for the Open Vehicle Routing Problem, M. Dorigo, M. Birattari, C. Blum, A. L. Christensen, A. P. Engelbrecht, R. Groß, T. Stützle (Ed.), Swarm Intelligence: 8th International Conference, ANTS 2012, Brussels, Belgium, September 12-14, 2012. Proceedings, Springer Berlin Heidelberg, Berlin, Heidelberg, (2012)180–187. – year: 2012 ident: bib0003 publication-title: Scheduling: Theory, Algorithms, and Systems – year: 2006 ident: bib0004 publication-title: Handbook of metaheuristics – volume: 141 start-page: 87 year: 2013 end-page: 98 ident: bib00026 article-title: A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling publication-title: International Journal of Production Economics – volume: 180 start-page: 1955 year: 2010 end-page: 1966 ident: bib00013 article-title: A new heuristic approach for non-convex optimization problems publication-title: Information Sciences – reference: (accessed: 20-10-1999). – volume: 192 start-page: 213 year: 2012 end-page: 227 ident: bib00020 article-title: A bare-bones multi-objective particle swarm optimization algorithm for environmental/economic dispatch publication-title: Information Sciences – reference: V. T’kindt, J.-C. Billaut, Multicriteria Scheduling, Springer-Verlag, Berlin/Heidelberg, (2006). – volume: 12 start-page: 336 year: 2015 end-page: 353 ident: bib0001 article-title: Multiobjective flexible job shop scheduling using memetic algorithms publication-title: IEEE Transactions on Automation Science and Engineering – reference: M. Mastrolilli, Flexible Job Shop Problem, available at: – reference: S. Mostaghim, J. Teich, Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO), Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS’03 (Cat. No.03EX706), IEEE, 2 (2003) 26–33. – volume: 50 start-page: 1063 year: 2012 end-page: 1078 ident: bib0009 article-title: A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems publication-title: International Journal of Production Research – volume: 329 start-page: 736 year: 2016 end-page: 752 ident: bib00018 article-title: Benchmarks for fuzzy job shop problems publication-title: Information Sciences – volume: 93 start-page: 36 year: 2016 end-page: 44 ident: bib00022 article-title: A quantum behaved particle swarm optimization for flexible job shop scheduling publication-title: Computers & Industrial Engineering – reference: (accessed: 07-06-2011). – volume: 11 start-page: 1767 year: 2017 end-page: 1773 ident: bib0007 article-title: Job shop flow time prediction using neural networks publication-title: Procedia Manufacturing – volume: 369 start-page: 704 year: 2016 end-page: 717 ident: bib00016 article-title: A Kalman filtering induced heuristic optimization based partitional data clustering publication-title: Information Sciences – reference: R. Ojstersek, H. Zhang, I. Palcic, B. Buchmeister, Use of Heuristic Kalman Algorithm for JSSPin A. Andraš (Ed.), XVII International Scientific Conference on Industrial Systems, Faculty of Technical Sciences, Novi Sad, Serbia, (2017) 72–77. – volume: 62 start-page: 577 year: 2016 end-page: 590 ident: bib00010 article-title: Multi-objective optimization of cloud manufacturing service composition with cloud-entropy enhanced genetic algorithm publication-title: Strojniški vestnik-Journal of Mechanical Engineering – volume: 11 start-page: 299 year: 2016 end-page: 310 ident: bib00011 article-title: Applying multi-phase particle swarm optimization to solve bulk cargo port scheduling problem publication-title: Advances in Production Engineering & Management – reference: E. Pérez, Job Shop Schedulind Problem: Benchmarking Instances, available at: – start-page: 128 year: 2013 end-page: 134 ident: bib00023 article-title: An effective shuffled frog-leaping algorithm for the flexible job-shop scheduling problem publication-title: 2013 IEEE Symposium on Computational Intelligence in Control and Automation (CICA) – reference: R. Ojstersek, B. Buchmeister, Use of Simulation Software Environments for The Purpose of Production Optimization, Annals of DAAAM & Proceedings, 28 (2017). – volume: 16 start-page: 58 year: 2017 end-page: 71 ident: bib00012 article-title: A Fuzzy Hybrid GA-PSO Algorithm for Multi-Objective AGV Scheduling in FMS publication-title: International Journal of Simulation Modelling – start-page: 128 year: 2013 ident: 10.1016/j.promfg.2018.10.142_bib00023 article-title: An effective shuffled frog-leaping algorithm for the flexible job-shop scheduling problem – volume: 192 start-page: 213 year: 2012 ident: 10.1016/j.promfg.2018.10.142_bib00020 article-title: A bare-bones multi-objective particle swarm optimization algorithm for environmental/economic dispatch publication-title: Information Sciences doi: 10.1016/j.ins.2011.06.004 – volume: 12 start-page: 336 year: 2015 ident: 10.1016/j.promfg.2018.10.142_bib0001 article-title: Multiobjective flexible job shop scheduling using memetic algorithms publication-title: IEEE Transactions on Automation Science and Engineering doi: 10.1109/TASE.2013.2274517 – ident: 10.1016/j.promfg.2018.10.142_bib00024 – volume: 329 start-page: 736 year: 2016 ident: 10.1016/j.promfg.2018.10.142_bib00018 article-title: Benchmarks for fuzzy job shop problems publication-title: Information Sciences doi: 10.1016/j.ins.2015.09.042 – year: 2006 ident: 10.1016/j.promfg.2018.10.142_bib0004 – year: 2012 ident: 10.1016/j.promfg.2018.10.142_bib0003 – volume: 11 start-page: 299 year: 2016 ident: 10.1016/j.promfg.2018.10.142_bib00011 article-title: Applying multi-phase particle swarm optimization to solve bulk cargo port scheduling problem publication-title: Advances in Production Engineering & Management doi: 10.14743/apem2016.4.228 – volume: 93 start-page: 36 year: 2016 ident: 10.1016/j.promfg.2018.10.142_bib00022 article-title: A quantum behaved particle swarm optimization for flexible job shop scheduling publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2015.12.004 – ident: 10.1016/j.promfg.2018.10.142_bib0002 – volume: 6 start-page: 182 year: 2002 ident: 10.1016/j.promfg.2018.10.142_bib00021 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.996017 – volume: 62 start-page: 577 year: 2016 ident: 10.1016/j.promfg.2018.10.142_bib00010 article-title: Multi-objective optimization of cloud manufacturing service composition with cloud-entropy enhanced genetic algorithm publication-title: Strojniški vestnik-Journal of Mechanical Engineering doi: 10.5545/sv-jme.2016.3545 – volume: 11 start-page: 1767 year: 2017 ident: 10.1016/j.promfg.2018.10.142_bib0007 article-title: Job shop flow time prediction using neural networks publication-title: Procedia Manufacturing doi: 10.1016/j.promfg.2017.07.309 – volume: 180 start-page: 1955 year: 2010 ident: 10.1016/j.promfg.2018.10.142_bib00013 article-title: A new heuristic approach for non-convex optimization problems publication-title: Information Sciences doi: 10.1016/j.ins.2009.12.028 – ident: 10.1016/j.promfg.2018.10.142_bib00025 – volume: 59 start-page: 4456 year: 2012 ident: 10.1016/j.promfg.2018.10.142_bib00014 article-title: A Kalman Optimization Approach for Solving Some Industrial Electronics Problems publication-title: IEEE Transactions on Industrial Electronics doi: 10.1109/TIE.2011.2169637 – volume: 16 start-page: 644 year: 2017 ident: 10.1016/j.promfg.2018.10.142_bib0005 article-title: An Effective Use of Hybrid Metaheuristics Algorithm for Job Shop Scheduling Problem publication-title: International Journal of Simulation Modelling doi: 10.2507/IJSIMM16(4)7.400 – ident: 10.1016/j.promfg.2018.10.142_bib00017 doi: 10.2507/28th.daaam.proceedings.106 – volume: 49 start-page: 9 year: 2013 ident: 10.1016/j.promfg.2018.10.142_bib00015 article-title: Scheduling parallel Kalman filters for multiple processes publication-title: Automatica doi: 10.1016/j.automatica.2012.09.011 – ident: 10.1016/j.promfg.2018.10.142_bib0006 – volume: 60 start-page: 245 year: 2002 ident: 10.1016/j.promfg.2018.10.142_bib0008 article-title: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic publication-title: Mathematics and Computers in Simulation doi: 10.1016/S0378-4754(02)00019-8 – volume: 369 start-page: 704 year: 2016 ident: 10.1016/j.promfg.2018.10.142_bib00016 article-title: A Kalman filtering induced heuristic optimization based partitional data clustering publication-title: Information Sciences doi: 10.1016/j.ins.2016.07.057 – ident: 10.1016/j.promfg.2018.10.142_bib00019 – volume: 141 start-page: 87 year: 2013 ident: 10.1016/j.promfg.2018.10.142_bib00026 article-title: A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2012.03.034 – volume: 50 start-page: 1063 year: 2012 ident: 10.1016/j.promfg.2018.10.142_bib0009 article-title: A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.555427 – volume: 16 start-page: 58 year: 2017 ident: 10.1016/j.promfg.2018.10.142_bib00012 article-title: A Fuzzy Hybrid GA-PSO Algorithm for Multi-Objective AGV Scheduling in FMS publication-title: International Journal of Simulation Modelling doi: 10.2507/IJSIMM16(1)5.368 – ident: 10.1016/j.promfg.2018.10.142_bib00027 doi: 10.1109/SIS.2003.1202243 |
| SSID | ssj0001626679 |
| Score | 2.181104 |
| Snippet | The Flexible Job Shop Scheduling Problem (FJSSP), as a typical NP-hard optimization problem, has a significant value in manufacturing environment. This paper... |
| SourceID | unpaywall crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 895 |
| SubjectTerms | Flexible Job Shop Scheduling Problem Improved Heuristic Kalman Algorithm Multi-Objective Optimization |
| Title | Improved Heuristic Kalman Algorithm for Solving Multi-Objective Flexible Job Shop Scheduling Problem |
| URI | https://dx.doi.org/10.1016/j.promfg.2018.10.142 https://doi.org/10.1016/j.promfg.2018.10.142 |
| UnpaywallVersion | publishedVersion |
| Volume | 17 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2351-9789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001626679 issn: 2351-9789 databaseCode: KQ8 dateStart: 20150101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2351-9789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001626679 issn: 2351-9789 databaseCode: M~E dateStart: 20150101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 2351-9789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001626679 issn: 2351-9789 databaseCode: AKRWK dateStart: 20150101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA6lPXjygYoVlRw8mrI22d3kWMRSLD6wFvW05Nlat7ulbBH99SbNblFBrNeQYcPMMPkmO_MNAKeMM0xsooBCGQSIYMmRNbNBggXCMN3GxrgH_eubqDckV0_hUw2cVb0w3_7fL-uwbCCZmpErwqItt0pswG1EoUXeddAY3tx1npfz49y0-JiyqjvuF9Hfbp-NRTbj7288Tb_cLt0tcF2dyxeVvLYWhWjJjx-UjesefBtsljATdrxf7ICaznaB8i8IWsGeXniGZtjn6ZRnsJOO8vlLMZ5CC2LhIE_dOwNcdueiWzHxURF2HXumSDW8ygUcjPMZHFibK1fMPoJ3fjTNHhh2Lx8ueqicsoAkZmGBqDgXBMecG00JNlgEyqY5klCj21IwZfOzQCtmFcztzkBFsRKhpjF1tAI6ongf1LM80wcAMh1QYSGPIqEhRBNuk7soUG0pLeyUKm4CXGk_kSUFuZuEkSZVrdkk8VpLnNaWq6TdBGglNfMUHH_sjyvDJiWM8PAgsTb6Q7K18oO1PnX4X4EjUC_mC31sgUwhTkCj079_7J-UfvwJW7r0Uw |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9je_DJD1ScqOTBRzPqkrbJ4xDHmDgHczCfSj6ns2vH6BD9602Wdqgg09eQo-HuuPwuvfsdAJeMM0xsooBCGQSIYMmRNbNBggXCMN3GxrgH_ftB1BuT_iSc1MBV1Qvz7f_9ug7LBpK5mboiLNpyq8QG3EYUWuRdB43xYNh5Ws-Pc9PiY8qq7rhfRH-7fXZW2YK_v_E0_XK7dPfAfXUuX1Ty2loVoiU_flA2_vXg-2C3hJmw4_3iANR0dgiUf0HQCvb0yjM0wzueznkGO-k0X74Uz3NoQSwc5al7Z4Dr7lz0IGY-KsKuY88UqYb9XMDRc76AI2tz5YrZp3DoR9McgXH39vGmh8opC0hiFhaIimtBcMy50ZRgg0WgbJojCTW6LQVTNj8LtGJWwdzuDFQUKxFqGlNHK6Ajio9BPcszfQIg0wEVFvIoEhpCNOE2uYsC1ZbSwk6p4ibAlfYTWVKQu0kYaVLVms0Sr7XEaW29StpNgDZSC0_BsWV_XBk2KWGEhweJtdEWydbGD_70qdP_CpyBerFc6XMLZApxUfrvJ8C88rA |
| 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=Improved+Heuristic+Kalman+Algorithm+for+Solving+Multi-Objective+Flexible+Job+Shop+Scheduling+Problem&rft.jtitle=Procedia+manufacturing&rft.au=Robert%2C+Ojstersek&rft.au=Hankun%2C+Zhang&rft.au=Shifeng%2C+Liu&rft.au=Borut%2C+Buchmeister&rft.date=2018&rft.pub=Elsevier+B.V&rft.issn=2351-9789&rft.eissn=2351-9789&rft.volume=17&rft.spage=895&rft.epage=902&rft_id=info:doi/10.1016%2Fj.promfg.2018.10.142&rft.externalDocID=S2351978918312629 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2351-9789&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2351-9789&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2351-9789&client=summon |