An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a...
Saved in:
| Published in | Computers & industrial engineering Vol. 59; no. 3; pp. 436 - 447 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Elsevier Ltd
01.10.2010
Pergamon Press Inc |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0360-8352 1879-0550 |
| DOI | 10.1016/j.cie.2010.05.016 |
Cover
| Abstract | Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities. |
|---|---|
| AbstractList | Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities. Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities. [PUBLICATION ABSTRACT] |
| Author | Wang, Shijin Yu, Jianbo |
| Author_xml | – sequence: 1 givenname: Shijin surname: Wang fullname: Wang, Shijin email: shijinwang0223@yahoo.com.cn organization: Department of Management Science and Engineering, School of Economics & Management, Tongji University, Shanghai 200092, China – sequence: 2 givenname: Jianbo surname: Yu fullname: Yu, Jianbo organization: College of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, China |
| BookMark | eNp9kT2P1DAQhi10SOwd_AA6i4YqyziJY0dUpxNf0kk0UFFYjjNmJ8rai-0c8O_xaqmuuGo04-cZjV5fs6sQAzL2WsBegBjeLXtHuG-h9iD3dfKM7YRWYwNSwhXbQTdAozvZvmDXOS8A0MtR7NiP28DRe3SFHpAfcEuUCznuY-J-xT80rciXODX5EE88uwPO20rhJz-lWJ-O_DeVAz9aCgWDDQ65Pa-iQphfsuferhlf_a837PvHD9_uPjf3Xz99ubu9b1wnh9JY3Qk9-KG184BDN_WTbeWg_OzG0aEeWyE67B10WiEIr6BVdmx7PXmQQru-u2FvL3vrTb82zMUcKTtcVxswbtkoraDXvRSVfPOIXOKWQj3OqF4oMQqhKyQukEsx54TenBIdbfprBJhz2GYxNWxzDtuANHVSHfXIcVRsoRhKsrQ-ab6_mFgTeiBMJlekBjlTqr9i5khP2P8AnUabVw |
| CODEN | CINDDL |
| CitedBy_id | crossref_primary_10_1016_j_ijpe_2024_109163 crossref_primary_10_1080_00207543_2023_2294114 crossref_primary_10_1080_00207543_2013_784408 crossref_primary_10_1109_MCI_2015_2501552 crossref_primary_10_1007_s10845_023_02114_3 crossref_primary_10_1016_j_procir_2019_03_038 crossref_primary_10_1088_1742_6596_1325_1_012077 crossref_primary_10_3233_JIFS_220494 crossref_primary_10_1016_j_ijpe_2016_01_016 crossref_primary_10_1016_j_eswa_2022_119474 crossref_primary_10_1080_00207543_2018_1459923 crossref_primary_10_1080_0305215X_2021_1983558 crossref_primary_10_1080_00207543_2012_661089 crossref_primary_10_1016_j_eswa_2020_114495 crossref_primary_10_1016_j_ress_2021_108113 crossref_primary_10_1080_00207543_2020_1804639 crossref_primary_10_31796_ogummf_1247165 crossref_primary_10_1007_s00170_010_3140_2 crossref_primary_10_1007_s00170_013_5281_6 crossref_primary_10_1080_00207543_2017_1388933 crossref_primary_10_3390_su11010065 crossref_primary_10_1016_j_ress_2024_110447 crossref_primary_10_35378_gujs_1108155 crossref_primary_10_1016_j_asoc_2021_107312 crossref_primary_10_1142_S0218213023500410 crossref_primary_10_1080_00207543_2024_2347564 crossref_primary_10_1108_13552511211226193 crossref_primary_10_1080_0951192X_2013_834465 crossref_primary_10_1108_JQME_10_2020_0109 crossref_primary_10_1080_00207543_2018_1492752 crossref_primary_10_3182_20130619_3_RU_3018_00566 crossref_primary_10_1016_j_ifacol_2023_10_186 crossref_primary_10_1016_j_eswa_2021_115693 crossref_primary_10_1080_00207543_2015_1020174 crossref_primary_10_1016_j_ejor_2022_03_045 crossref_primary_10_1007_s12555_023_0578_1 crossref_primary_10_1007_s12652_023_04511_1 crossref_primary_10_1016_j_cor_2023_106365 crossref_primary_10_1016_j_swevo_2018_02_010 crossref_primary_10_1016_j_cie_2025_110861 crossref_primary_10_1016_j_ijpe_2012_04_015 crossref_primary_10_1016_j_ejor_2023_05_017 crossref_primary_10_1007_s43069_021_00098_5 crossref_primary_10_1016_j_ijpe_2012_11_005 crossref_primary_10_1016_j_knosys_2016_06_014 crossref_primary_10_1016_j_omega_2020_102325 crossref_primary_10_1016_j_cie_2014_03_003 crossref_primary_10_1080_00207543_2018_1444809 crossref_primary_10_4028_www_scientific_net_AMM_521_707 crossref_primary_10_1007_s10479_017_2594_0 crossref_primary_10_1016_j_asoc_2012_04_012 crossref_primary_10_1007_s00170_012_4344_4 crossref_primary_10_1016_j_ress_2012_01_005 crossref_primary_10_1111_itor_12199 crossref_primary_10_1016_j_cor_2022_105823 crossref_primary_10_1007_s12597_017_0298_5 crossref_primary_10_1002_asmb_2173 crossref_primary_10_1007_s12351_022_00733_x crossref_primary_10_1142_S0219686718500269 crossref_primary_10_1016_j_jclepro_2020_121540 crossref_primary_10_1007_s00170_015_6795_x crossref_primary_10_1016_j_cie_2011_12_013 crossref_primary_10_1007_s10732_021_09482_0 crossref_primary_10_1134_S0005117914070030 crossref_primary_10_1080_24725854_2022_2100523 crossref_primary_10_1016_j_eswa_2016_07_046 crossref_primary_10_1016_j_jmsy_2019_12_004 crossref_primary_10_3233_JIFS_191839 crossref_primary_10_1016_j_asoc_2020_106869 crossref_primary_10_1016_j_cie_2022_108786 crossref_primary_10_1016_j_cie_2016_10_019 crossref_primary_10_1016_j_rcim_2019_01_005 crossref_primary_10_1016_j_ress_2014_06_012 crossref_primary_10_1007_s00500_020_05347_z crossref_primary_10_3390_pr9081391 crossref_primary_10_4028_www_scientific_net_AMM_575_922 crossref_primary_10_1049_iet_cim_2018_0009 crossref_primary_10_1016_j_eswa_2022_118711 crossref_primary_10_1016_j_asoc_2017_04_060 crossref_primary_10_1016_j_apm_2013_07_038 crossref_primary_10_4995_ijpme_2017_6618 crossref_primary_10_1016_j_future_2024_05_058 crossref_primary_10_1155_2015_725460 crossref_primary_10_4995_wpom_v11i2_14187 crossref_primary_10_1016_j_swevo_2023_101421 crossref_primary_10_1080_00207543_2011_648280 crossref_primary_10_17482_uumfd_856513 crossref_primary_10_1051_ro_2023187 crossref_primary_10_1057_jos_2015_20 crossref_primary_10_12677_MOS_2023_126534 crossref_primary_10_1007_s10845_020_01547_4 |
| Cites_doi | 10.1016/j.omega.2008.01.001 10.1007/s10845-005-0021-x 10.1007/s00170-008-1693-0 10.1016/j.ejor.2007.06.029 10.1016/j.compind.2004.06.005 10.1108/13552510510589361 10.1109/TR.2005.845967 10.1016/j.cor.2007.02.014 10.1016/j.cie.2009.04.014 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 10.1016/j.ejor.2003.08.034 10.1007/BF02023073 10.1016/j.ress.2005.11.062 10.1007/s10951-005-6812-2 10.1016/j.ejor.2008.03.043 10.1016/j.cie.2005.01.020 10.1016/S0377-2217(03)00261-3 10.1016/j.cor.2005.01.004 10.1016/j.cie.2005.01.018 10.1016/j.ejor.2006.11.027 10.1016/S0377-2217(98)00367-1 10.1080/00207540600988105 10.1007/s00170-006-0524-4 10.1016/j.cor.2007.01.001 10.1016/S0377-2217(01)00197-7 10.1016/j.rcim.2005.11.005 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-# 10.1007/s11590-006-0041-2 10.1016/j.dam.2004.12.003 10.1016/j.cor.2006.04.007 10.1016/j.ijpe.2007.01.014 10.1016/j.cor.2005.05.034 10.1080/00207548808947840 10.1287/opre.1060.0301 10.1016/j.cor.2005.12.007 10.1080/07408170304416 10.1016/S0377-2217(98)00319-1 10.1016/j.cie.2004.09.002 10.1109/TSMCC.2002.1009117 |
| ContentType | Journal Article |
| Copyright | 2010 Elsevier Ltd Copyright Pergamon Press Inc. Oct 2010 |
| Copyright_xml | – notice: 2010 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Oct 2010 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cie.2010.05.016 |
| 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 | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| EndPage | 447 |
| ExternalDocumentID | 2106803271 10_1016_j_cie_2010_05_016 S0360835210001439 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO ABAOU ABDPE ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ADBBV ADEZE ADGUI ADMUD ADNMO ADRHT ADTZH AEBSH AECPX AEIPS AEKER AENEX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SSH SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP APXCP CITATION EFKBS EFLBG ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c356t-a83186f62ad6e63b4ba2567fdc99ce892113e4c0387e01f7027a9248bf0518c43 |
| IEDL.DBID | AIKHN |
| ISSN | 0360-8352 |
| IngestDate | Sun Sep 28 11:10:49 EDT 2025 Mon Jul 14 08:21:25 EDT 2025 Wed Oct 01 00:49:24 EDT 2025 Thu Apr 24 23:09:24 EDT 2025 Sun Apr 06 06:54:00 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Flexible job-shop scheduling problem Filtered beam search Availability constraints Preventive maintenance |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c356t-a83186f62ad6e63b4ba2567fdc99ce892113e4c0387e01f7027a9248bf0518c43 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 741719118 |
| PQPubID | 9545 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_787048451 proquest_journals_741719118 crossref_primary_10_1016_j_cie_2010_05_016 crossref_citationtrail_10_1016_j_cie_2010_05_016 elsevier_sciencedirect_doi_10_1016_j_cie_2010_05_016 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2010-10-01 |
| PublicationDateYYYYMMDD | 2010-10-01 |
| PublicationDate_xml | – month: 10 year: 2010 text: 2010-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2010 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Kubzin, Strusevich (bib18) 2006; 54 Sortrakul, Nachtmann, Cassady (bib35) 2005; 56 (pp. 89–94). Zribi, Kamel, Borne (bib41) 2008; 112 Lin, Liao (bib23) 2007; 33 Cassady, Kutanoglu (bib6) 2005; 54 Cassady, Kutanoglu (bib5) 2003; 35 Chen (bib9) 2009; 37 Valente, Alves (bib36) 2005; 48 Mohanta, Sadhu, Chakrabarti (bib27) 2007; 92 Brandimarte (bib3) 1993; 41 Pezzella, Morganti, Ciaschetti (bib31) 2008; 35 Sabuncuoglu, Bayiz (bib33) 1999; 118 Ow, Morton (bib30) 1988; 26 Breit (bib4) 2006; 33 Schmidt (bib34) 2000; 121 Gharbi, Haouari (bib13) 2005; 148 Najib, N.M., Dauzere-Peres, S., & Zaidat, A. (2002). A modified simulated annealing method for flexible job shop scheduling problem. In Wang (bib37) 2002; 139 Aggoune (bib1) 2004; 153 Liao, Sheen (bib22) 2008; 184 Lee, Chen (bib19) 2000; 47 Xia, Wu (bib39) 2005; 48 Gao, Sun, Gen (bib12) 2008; 35 Naderi, Zandieh, Ghomi (bib28) 2009; 43 Chen (bib8) 2008; 190 Ji, He, Cheng (bib15) 2007; 34 Gao, Gen, Sun (bib11) 2006; 17 Liao, Shyur, Lin (bib21) 2005; 160 Mauguiere, Billaut, Bouquard (bib25) 2005; 8 Yang, Hsu, Kuo (bib40) 2008; 35 Ruiz, Garcia-Diaz, Maroto (bib32) 2007; 34 Mellouli, Sadfi, Chu, Kacem (bib26) 2009; 197 Wang, Zhou, Xi (bib38) 2008; 46 Chan, Chung, Chan, Finke, Tiwari (bib7) 2006; 22 Graves, Lee (bib14) 1999; 46 Lee, Yu (bib20) 2008; 2 Allaoui, Artiba (bib2) 2004; 47 Chen, Liao (bib10) 2005; 11 Kacem, Hammadi, Borne (bib17) 2002; 60 Ma, Chu, Zuo (bib24) 2010; 58 Kacem, Hammadi, Borne (bib16) 2002; 32 Kubzin (10.1016/j.cie.2010.05.016_bib18) 2006; 54 Zribi (10.1016/j.cie.2010.05.016_bib41) 2008; 112 Allaoui (10.1016/j.cie.2010.05.016_bib2) 2004; 47 Gharbi (10.1016/j.cie.2010.05.016_bib13) 2005; 148 Schmidt (10.1016/j.cie.2010.05.016_bib34) 2000; 121 Mohanta (10.1016/j.cie.2010.05.016_bib27) 2007; 92 Ruiz (10.1016/j.cie.2010.05.016_bib32) 2007; 34 Lee (10.1016/j.cie.2010.05.016_bib20) 2008; 2 Sabuncuoglu (10.1016/j.cie.2010.05.016_bib33) 1999; 118 Ji (10.1016/j.cie.2010.05.016_bib15) 2007; 34 Liao (10.1016/j.cie.2010.05.016_bib21) 2005; 160 Lee (10.1016/j.cie.2010.05.016_bib19) 2000; 47 Sortrakul (10.1016/j.cie.2010.05.016_bib35) 2005; 56 Ow (10.1016/j.cie.2010.05.016_bib30) 1988; 26 Yang (10.1016/j.cie.2010.05.016_bib40) 2008; 35 Chen (10.1016/j.cie.2010.05.016_bib10) 2005; 11 Chan (10.1016/j.cie.2010.05.016_bib7) 2006; 22 Wang (10.1016/j.cie.2010.05.016_bib38) 2008; 46 10.1016/j.cie.2010.05.016_bib29 Cassady (10.1016/j.cie.2010.05.016_bib5) 2003; 35 Kacem (10.1016/j.cie.2010.05.016_bib16) 2002; 32 Wang (10.1016/j.cie.2010.05.016_bib37) 2002; 139 Cassady (10.1016/j.cie.2010.05.016_bib6) 2005; 54 Kacem (10.1016/j.cie.2010.05.016_bib17) 2002; 60 Valente (10.1016/j.cie.2010.05.016_bib36) 2005; 48 Chen (10.1016/j.cie.2010.05.016_bib8) 2008; 190 Chen (10.1016/j.cie.2010.05.016_bib9) 2009; 37 Lin (10.1016/j.cie.2010.05.016_bib23) 2007; 33 Mauguiere (10.1016/j.cie.2010.05.016_bib25) 2005; 8 Naderi (10.1016/j.cie.2010.05.016_bib28) 2009; 43 Ma (10.1016/j.cie.2010.05.016_bib24) 2010; 58 Xia (10.1016/j.cie.2010.05.016_bib39) 2005; 48 Brandimarte (10.1016/j.cie.2010.05.016_bib3) 1993; 41 Breit (10.1016/j.cie.2010.05.016_bib4) 2006; 33 Gao (10.1016/j.cie.2010.05.016_bib11) 2006; 17 Gao (10.1016/j.cie.2010.05.016_bib12) 2008; 35 Pezzella (10.1016/j.cie.2010.05.016_bib31) 2008; 35 Aggoune (10.1016/j.cie.2010.05.016_bib1) 2004; 153 Graves (10.1016/j.cie.2010.05.016_bib14) 1999; 46 Liao (10.1016/j.cie.2010.05.016_bib22) 2008; 184 Mellouli (10.1016/j.cie.2010.05.016_bib26) 2009; 197 |
| References_xml | – volume: 160 start-page: 445 year: 2005 end-page: 456 ident: bib21 article-title: Makespan minimization for two parallel machines with an availability constraint publication-title: European Journal of Operational Research – volume: 33 start-page: 1024 year: 2007 end-page: 1030 ident: bib23 article-title: Makespan minimization for two parallel machines with an unavailable period on each machine publication-title: International Journal of Advanced Manufacturing Technology – volume: 184 start-page: 458 year: 2008 end-page: 467 ident: bib22 article-title: Parallel machine scheduling with machine availability and eligibility constraints publication-title: European Journal of Operational Research – volume: 11 start-page: 43 year: 2005 end-page: 52 ident: bib10 article-title: Scheduling with different maintenance policies in a textile company publication-title: Journal of Quality in Maintenance Engineering – volume: 34 start-page: 3314 year: 2007 end-page: 3330 ident: bib32 article-title: Considering scheduling and preventive maintenance in the flowshop sequencing problem publication-title: Computers & Operations Research – volume: 37 start-page: 591 year: 2009 end-page: 599 ident: bib9 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega – volume: 43 start-page: 170 year: 2009 end-page: 181 ident: bib28 article-title: Scheduling sequence-dependent set-up time job shops with preventive maintenance publication-title: International Journal of Advanced Manufacturing Technology – volume: 34 start-page: 1764 year: 2007 end-page: 1770 ident: bib15 article-title: Single-machine scheduling with periodic maintenance to minimize makespan publication-title: Computers & Operations Research – volume: 190 start-page: 90 year: 2008 end-page: 102 ident: bib8 article-title: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan publication-title: European Journal of Operational Research – volume: 35 start-page: 867 year: 2008 end-page: 883 ident: bib40 article-title: A two-machine flowshop scheduling problem with a separated maintenance constraint publication-title: Computers & Operations Research – volume: 33 start-page: 2143 year: 2006 end-page: 2153 ident: bib4 article-title: A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint publication-title: Computers & Operations Research – volume: 60 start-page: 245 year: 2002 end-page: 276 ident: bib17 publication-title: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic – volume: 54 start-page: 789 year: 2006 end-page: 800 ident: bib18 article-title: Planning machine maintenance in two-machine shop scheduling publication-title: Operations Research – volume: 22 start-page: 493 year: 2006 end-page: 504 ident: bib7 article-title: Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach publication-title: Robotics and Computer-Integrated Manufacturing – volume: 46 start-page: 845 year: 1999 end-page: 863 ident: bib14 article-title: Scheduling maintenance and semiresumable jobs on a single machine publication-title: Naval Research Logistics – reference: (pp. 89–94). – volume: 26 start-page: 35 year: 1988 end-page: 62 ident: bib30 article-title: Filtered beam search in scheduling publication-title: International Journal of Production Research – volume: 35 start-page: 3202 year: 2008 end-page: 3212 ident: bib31 article-title: A genetic algorithm for the flexible job-shop scheduling problem publication-title: Computers & Operations Research – volume: 46 start-page: 3027 year: 2008 end-page: 3058 ident: bib38 article-title: A filtered-beam-search-based algorithm for flexible job-shop scheduling problem publication-title: International Journal of Production Research – volume: 112 start-page: 151 year: 2008 end-page: 160 ident: bib41 article-title: Minimizing the makespan for the MPM job-shop with availability constraints publication-title: International Journal of Production Economics – volume: 47 start-page: 145 year: 2000 end-page: 165 ident: bib19 article-title: Scheduling jobs and maintenance activities on parallel machines publication-title: Naval Research Logistics – volume: 35 start-page: 2892 year: 2008 end-page: 2907 ident: bib12 article-title: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems publication-title: Computers & Operations Research – volume: 58 start-page: 199 year: 2010 end-page: 211 ident: bib24 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computer & Industrial Engineering – volume: 197 start-page: 1150 year: 2009 end-page: 1165 ident: bib26 article-title: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times publication-title: European Journal of Operational Research – volume: 153 start-page: 534 year: 2004 end-page: 543 ident: bib1 article-title: Minimizing the makespan for the flow shop scheduling problem with availability constraints publication-title: European Journal of Operational Research – volume: 47 start-page: 431 year: 2004 end-page: 450 ident: bib2 article-title: simulation and optimization to schedule a hybrid flow shop with maintenance constraints publication-title: Computers & Industrial Engineering – volume: 41 start-page: 157 year: 1993 end-page: 183 ident: bib3 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations Research – volume: 17 start-page: 493 year: 2006 end-page: 507 ident: bib11 article-title: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm publication-title: Journal of Intelligent Manufacturing – volume: 32 start-page: 1 year: 2002 end-page: 13 ident: bib16 article-title: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part C – volume: 48 start-page: 363 year: 2005 end-page: 375 ident: bib36 article-title: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time publication-title: Computers & Industrial Engineering – volume: 121 start-page: 1 year: 2000 end-page: 15 ident: bib34 article-title: Scheduling with limited machine availability publication-title: European Journal of Operational Research – volume: 35 start-page: 503 year: 2003 end-page: 513 ident: bib5 article-title: Minimizing job tardiness using integrated preventive maintenance planning and production scheduling publication-title: IIE Transactions – volume: 8 start-page: 211 year: 2005 end-page: 231 ident: bib25 article-title: New single machine and job-shop scheduling problems with availability constraints publication-title: Journal of Scheduling – volume: 2 start-page: 27 year: 2008 end-page: 37 ident: bib20 article-title: Parallel-machine scheduling under potential disruption publication-title: Optimization Letters – volume: 56 start-page: 161 year: 2005 end-page: 168 ident: bib35 article-title: Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine publication-title: Computers in Industry – volume: 48 start-page: 409 year: 2005 end-page: 425 ident: bib39 article-title: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems publication-title: Computers & Industrial Engineering – volume: 148 start-page: 63 year: 2005 end-page: 87 ident: bib13 article-title: Optimal parallel machines scheduling with availability constraints publication-title: Discrete Applied Mathematics – reference: Najib, N.M., Dauzere-Peres, S., & Zaidat, A. (2002). A modified simulated annealing method for flexible job shop scheduling problem. In – volume: 92 start-page: 187 year: 2007 end-page: 199 ident: bib27 article-title: Deterministic and stochastic approach for safety and reliability optimization of captive power plant maintenance scheduling using GA/SA-based hybrid techniques: A comparison of results publication-title: Reliability Engineering and System Safety – volume: 54 start-page: 304 year: 2005 end-page: 309 ident: bib6 article-title: Integrating preventive maintenance planning and production scheduling for a single machine publication-title: IEEE Transactions on Reliability – volume: 118 start-page: 390 year: 1999 end-page: 412 ident: bib33 article-title: Job shop scheduling with beam search publication-title: European Journal of Operational Research – volume: 139 start-page: 469 year: 2002 end-page: 489 ident: bib37 article-title: A survey of maintenance policies of deteriorating systems publication-title: European Journal of Operational Research – volume: 37 start-page: 591 issue: 3 year: 2009 ident: 10.1016/j.cie.2010.05.016_bib9 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega doi: 10.1016/j.omega.2008.01.001 – volume: 17 start-page: 493 issue: 4 year: 2006 ident: 10.1016/j.cie.2010.05.016_bib11 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 – volume: 43 start-page: 170 issue: 1–2 year: 2009 ident: 10.1016/j.cie.2010.05.016_bib28 article-title: Scheduling sequence-dependent set-up time job shops with preventive maintenance publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-008-1693-0 – volume: 190 start-page: 90 issue: 1 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib8 article-title: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.06.029 – volume: 56 start-page: 161 issue: 2 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib35 article-title: Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine publication-title: Computers in Industry doi: 10.1016/j.compind.2004.06.005 – volume: 11 start-page: 43 issue: 1 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib10 article-title: Scheduling with different maintenance policies in a textile company publication-title: Journal of Quality in Maintenance Engineering doi: 10.1108/13552510510589361 – volume: 54 start-page: 304 issue: 2 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib6 article-title: Integrating preventive maintenance planning and production scheduling for a single machine publication-title: IEEE Transactions on Reliability doi: 10.1109/TR.2005.845967 – volume: 35 start-page: 3202 issue: 10 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib31 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: 58 start-page: 199 issue: 2 year: 2010 ident: 10.1016/j.cie.2010.05.016_bib24 article-title: A survey of scheduling with deterministic machine availability constraints publication-title: Computer & Industrial Engineering doi: 10.1016/j.cie.2009.04.014 – volume: 47 start-page: 145 issue: 2 year: 2000 ident: 10.1016/j.cie.2010.05.016_bib19 article-title: Scheduling jobs and maintenance activities on parallel machines publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 – volume: 160 start-page: 445 issue: 2 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib21 article-title: Makespan minimization for two parallel machines with an availability constraint publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.08.034 – volume: 41 start-page: 157 issue: 1-4 year: 1993 ident: 10.1016/j.cie.2010.05.016_bib3 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations Research doi: 10.1007/BF02023073 – volume: 92 start-page: 187 issue: 2 year: 2007 ident: 10.1016/j.cie.2010.05.016_bib27 article-title: Deterministic and stochastic approach for safety and reliability optimization of captive power plant maintenance scheduling using GA/SA-based hybrid techniques: A comparison of results publication-title: Reliability Engineering and System Safety doi: 10.1016/j.ress.2005.11.062 – volume: 8 start-page: 211 issue: 3 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib25 article-title: New single machine and job-shop scheduling problems with availability constraints publication-title: Journal of Scheduling doi: 10.1007/s10951-005-6812-2 – volume: 197 start-page: 1150 issue: 3 year: 2009 ident: 10.1016/j.cie.2010.05.016_bib26 article-title: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.03.043 – volume: 48 start-page: 363 issue: 2 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib36 article-title: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2005.01.020 – volume: 153 start-page: 534 issue: 3 year: 2004 ident: 10.1016/j.cie.2010.05.016_bib1 article-title: Minimizing the makespan for the flow shop scheduling problem with availability constraints publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00261-3 – volume: 33 start-page: 2143 issue: 8 year: 2006 ident: 10.1016/j.cie.2010.05.016_bib4 article-title: A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.01.004 – volume: 48 start-page: 409 issue: 2 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib39 article-title: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2005.01.018 – volume: 184 start-page: 458 issue: 2 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib22 article-title: Parallel machine scheduling with machine availability and eligibility constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.11.027 – volume: 121 start-page: 1 issue: 1 year: 2000 ident: 10.1016/j.cie.2010.05.016_bib34 article-title: Scheduling with limited machine availability publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00367-1 – volume: 46 start-page: 3027 issue: 11 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib38 article-title: A filtered-beam-search-based algorithm for flexible job-shop scheduling problem publication-title: International Journal of Production Research doi: 10.1080/00207540600988105 – volume: 33 start-page: 1024 issue: 9-10 year: 2007 ident: 10.1016/j.cie.2010.05.016_bib23 article-title: Makespan minimization for two parallel machines with an unavailable period on each machine publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-006-0524-4 – volume: 35 start-page: 2892 issue: 9 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib12 article-title: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.01.001 – volume: 139 start-page: 469 year: 2002 ident: 10.1016/j.cie.2010.05.016_bib37 article-title: A survey of maintenance policies of deteriorating systems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00197-7 – volume: 22 start-page: 493 issue: 5-6 year: 2006 ident: 10.1016/j.cie.2010.05.016_bib7 article-title: Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach publication-title: Robotics and Computer-Integrated Manufacturing doi: 10.1016/j.rcim.2005.11.005 – volume: 46 start-page: 845 issue: 7 year: 1999 ident: 10.1016/j.cie.2010.05.016_bib14 article-title: Scheduling maintenance and semiresumable jobs on a single machine publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-# – volume: 2 start-page: 27 issue: 1 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib20 article-title: Parallel-machine scheduling under potential disruption publication-title: Optimization Letters doi: 10.1007/s11590-006-0041-2 – volume: 148 start-page: 63 issue: 1 year: 2005 ident: 10.1016/j.cie.2010.05.016_bib13 article-title: Optimal parallel machines scheduling with availability constraints publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2004.12.003 – volume: 35 start-page: 867 issue: 3 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib40 article-title: A two-machine flowshop scheduling problem with a separated maintenance constraint publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.04.007 – volume: 112 start-page: 151 issue: 1 year: 2008 ident: 10.1016/j.cie.2010.05.016_bib41 article-title: Minimizing the makespan for the MPM job-shop with availability constraints publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.01.014 – volume: 34 start-page: 1764 issue: 6 year: 2007 ident: 10.1016/j.cie.2010.05.016_bib15 article-title: Single-machine scheduling with periodic maintenance to minimize makespan publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.05.034 – volume: 26 start-page: 35 issue: 1 year: 1988 ident: 10.1016/j.cie.2010.05.016_bib30 article-title: Filtered beam search in scheduling publication-title: International Journal of Production Research doi: 10.1080/00207548808947840 – volume: 54 start-page: 789 issue: 4 year: 2006 ident: 10.1016/j.cie.2010.05.016_bib18 article-title: Planning machine maintenance in two-machine shop scheduling publication-title: Operations Research doi: 10.1287/opre.1060.0301 – ident: 10.1016/j.cie.2010.05.016_bib29 – volume: 34 start-page: 3314 issue: 11 year: 2007 ident: 10.1016/j.cie.2010.05.016_bib32 article-title: Considering scheduling and preventive maintenance in the flowshop sequencing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2005.12.007 – volume: 35 start-page: 503 issue: 6 year: 2003 ident: 10.1016/j.cie.2010.05.016_bib5 article-title: Minimizing job tardiness using integrated preventive maintenance planning and production scheduling publication-title: IIE Transactions doi: 10.1080/07408170304416 – volume: 60 start-page: 245 issue: 3–5 year: 2002 ident: 10.1016/j.cie.2010.05.016_bib17 publication-title: Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic – volume: 118 start-page: 390 issue: 2 year: 1999 ident: 10.1016/j.cie.2010.05.016_bib33 article-title: Job shop scheduling with beam search publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00319-1 – volume: 47 start-page: 431 issue: 4 year: 2004 ident: 10.1016/j.cie.2010.05.016_bib2 article-title: simulation and optimization to schedule a hybrid flow shop with maintenance constraints publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2004.09.002 – volume: 32 start-page: 1 issue: 1 year: 2002 ident: 10.1016/j.cie.2010.05.016_bib16 article-title: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part C doi: 10.1109/TSMCC.2002.1009117 |
| SSID | ssj0004591 |
| Score | 2.3089502 |
| Snippet | Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available.... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 436 |
| SubjectTerms | Algorithms Availability Availability constraints Beams (structural) Computer simulation Filtered beam search Flexible job-shop scheduling problem Heuristic Heuristic methods Job shops Machinery Maintenance Preventive maintenance Production scheduling Scheduling Searching Simulation Studies Windows (intervals) |
| Title | An effective heuristic for flexible job-shop scheduling problem with maintenance activities |
| URI | https://dx.doi.org/10.1016/j.cie.2010.05.016 https://www.proquest.com/docview/741719118 https://www.proquest.com/docview/787048451 |
| Volume | 59 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: ACRLP dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection Journals customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIKHN dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1879-0550 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AKRWK dateStart: 19770101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED5BWWDgjSgveWBCMk1qx3XGCoEKCBZAQmKw7NgRoJJWtGXkt3N2HARIMLA6dhLZvrvv7LvvAA4zw7R1paVWdC3lTHNqelpTaw1DhJ-wbsiQu7oWgzt-cZ_dz8FJkwvjwyqj7q91etDWsaUTZ7Mzfnrq3KDuDfghDTif5fOwgPZHyhYs9M8vB9dfSMPrwnnYn_oBzeVmCPPCN8cAL8_fKX4zTz8UdbA-Z6uwHGEj6dd_tgZzrlqHlQghSRTQyTosfeEX3ICHfkXqgA3UaeTRzWpaZoJAlZSeCdMMHXkeGTp5HI0J-rlod3x6OollZog_pSUv2nNKeGIOR3waxFsgYd2Eu7PT25MBjdUUaMEyMaVaoviKUnS1FU4ww41GuNMrbZHnhZM5eoLM8cJfZ7skLXvor2p0zqQpUW5lwdkWtKpR5baBCFloz-OXuLLLmcjyIrclLiqiM-uMEG1ImklURaQa9xUvhqqJKXvGdqf8vKskU9jShqPPIeOaZ-OvzrxZGfVtsyi0A38N221WUUVJnShEVD30WVPZBvL5FEXM35voyo1m2AV1Gpc8S3f-991dWAwxByEEcA9a09eZ20coMzUHMH_8nh7EDfsBRW3yKA |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8QwDLZ4DMDAG3E8MzAhhWubNG1HhEDHcwEkJIYoaVIBgt6Ju2Pkt-OkKQIkGFhTp62S2v7c2J8B9lLNlLGVoUYkhnKmONWZUtQYzRDhRyzxFXKXV6J3y8_u0rsJOGprYVxaZbD9jU331jqMdMNqdgePj91rtL0eP8Qe57NiEqZ5mmQuAjt4j79Qhjdt81CaOvH2aNMneeF9Q3qXY-8UvzmnH2ba-56TRZgPoJEcNu-1BBO2XoaFACBJUM_hMsx9YRdcgfvDmjTpGmjRyIMdN6TMBGEqqRwPpn625Kmv6fChPyAY5aLXccXpJDSZIe4fLXlRjlHC0XJY4oog3jwF6yrcnhzfHPVo6KVAS5aKEVU5Kq-oRKKMsIJprhWCnawyZVGUNi8wDmSWl-4w20ZxlWG0qjA0y3WFWpuXnK3BVN2v7ToQkZfKsfhFtko4E2lRFqbCLUVsZqwWogNRu4iyDETjrt_Fs2wzyp5w3Eq37jJKJY50YP9zyqBh2fhLmLc7I799KhK9wF_TNttdlEFPhxLxVIYRa5x3gHxeRQVzpyaqtv0xiqBF4zlP443_PXcXZno3lxfy4vTqfBNmffaBTwbcgqnR69huI6gZ6R3_0X4AR13y8A |
| 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=An+effective+heuristic+for+flexible+job-shop+scheduling+problem+with+maintenance+activities&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Wang%2C+Shijin&rft.au=Yu%2C+Jianbo&rft.date=2010-10-01&rft.pub=Pergamon+Press+Inc&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=59&rft.issue=3&rft.spage=436&rft_id=info:doi/10.1016%2Fj.cie.2010.05.016&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2106803271 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |