A Mathematical Model for the Flexible Job Shop Scheduling Problem With Availability Constraints
We tackle the Flexible Job Shop Problem (FJSSP) subject to availability constraints due to maintenance tasks on machines. Previous studies explored meta-heuristic methods to address this problem and solved small-sized instances generated from classical FJSSP benchmark. We first introduce a new bench...
Saved in:
| Published in | IFAC-PapersOnLine Vol. 56; no. 2; pp. 5388 - 5393 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.01.2023
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2405-8963 2405-8971 2405-8963 |
| DOI | 10.1016/j.ifacol.2023.10.186 |
Cover
| Abstract | We tackle the Flexible Job Shop Problem (FJSSP) subject to availability constraints due to maintenance tasks on machines. Previous studies explored meta-heuristic methods to address this problem and solved small-sized instances generated from classical FJSSP benchmark. We first introduce a new benchmark, comprising more than 2000 instances, for the problem based on the well-known FJSSP benchmarks. A mixed integer model is then developed to solve this problem. We carry out a computational study on the proposed benchmark and analyze its performances. Results show that our model can solve small and medium size instances efficiently. We also observe important variation in complexity depending on the class of instance which makes the proposed benchmark interesting to evaluate our approach and further improve the solving process in future works. |
|---|---|
| AbstractList | We tackle the Flexible Job Shop Problem (FJSSP) subject to availability constraints due to maintenance tasks on machines. Previous studies explored meta-heuristic methods to address this problem and solved small-sized instances generated from classical FJSSP benchmark. We first introduce a new benchmark, comprising more than 2000 instances, for the problem based on the well-known FJSSP benchmarks. A mixed integer model is then developed to solve this problem. We carry out a computational study on the proposed benchmark and analyze its performances. Results show that our model can solve small and medium size instances efficiently. We also observe important variation in complexity depending on the class of instance which makes the proposed benchmark interesting to evaluate our approach and further improve the solving process in future works. |
| Author | Perroux, Tom Arbaoui, Taha Merghem-Boulahia, Leila |
| Author_xml | – sequence: 1 givenname: Tom surname: Perroux fullname: Perroux, Tom email: tom.perroux@utt.fr – sequence: 2 givenname: Taha surname: Arbaoui fullname: Arbaoui, Taha email: taha.arbaoui@utt.fr – sequence: 3 givenname: Leila surname: Merghem-Boulahia fullname: Merghem-Boulahia, Leila email: leila.merghem-boulahia@utt.fr |
| BackLink | https://utt.hal.science/hal-04427225$$DView record in HAL |
| BookMark | eNqNUMFOwzAMjRBIDNgfcMiVw0aaJllzQZomYKAhkABxjNzWoZmyZkrLYH9PR5HghDjZfn7vWX5HZL8ONRJymrBxwhJ1vhw7C0XwY854Ot6hmdojAy6YHGVapfu_-kMybJolY4xrJSY6GxAzpXfQVriC1hXg6V0o0VMbIu1AeuXxw-Ue6W3I6WMV1vSxqLB8865-pQ8xdKsVfXFtRacbcB5y5127pbNQN20EV7fNCTmw4Bscftdj8nx1-TSbjxb31zez6WJUpKlsR6hQZIig7YRnQlptc4W5nDBgTCnAHLSUSTfYtGQsLbnSTDMptLYgMiXTYyJ737d6Ddt38N6so1tB3JqEmV1QZmn6oMwuqC80U53urNdV8KMI4Mx8ujA7jAnBJ5zLTdJxRc8tYmiaiPa_Jy56GXb_bxxG0xQO6wJLF7FoTRnc3waf6z6UCw |
| Cites_doi | 10.1023/A:1018930406487 10.1016/0377-2217(93)90182-M 10.1016/j.cie.2010.05.016 10.1007/s00291-018-0537-z 10.1007/s10845-007-0026-8 10.1016/S0378-4754(02)00019-8 10.1007/BF01719451 10.1016/j.ijpe.2012.04.015 10.1080/07408179508936739 10.1016/j.apm.2013.07.038 10.1007/s10845-005-0021-x 10.1007/s00500-020-05347-z 10.1007/BF02023073 10.1016/j.ijpe.2011.04.020 10.1007/BF02238804 10.1016/j.cie.2008.07.021 10.1016/j.asoc.2012.04.012 10.1007/s00170-005-0375-4 10.1016/j.asoc.2009.10.006 10.1016/j.cie.2016.10.019 10.1016/j.ijpe.2014.03.006 10.1016/j.cor.2007.02.014 10.1007/s00170-011-3610-1 10.1080/00207541003709544 |
| ContentType | Journal Article |
| Copyright | 2023 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2023 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 6I. AAFTH AAYXX CITATION 1XC VOOES ADTOC UNPAY |
| DOI | 10.1016/j.ifacol.2023.10.186 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) 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 |
| Discipline | Computer Science |
| EISSN | 2405-8963 |
| EndPage | 5393 |
| ExternalDocumentID | 10.1016/j.ifacol.2023.10.186 oai:HAL:hal-04427225v1 10_1016_j_ifacol_2023_10_186 S2405896323005372 |
| GroupedDBID | 0R~ 0SF 457 6I. AAFTH AAJQP AALRI AAXUO ABMAC ACGFS ADBBV ADVLN AEXQZ AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ ATDSJ EBS EJD FDB HX~ KQ8 O9- ROL AAYWO AAYXX CITATION 1XC VOOES ADTOC UNPAY |
| ID | FETCH-LOGICAL-c335t-e6e48eea9f72845f9fb6eb570a0066aeba9551a00f3d003d2690905499fa48653 |
| IEDL.DBID | UNPAY |
| ISSN | 2405-8963 2405-8971 |
| IngestDate | Sun Oct 26 04:13:24 EDT 2025 Tue Oct 14 20:18:24 EDT 2025 Wed Oct 01 03:40:56 EDT 2025 Sat Oct 26 15:44:17 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Issue | 2 |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c335t-e6e48eea9f72845f9fb6eb570a0066aeba9551a00f3d003d2690905499fa48653 |
| ORCID | 0009-0005-2223-4080 0000-0001-8984-2375 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.ifacol.2023.10.186 |
| PageCount | 6 |
| ParticipantIDs | unpaywall_primary_10_1016_j_ifacol_2023_10_186 hal_primary_oai_HAL_hal_04427225v1 crossref_primary_10_1016_j_ifacol_2023_10_186 elsevier_sciencedirect_doi_10_1016_j_ifacol_2023_10_186 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-01 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | IFAC-PapersOnLine |
| PublicationYear | 2023 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Aggoune (bib0001) 2004 Brucker, Schlie (bib0006) 1990; 45 Xing, Chen, Wang, Zhao, Xiong (bib0025) 2010; 10 Wang, Zhou, Xu, Wang, Liu (bib0023) 2012; 60 Xiong, Xing, Chen (bib0026) 2013; 141 Al-Hinai, ElMekkawy (bib0002) 2011; 132 Rossi (bib0019) 2014; 153 Wang, Sheng, Lu, Yin, Zhao, Lu, Luo, Fu (bib0022) 2021; 25 Li, Pan (bib0015) 2012; 12 Taillard (bib0021) 1993; 64 El Khoukhi, Boukachour, Alaoui (bib0008) 2017; 106 Barnes, Chambers (bib0003) 1995; 27 Brandimarte (bib0005) 1993; 41 Li, Pan, Tasgetiren (bib0016) 2014; 38 Behnke, Geiger (bib0004) 2012 Zhang, Shao, Li, Gao (bib0027) 2009; 56 Pezzella, Morganti, Ciaschetti (bib0017) 2008; 35 Fattahi, Saidi Mehrabad, Jolai (bib0009) 2007; 18 Kacem, Hammadi, Borne (bib0013) 2002; 60 Wang, Yu (bib0024) 2010; 59 Jing, Hua, Yi (bib0012) 2017 Dauzère-Pérès, Paulli (bib0007) 1997; 70 Hurink, Jurisch, Thole (bib0011) 1994; 15 Saidi-Mehrabad, Fattahi (bib0020) 2007; 32 Gao, Gen, Sun (bib0010) 2006; 17 Rajkumar, Asokan, Anilkumar, Page (bib0018) 2011; 49 Ziaee (bib0028) 2014; 1 Kress, Müller, Nossack (bib0014) 2019; 41 Hurink (10.1016/j.ifacol.2023.10.186_bib0011) 1994; 15 Wang (10.1016/j.ifacol.2023.10.186_bib0023) 2012; 60 Barnes (10.1016/j.ifacol.2023.10.186_bib0003) 1995; 27 Li (10.1016/j.ifacol.2023.10.186_bib0016) 2014; 38 Rossi (10.1016/j.ifacol.2023.10.186_bib0019) 2014; 153 Rajkumar (10.1016/j.ifacol.2023.10.186_bib0018) 2011; 49 El Khoukhi (10.1016/j.ifacol.2023.10.186_bib0008) 2017; 106 Ziaee (10.1016/j.ifacol.2023.10.186_bib0028) 2014; 1 Aggoune (10.1016/j.ifacol.2023.10.186_bib0001) 2004 Brandimarte (10.1016/j.ifacol.2023.10.186_bib0005) 1993; 41 Xiong (10.1016/j.ifacol.2023.10.186_bib0026) 2013; 141 Dauzère-Pérès (10.1016/j.ifacol.2023.10.186_bib0007) 1997; 70 Xing (10.1016/j.ifacol.2023.10.186_bib0025) 2010; 10 Wang (10.1016/j.ifacol.2023.10.186_bib0022) 2021; 25 Fattahi (10.1016/j.ifacol.2023.10.186_bib0009) 2007; 18 Wang (10.1016/j.ifacol.2023.10.186_bib0024) 2010; 59 Gao (10.1016/j.ifacol.2023.10.186_bib0010) 2006; 17 Jing (10.1016/j.ifacol.2023.10.186_bib0012) 2017 Pezzella (10.1016/j.ifacol.2023.10.186_bib0017) 2008; 35 Saidi-Mehrabad (10.1016/j.ifacol.2023.10.186_bib0020) 2007; 32 Kress (10.1016/j.ifacol.2023.10.186_bib0014) 2019; 41 Taillard (10.1016/j.ifacol.2023.10.186_bib0021) 1993; 64 Li (10.1016/j.ifacol.2023.10.186_bib0015) 2012; 12 Al-Hinai (10.1016/j.ifacol.2023.10.186_bib0002) 2011; 132 Behnke (10.1016/j.ifacol.2023.10.186_bib0004) 2012 Zhang (10.1016/j.ifacol.2023.10.186_bib0027) 2009; 56 Kacem (10.1016/j.ifacol.2023.10.186_bib0013) 2002; 60 Brucker (10.1016/j.ifacol.2023.10.186_bib0006) 1990; 45 |
| References_xml | – start-page: 137 year: 2017 end-page: 141 ident: bib0012 article-title: Multi-objective integrated optimization problem of preventive maintenance planning and flexible job-shop scheduling – volume: 153 start-page: 253 year: 2014 end-page: 267 ident: bib0019 article-title: Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships publication-title: International Journal of Production Economics – volume: 1 start-page: 19 year: 2014 end-page: 31 ident: bib0028 article-title: An efficient heuristic algorithm for flexible job shop scheduling with maintenance constraints publication-title: Applied Mathematics and Sciences: An International Journal (MathSJ) – volume: 45 start-page: 369 year: 1990 end-page: 375 ident: bib0006 article-title: Job-shop scheduling with multi-purpose machines publication-title: Computing – volume: 56 start-page: 1309 year: 2009 end-page: 1318 ident: bib0027 article-title: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem publication-title: Computers & Industrial Engineering – volume: 15 start-page: 205 year: 1994 end-page: 215 ident: bib0011 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations-Research-Spektrum – volume: 60 start-page: 303 year: 2012 end-page: 315 ident: bib0023 article-title: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem publication-title: The International Journal of Advanced Manufacturing Technology – volume: 27 start-page: 257 year: 1995 end-page: 263 ident: bib0003 article-title: Solving the job shop scheduling problem with tabu search publication-title: IIE transactions – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: bib0021 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research – volume: 41 start-page: 179 year: 2019 end-page: 217 ident: bib0014 article-title: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times publication-title: OR Spectrum – volume: 60 start-page: 245 year: 2002 end-page: 276 ident: bib0013 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: 41 start-page: 157 year: 1993 end-page: 183 ident: bib0005 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations research – volume: 25 start-page: 2863 year: 2021 end-page: 2889 ident: bib0022 article-title: A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes publication-title: Soft Computing – start-page: 253 year: 2004 end-page: 259 ident: bib0001 article-title: Two-job shop scheduling problems with availability constraints publication-title: ICAPS – volume: 106 start-page: 236 year: 2017 end-page: 255 ident: bib0008 article-title: The “dual-ants colony”: A novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance publication-title: Computers & Industrial Engineering – volume: 59 start-page: 436 year: 2010 end-page: 447 ident: bib0024 article-title: An effective heuristic for flexible job-shop scheduling problem with maintenance activities publication-title: Computers & Industrial Engineering – volume: 17 start-page: 493 year: 2006 end-page: 507 ident: bib0010 article-title: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm publication-title: Journal of Intelligent Manufacturing – volume: 10 start-page: 888 year: 2010 end-page: 896 ident: bib0025 article-title: A knowledge-based ant colony optimization for flexible job shop scheduling problems publication-title: Applied Soft Computing – volume: 35 start-page: 3202 year: 2008 end-page: 3212 ident: bib0017 article-title: A genetic algorithm for the flexible job-shop scheduling problem publication-title: Computers & operations research – volume: 12 start-page: 2896 year: 2012 end-page: 2912 ident: bib0015 article-title: Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity publication-title: Applied soft computing – volume: 49 start-page: 2409 year: 2011 end-page: 2423 ident: bib0018 article-title: A grasp algorithm for flexible job-shop scheduling problem with limited resource constraints publication-title: International Journal of Production Research – volume: 132 start-page: 279 year: 2011 end-page: 291 ident: bib0002 article-title: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm publication-title: International Journal of Production Economics – volume: 70 start-page: 281 year: 1997 end-page: 306 ident: bib0007 article-title: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search publication-title: Annals of Operations Research – volume: 141 start-page: 112 year: 2013 end-page: 126 ident: bib0026 article-title: Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns publication-title: International Journal of Production Economics – volume: 38 start-page: 1111 year: 2014 end-page: 1132 ident: bib0016 article-title: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities publication-title: Applied Mathematical Modelling – year: 2012 ident: bib0004 article-title: Test instances for the flexible job shop scheduling problem with work centers – volume: 32 start-page: 563 year: 2007 end-page: 570 ident: bib0020 article-title: Flexible job shop scheduling with tabu search algorithms publication-title: The international journal of Advanced Manufacturing technology – volume: 18 start-page: 331 year: 2007 end-page: 342 ident: bib0009 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: Journal of intelligent manufacturing – start-page: 253 year: 2004 ident: 10.1016/j.ifacol.2023.10.186_bib0001 article-title: Two-job shop scheduling problems with availability constraints – volume: 70 start-page: 281 year: 1997 ident: 10.1016/j.ifacol.2023.10.186_bib0007 article-title: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search publication-title: Annals of Operations Research doi: 10.1023/A:1018930406487 – volume: 64 start-page: 278 issue: 2 year: 1993 ident: 10.1016/j.ifacol.2023.10.186_bib0021 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90182-M – volume: 59 start-page: 436 issue: 3 year: 2010 ident: 10.1016/j.ifacol.2023.10.186_bib0024 article-title: An effective heuristic for flexible job-shop scheduling problem with maintenance activities publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2010.05.016 – volume: 41 start-page: 179 issue: 1 year: 2019 ident: 10.1016/j.ifacol.2023.10.186_bib0014 article-title: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times publication-title: OR Spectrum doi: 10.1007/s00291-018-0537-z – volume: 18 start-page: 331 issue: 3 year: 2007 ident: 10.1016/j.ifacol.2023.10.186_bib0009 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: Journal of intelligent manufacturing doi: 10.1007/s10845-007-0026-8 – volume: 1 start-page: 19 issue: 1 year: 2014 ident: 10.1016/j.ifacol.2023.10.186_bib0028 article-title: An efficient heuristic algorithm for flexible job shop scheduling with maintenance constraints publication-title: Applied Mathematics and Sciences: An International Journal (MathSJ) – volume: 60 start-page: 245 issue: 3-5 year: 2002 ident: 10.1016/j.ifacol.2023.10.186_bib0013 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: 15 start-page: 205 issue: 4 year: 1994 ident: 10.1016/j.ifacol.2023.10.186_bib0011 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations-Research-Spektrum doi: 10.1007/BF01719451 – volume: 141 start-page: 112 issue: 1 year: 2013 ident: 10.1016/j.ifacol.2023.10.186_bib0026 article-title: Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2012.04.015 – volume: 27 start-page: 257 issue: 2 year: 1995 ident: 10.1016/j.ifacol.2023.10.186_bib0003 article-title: Solving the job shop scheduling problem with tabu search publication-title: IIE transactions doi: 10.1080/07408179508936739 – volume: 38 start-page: 1111 issue: 3 year: 2014 ident: 10.1016/j.ifacol.2023.10.186_bib0016 article-title: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2013.07.038 – volume: 17 start-page: 493 issue: 4 year: 2006 ident: 10.1016/j.ifacol.2023.10.186_bib0010 article-title: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-005-0021-x – year: 2012 ident: 10.1016/j.ifacol.2023.10.186_bib0004 – volume: 25 start-page: 2863 year: 2021 ident: 10.1016/j.ifacol.2023.10.186_bib0022 article-title: A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes publication-title: Soft Computing doi: 10.1007/s00500-020-05347-z – volume: 41 start-page: 157 issue: 3 year: 1993 ident: 10.1016/j.ifacol.2023.10.186_bib0005 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations research doi: 10.1007/BF02023073 – volume: 132 start-page: 279 issue: 2 year: 2011 ident: 10.1016/j.ifacol.2023.10.186_bib0002 article-title: Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2011.04.020 – volume: 45 start-page: 369 issue: 4 year: 1990 ident: 10.1016/j.ifacol.2023.10.186_bib0006 article-title: Job-shop scheduling with multi-purpose machines publication-title: Computing doi: 10.1007/BF02238804 – start-page: 137 year: 2017 ident: 10.1016/j.ifacol.2023.10.186_bib0012 – volume: 56 start-page: 1309 issue: 4 year: 2009 ident: 10.1016/j.ifacol.2023.10.186_bib0027 article-title: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2008.07.021 – volume: 12 start-page: 2896 issue: 9 year: 2012 ident: 10.1016/j.ifacol.2023.10.186_bib0015 article-title: Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity publication-title: Applied soft computing doi: 10.1016/j.asoc.2012.04.012 – volume: 32 start-page: 563 issue: 5 year: 2007 ident: 10.1016/j.ifacol.2023.10.186_bib0020 article-title: Flexible job shop scheduling with tabu search algorithms publication-title: The international journal of Advanced Manufacturing technology doi: 10.1007/s00170-005-0375-4 – volume: 10 start-page: 888 issue: 3 year: 2010 ident: 10.1016/j.ifacol.2023.10.186_bib0025 article-title: A knowledge-based ant colony optimization for flexible job shop scheduling problems publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2009.10.006 – volume: 106 start-page: 236 year: 2017 ident: 10.1016/j.ifacol.2023.10.186_bib0008 article-title: The “dual-ants colony”: A novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.10.019 – volume: 153 start-page: 253 year: 2014 ident: 10.1016/j.ifacol.2023.10.186_bib0019 article-title: Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2014.03.006 – volume: 35 start-page: 3202 issue: 10 year: 2008 ident: 10.1016/j.ifacol.2023.10.186_bib0017 article-title: A genetic algorithm for the flexible job-shop scheduling problem publication-title: Computers & operations research doi: 10.1016/j.cor.2007.02.014 – volume: 60 start-page: 303 issue: 1 year: 2012 ident: 10.1016/j.ifacol.2023.10.186_bib0023 article-title: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem publication-title: The International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-011-3610-1 – volume: 49 start-page: 2409 issue: 8 year: 2011 ident: 10.1016/j.ifacol.2023.10.186_bib0018 article-title: A grasp algorithm for flexible job-shop scheduling problem with limited resource constraints publication-title: International Journal of Production Research doi: 10.1080/00207541003709544 |
| SSID | ssj0002964798 |
| Score | 1.9174404 |
| Snippet | We tackle the Flexible Job Shop Problem (FJSSP) subject to availability constraints due to maintenance tasks on machines. Previous studies explored... |
| SourceID | unpaywall hal crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 5388 |
| SubjectTerms | Computer Science Operations Research |
| Title | A Mathematical Model for the Flexible Job Shop Scheduling Problem With Availability Constraints |
| URI | https://dx.doi.org/10.1016/j.ifacol.2023.10.186 https://utt.hal.science/hal-04427225 https://doi.org/10.1016/j.ifacol.2023.10.186 |
| UnpaywallVersion | publishedVersion |
| Volume | 56 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2405-8963 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0002964798 issn: 2405-8963 databaseCode: KQ8 dateStart: 20150101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFD7h8qAvXqJGvJDG-GiXwe6Pi5EQFIJBIj4t3dYKugyiA4O_3tNdiJoQ8W3t1q07p-n5up1-H8AlD02MAiyglhriAgVDBnXwUhpaDgY_VbcCnibI9sz2UO-MjFEJroq9MD_-36d5WBMh-ZsVKfOtyFrbLEPVNBB5V6A67PXdJ6kfh7iD2k4qnJYfW41ip9ya26yLROWxTIncmscztvxgUfQt3rR2oVv0NEszeVXmia8En79IHDd9lT3YyYEncbORsg8lHh-A55LuircVz0pltIggjiVYSVqSLNOPOOlMfTIYT2dkgC4OZe76M-lnSjTkcZKMibtgkyhj_F4SqQGaKk8k74cwbN08XLdpLrlAA00zEspNrtucM0dYGLcM4Qjf5L5hqUxiE8Z95iDEwoLQQpwPwiYurh1VrjEF023T0I6gEk9jfgyEqTrOo0GDSzoaJjSG4MqwWZP5mqaLQNSAFub3ZhmzhleknL14mak8aaq01jZrYBU-8nJ0kEV9Dw39R8sLdOnqIZJQu-3eebJO1fWmhVPaolEDZeXxjfpz8t8Gp7AtS9n3mzOoJG9zfo6IJvHrUL69t-v5cP4CRxLu1w |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT4MwFD6Z24O-eIka5y2N8VEIG9DCIzEuy-KWJXNxPpECrZsStiibmb_eUy6LmizON1oolHOanq9w-n0A1yKiGAV4qDEjwgUKhgzNxUu1iLkY_AyLhSJLkO3R9tDqjOxRBW7KvTA__t9neVgTqfibdSXzratah25BjdqIvKtQG_b63pPSj0PcoTluJpxWHLNGuVNuzW3WRaKtsUqJ3J4nM7784HH8Ld609qBb9jRPM3nV52mgh5-_SBw3fZV92C2AJ_HykXIAFZEcgu-R7oq3Fc8qZbSYII4lWElaiiwziAXpTAMyGE9nZIAujlTu-jPp50o05HGSjom34JM4Z_xeEqUBmilPpO9HMGzdPdy2tUJyQQtN0041QYXlCMFdyTBu2dKVARWBzQyusAkXAXcRYmFBmhHOB1ETF9euodaYklsOtc1jqCbTRJwA4YaF82jYEIqOhkuTI7iyHd7kgWlaMpR10Erz-7OcWcMvU85e_NxUvjJVVuvQOrDSR36BDvKo76Oh_2h5hS5dPUQRare9e1_VGZbVZDilLRp10Fce36g_p_9tcAY7qpR_vzmHavo2FxeIaNLgshjIX7Np7eI |
| 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+Mathematical+Model+for+the+Flexible+Job+Shop+Scheduling+Problem+With+Availability+Constraints&rft.jtitle=IFAC-PapersOnLine&rft.au=Perroux%2C+Tom&rft.au=Arbaoui%2C+Taha&rft.au=Merghem-Boulahia%2C+Leila&rft.date=2023-01-01&rft.pub=Elsevier&rft.issn=2405-8963&rft.eissn=2405-8963&rft.volume=56&rft.issue=2&rft.spage=5388&rft.epage=5393&rft_id=info:doi/10.1016%2Fj.ifacol.2023.10.186&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-04427225v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2405-8963&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2405-8963&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2405-8963&client=summon |