JIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earlines...
Gespeichert in:
| Veröffentlicht in: | Journal of industrial engineering international 2016-09, Vol.12 (3), p.299-310 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 310 |
|---|---|
| container_issue | 3 |
| container_start_page | 299 |
| container_title | Journal of industrial engineering international |
| container_volume | 12 |
| creator | Shahriari, Mohammadreza Shoja, Naghi Zade, Amir Ebrahimi Barak, Sasan Sharifi, Mani |
| description | This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms. |
| doi_str_mv | 10.1007/s40092-016-0147-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2135700352</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2135700352</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3519-c70cc35e2b72b50b34be05e0b11eeb5d3b1978255beeb97b3f4ebe7bf666716e3</originalsourceid><addsrcrecordid>eNp9UE1LAzEQDaJg0f4AD-KC59VJstk0Ryl-tBS8VPAWNulsm9Jma7Kt-O_NsuLHxcAwH3nvzfAIuaBwQwHkbSwAFMuBlikKmasjMmBM0FxS9nr8qz4lwxjXkJ6UCng5INPpZJ5F55cbzLaVXTmPWbQrXOw3aZjtQmM2uM3eXbvKdhhcs3A2TfGAvnWHjuN8i77yFs_JSV1tIg6_8hl5ebifj5_y2fPjZHw3yy0XVOVWgk0VMiOZEWB4YRAEgqEU0YgFN1TJERPCpFZJw-sCDUpTl2UpaYn8jFz3uum4tz3GVq-bffBppWaUCwnABUso2qNsaGIMWOtdcNsqfGgKunNN967p5JruXNMqca56DtrGu_jNGEkOopCcJwTrETH9-SWGn93_yV7-ke1SbJugqZCF4vwT98ODpw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2135700352</pqid></control><display><type>article</type><title>JIT single machine scheduling problem with periodic preventive maintenance</title><source>DOAJ Directory of Open Access Journals</source><source>Springer Nature OA Free Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Shahriari, Mohammadreza ; Shoja, Naghi ; Zade, Amir Ebrahimi ; Barak, Sasan ; Sharifi, Mani</creator><creatorcontrib>Shahriari, Mohammadreza ; Shoja, Naghi ; Zade, Amir Ebrahimi ; Barak, Sasan ; Sharifi, Mani</creatorcontrib><description>This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.</description><identifier>ISSN: 2251-712X</identifier><identifier>ISSN: 1735-5702</identifier><identifier>EISSN: 2251-712X</identifier><identifier>DOI: 10.1007/s40092-016-0147-9</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Algorithms ; Decision making ; Engineering ; Engineering Economics ; Facility Management ; Industrial and Production Engineering ; Job shops ; Logistics ; Marketing ; Mathematical and Computational Engineering ; MCDM ; Mixed integer ; Multi-objective optimization ; Multiple criterion ; Multiple objective analysis ; Organization ; Original Research ; Particle swarm optimization ; Periodic maintenance ; Preventive maintenance ; Production scheduling ; Quality Control ; Reliability ; Safety and Risk ; Scheduling ; Single machine ; Taguchi methods ; Total earliness-tardiness</subject><ispartof>Journal of industrial engineering international, 2016-09, Vol.12 (3), p.299-310</ispartof><rights>The Author(s) 2016</rights><rights>The Author(s) 2016. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3519-c70cc35e2b72b50b34be05e0b11eeb5d3b1978255beeb97b3f4ebe7bf666716e3</citedby><cites>FETCH-LOGICAL-c3519-c70cc35e2b72b50b34be05e0b11eeb5d3b1978255beeb97b3f4ebe7bf666716e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s40092-016-0147-9$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://doi.org/10.1007/s40092-016-0147-9$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,864,27924,27925,41120,42189,51576</link.rule.ids></links><search><creatorcontrib>Shahriari, Mohammadreza</creatorcontrib><creatorcontrib>Shoja, Naghi</creatorcontrib><creatorcontrib>Zade, Amir Ebrahimi</creatorcontrib><creatorcontrib>Barak, Sasan</creatorcontrib><creatorcontrib>Sharifi, Mani</creatorcontrib><title>JIT single machine scheduling problem with periodic preventive maintenance</title><title>Journal of industrial engineering international</title><addtitle>J Ind Eng Int</addtitle><description>This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.</description><subject>Algorithms</subject><subject>Decision making</subject><subject>Engineering</subject><subject>Engineering Economics</subject><subject>Facility Management</subject><subject>Industrial and Production Engineering</subject><subject>Job shops</subject><subject>Logistics</subject><subject>Marketing</subject><subject>Mathematical and Computational Engineering</subject><subject>MCDM</subject><subject>Mixed integer</subject><subject>Multi-objective optimization</subject><subject>Multiple criterion</subject><subject>Multiple objective analysis</subject><subject>Organization</subject><subject>Original Research</subject><subject>Particle swarm optimization</subject><subject>Periodic maintenance</subject><subject>Preventive maintenance</subject><subject>Production scheduling</subject><subject>Quality Control</subject><subject>Reliability</subject><subject>Safety and Risk</subject><subject>Scheduling</subject><subject>Single machine</subject><subject>Taguchi methods</subject><subject>Total earliness-tardiness</subject><issn>2251-712X</issn><issn>1735-5702</issn><issn>2251-712X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNp9UE1LAzEQDaJg0f4AD-KC59VJstk0Ryl-tBS8VPAWNulsm9Jma7Kt-O_NsuLHxcAwH3nvzfAIuaBwQwHkbSwAFMuBlikKmasjMmBM0FxS9nr8qz4lwxjXkJ6UCng5INPpZJ5F55cbzLaVXTmPWbQrXOw3aZjtQmM2uM3eXbvKdhhcs3A2TfGAvnWHjuN8i77yFs_JSV1tIg6_8hl5ebifj5_y2fPjZHw3yy0XVOVWgk0VMiOZEWB4YRAEgqEU0YgFN1TJERPCpFZJw-sCDUpTl2UpaYn8jFz3uum4tz3GVq-bffBppWaUCwnABUso2qNsaGIMWOtdcNsqfGgKunNN967p5JruXNMqca56DtrGu_jNGEkOopCcJwTrETH9-SWGn93_yV7-ke1SbJugqZCF4vwT98ODpw</recordid><startdate>20160901</startdate><enddate>20160901</enddate><creator>Shahriari, Mohammadreza</creator><creator>Shoja, Naghi</creator><creator>Zade, Amir Ebrahimi</creator><creator>Barak, Sasan</creator><creator>Sharifi, Mani</creator><general>Springer</general><general>Springer Berlin Heidelberg</general><general>Islamic Azad University, South Tehran Branch</general><scope>OT2</scope><scope>C6C</scope><scope>OQ6</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160901</creationdate><title>JIT single machine scheduling problem with periodic preventive maintenance</title><author>Shahriari, Mohammadreza ; Shoja, Naghi ; Zade, Amir Ebrahimi ; Barak, Sasan ; Sharifi, Mani</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3519-c70cc35e2b72b50b34be05e0b11eeb5d3b1978255beeb97b3f4ebe7bf666716e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Decision making</topic><topic>Engineering</topic><topic>Engineering Economics</topic><topic>Facility Management</topic><topic>Industrial and Production Engineering</topic><topic>Job shops</topic><topic>Logistics</topic><topic>Marketing</topic><topic>Mathematical and Computational Engineering</topic><topic>MCDM</topic><topic>Mixed integer</topic><topic>Multi-objective optimization</topic><topic>Multiple criterion</topic><topic>Multiple objective analysis</topic><topic>Organization</topic><topic>Original Research</topic><topic>Particle swarm optimization</topic><topic>Periodic maintenance</topic><topic>Preventive maintenance</topic><topic>Production scheduling</topic><topic>Quality Control</topic><topic>Reliability</topic><topic>Safety and Risk</topic><topic>Scheduling</topic><topic>Single machine</topic><topic>Taguchi methods</topic><topic>Total earliness-tardiness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shahriari, Mohammadreza</creatorcontrib><creatorcontrib>Shoja, Naghi</creatorcontrib><creatorcontrib>Zade, Amir Ebrahimi</creatorcontrib><creatorcontrib>Barak, Sasan</creatorcontrib><creatorcontrib>Sharifi, Mani</creatorcontrib><collection>EconStor</collection><collection>Springer Nature OA Free Journals</collection><collection>ECONIS</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Journal of industrial engineering international</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shahriari, Mohammadreza</au><au>Shoja, Naghi</au><au>Zade, Amir Ebrahimi</au><au>Barak, Sasan</au><au>Sharifi, Mani</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>JIT single machine scheduling problem with periodic preventive maintenance</atitle><jtitle>Journal of industrial engineering international</jtitle><stitle>J Ind Eng Int</stitle><date>2016-09-01</date><risdate>2016</risdate><volume>12</volume><issue>3</issue><spage>299</spage><epage>310</epage><pages>299-310</pages><issn>2251-712X</issn><issn>1735-5702</issn><eissn>2251-712X</eissn><abstract>This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.</abstract><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/s40092-016-0147-9</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2251-712X |
| ispartof | Journal of industrial engineering international, 2016-09, Vol.12 (3), p.299-310 |
| issn | 2251-712X 1735-5702 2251-712X |
| language | eng |
| recordid | cdi_proquest_journals_2135700352 |
| source | DOAJ Directory of Open Access Journals; Springer Nature OA Free Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Decision making Engineering Engineering Economics Facility Management Industrial and Production Engineering Job shops Logistics Marketing Mathematical and Computational Engineering MCDM Mixed integer Multi-objective optimization Multiple criterion Multiple objective analysis Organization Original Research Particle swarm optimization Periodic maintenance Preventive maintenance Production scheduling Quality Control Reliability Safety and Risk Scheduling Single machine Taguchi methods Total earliness-tardiness |
| title | JIT single machine scheduling problem with periodic preventive maintenance |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T22%3A43%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=JIT%20single%20machine%20scheduling%20problem%20with%20periodic%20preventive%20maintenance&rft.jtitle=Journal%20of%20industrial%20engineering%20international&rft.au=Shahriari,%20Mohammadreza&rft.date=2016-09-01&rft.volume=12&rft.issue=3&rft.spage=299&rft.epage=310&rft.pages=299-310&rft.issn=2251-712X&rft.eissn=2251-712X&rft_id=info:doi/10.1007/s40092-016-0147-9&rft_dat=%3Cproquest_cross%3E2135700352%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2135700352&rft_id=info:pmid/&rfr_iscdi=true |