An invasive weed optimization approach for job shop scheduling problems

Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2017-08, Vol.91 (9-12), p.4233-4241
Main Authors: Mishra, S. K., Bose, P. S. C., Rao, C. S. P.
Format: Article
Language:English
Subjects:
Algorithms
CAE) and Design
Computer-Aided Engineering (CAD
Engineering
Industrial and Production Engineering
Job shop scheduling
Job shops
Mechanical Engineering
Media Management
Optimization
Original Article
Production scheduling
Resource scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3
cites cdi_FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3
container_end_page 4241
container_issue 9-12
container_start_page 4233
container_title International journal of advanced manufacturing technology
container_volume 91
creator Mishra, S. K.
Bose, P. S. C.
Rao, C. S. P.
description Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods, programs, and algorithms in the last 40 year of literature. This paper presents a new paradigm of invasive weed optimization which mimics the process of weed colonization and distribution to solve JSSPs. The algorithm had shown encouraging and promising outputs on standard benchmarking problems.
doi_str_mv 10.1007/s00170-017-0091-x
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2490893068</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1925230112</sourcerecordid><originalsourceid>FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKsfwFvAczST7ObPsRStQsGLnsMmm7Rb2s26aWv105uyHrzYy8ww83tv4CF0C_QeKJUPiVKQlORCKNVADmdoBAXnhFMoz9GIMqEIl0JdoquUVpkWINQIzSYtbtp9lZq9x5_e1zh222bTfFfbJra46ro-Vm6JQ-zxKlqclrHDyS19vVs37QLns137TbpGF6FaJ3_z28fo_enxbfpM5q-zl-lkTlwB5ZYoG0IBTnkI0hbSBlo6TYUOQivIU_C-DFYEx0Pw2tXS8bzxTEJhpa0DH6O7wTc__tj5tDWruOvb_NKwQlOlORXqJMUEy6RS4hQFmpUsRwcsUzBQro8p9T6Yrm82Vf9lgJpj9mbI3uRijtmbQ9awQZMy2y58_8f5X9EPD-yHCg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2262249886</pqid></control><display><type>article</type><title>An invasive weed optimization approach for job shop scheduling problems</title><source>Springer Nature</source><creator>Mishra, S. K. ; Bose, P. S. C. ; Rao, C. S. P.</creator><creatorcontrib>Mishra, S. K. ; Bose, P. S. C. ; Rao, C. S. P.</creatorcontrib><description>Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods, programs, and algorithms in the last 40 year of literature. This paper presents a new paradigm of invasive weed optimization which mimics the process of weed colonization and distribution to solve JSSPs. The algorithm had shown encouraging and promising outputs on standard benchmarking problems.</description><identifier>ISSN: 0268-3768</identifier><identifier>EISSN: 1433-3015</identifier><identifier>DOI: 10.1007/s00170-017-0091-x</identifier><language>eng</language><publisher>London: Springer London</publisher><subject>Algorithms ; CAE) and Design ; Computer-Aided Engineering (CAD ; Engineering ; Industrial and Production Engineering ; Job shop scheduling ; Job shops ; Mechanical Engineering ; Media Management ; Optimization ; Original Article ; Production scheduling ; Resource scheduling</subject><ispartof>International journal of advanced manufacturing technology, 2017-08, Vol.91 (9-12), p.4233-4241</ispartof><rights>Springer-Verlag London 2017</rights><rights>Copyright Springer Science &amp; Business Media 2017</rights><rights>The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2017). All Rights Reserved.</rights><rights>Springer-Verlag London 2017.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3</citedby><cites>FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27922,27923</link.rule.ids></links><search><creatorcontrib>Mishra, S. K.</creatorcontrib><creatorcontrib>Bose, P. S. C.</creatorcontrib><creatorcontrib>Rao, C. S. P.</creatorcontrib><title>An invasive weed optimization approach for job shop scheduling problems</title><title>International journal of advanced manufacturing technology</title><addtitle>Int J Adv Manuf Technol</addtitle><description>Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods, programs, and algorithms in the last 40 year of literature. This paper presents a new paradigm of invasive weed optimization which mimics the process of weed colonization and distribution to solve JSSPs. The algorithm had shown encouraging and promising outputs on standard benchmarking problems.</description><subject>Algorithms</subject><subject>CAE) and Design</subject><subject>Computer-Aided Engineering (CAD</subject><subject>Engineering</subject><subject>Industrial and Production Engineering</subject><subject>Job shop scheduling</subject><subject>Job shops</subject><subject>Mechanical Engineering</subject><subject>Media Management</subject><subject>Optimization</subject><subject>Original Article</subject><subject>Production scheduling</subject><subject>Resource scheduling</subject><issn>0268-3768</issn><issn>1433-3015</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKsfwFvAczST7ObPsRStQsGLnsMmm7Rb2s26aWv105uyHrzYy8ww83tv4CF0C_QeKJUPiVKQlORCKNVADmdoBAXnhFMoz9GIMqEIl0JdoquUVpkWINQIzSYtbtp9lZq9x5_e1zh222bTfFfbJra46ro-Vm6JQ-zxKlqclrHDyS19vVs37QLns137TbpGF6FaJ3_z28fo_enxbfpM5q-zl-lkTlwB5ZYoG0IBTnkI0hbSBlo6TYUOQivIU_C-DFYEx0Pw2tXS8bzxTEJhpa0DH6O7wTc__tj5tDWruOvb_NKwQlOlORXqJMUEy6RS4hQFmpUsRwcsUzBQro8p9T6Yrm82Vf9lgJpj9mbI3uRijtmbQ9awQZMy2y58_8f5X9EPD-yHCg</recordid><startdate>20170801</startdate><enddate>20170801</enddate><creator>Mishra, S. K.</creator><creator>Bose, P. S. C.</creator><creator>Rao, C. S. P.</creator><general>Springer London</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20170801</creationdate><title>An invasive weed optimization approach for job shop scheduling problems</title><author>Mishra, S. K. ; Bose, P. S. C. ; Rao, C. S. P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>CAE) and Design</topic><topic>Computer-Aided Engineering (CAD</topic><topic>Engineering</topic><topic>Industrial and Production Engineering</topic><topic>Job shop scheduling</topic><topic>Job shops</topic><topic>Mechanical Engineering</topic><topic>Media Management</topic><topic>Optimization</topic><topic>Original Article</topic><topic>Production scheduling</topic><topic>Resource scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mishra, S. K.</creatorcontrib><creatorcontrib>Bose, P. S. C.</creatorcontrib><creatorcontrib>Rao, C. S. P.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering 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>International journal of advanced manufacturing technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mishra, S. K.</au><au>Bose, P. S. C.</au><au>Rao, C. S. P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An invasive weed optimization approach for job shop scheduling problems</atitle><jtitle>International journal of advanced manufacturing technology</jtitle><stitle>Int J Adv Manuf Technol</stitle><date>2017-08-01</date><risdate>2017</risdate><volume>91</volume><issue>9-12</issue><spage>4233</spage><epage>4241</epage><pages>4233-4241</pages><issn>0268-3768</issn><eissn>1433-3015</eissn><abstract>Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods, programs, and algorithms in the last 40 year of literature. This paper presents a new paradigm of invasive weed optimization which mimics the process of weed colonization and distribution to solve JSSPs. The algorithm had shown encouraging and promising outputs on standard benchmarking problems.</abstract><cop>London</cop><pub>Springer London</pub><doi>10.1007/s00170-017-0091-x</doi><tpages>9</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0268-3768
ispartof International journal of advanced manufacturing technology, 2017-08, Vol.91 (9-12), p.4233-4241
issn 0268-3768
1433-3015
language eng
recordid cdi_proquest_journals_2490893068
source Springer Nature
subjects Algorithms
CAE) and Design
Computer-Aided Engineering (CAD
Engineering
Industrial and Production Engineering
Job shop scheduling
Job shops
Mechanical Engineering
Media Management
Optimization
Original Article
Production scheduling
Resource scheduling
title An invasive weed optimization approach for job shop scheduling problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T02%3A27%3A07IST&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=An%20invasive%20weed%20optimization%20approach%20for%20job%20shop%20scheduling%20problems&rft.jtitle=International%20journal%20of%20advanced%20manufacturing%20technology&rft.au=Mishra,%20S.%20K.&rft.date=2017-08-01&rft.volume=91&rft.issue=9-12&rft.spage=4233&rft.epage=4241&rft.pages=4233-4241&rft.issn=0268-3768&rft.eissn=1433-3015&rft_id=info:doi/10.1007/s00170-017-0091-x&rft_dat=%3Cproquest_cross%3E1925230112%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c415t-8bff41c8e1f7b47bf05c9069f6981c90fee5fb6fc3ffe9cd7c3ee5e2714b7bdf3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2262249886&rft_id=info:pmid/&rfr_iscdi=true