A bicriterian flow shop scheduling using artificial neural network
This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs...
Gespeichert in:
Veröffentlicht in: | International journal of advanced manufacturing technology 2006-10, Vol.30 (11-12), p.1132-1138 |
---|---|
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 | 1138 |
---|---|
container_issue | 11-12 |
container_start_page | 1132 |
container_title | International journal of advanced manufacturing technology |
container_volume | 30 |
creator | Noorul Haq, A. Radha Ramanan, T. |
description | This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs. The authors have used the heuristics proposed by Campbell et al.(1970, A heuristic algorithm for n-jobs m-machines sequencing problem) to find a sequence and makespan (MS). Then a pair wise interchange of jobs is made to find the optimal MS and total flow time (TFT). The obtained sequence is used for giving training to the neural network and a matrix called neural network master matrix (NNMM) is constructed, which is the basic knowledge of the neurons obtained after training. From the matrix, interpretations are made to determine the optimum sequence for the jobs that arrive in the future over a period of time. The results obtained by the ANN are compared with a constructive heuristics and an improvement heuristics. The results show that the quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics. It is found that the system’s efficiency (i.e., obtaining the optimal MS and TFT) increases with increasing numbers of training exemplars. |
doi_str_mv | 10.1007/s00170-005-0135-5 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2262509155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2262509155</sourcerecordid><originalsourceid>FETCH-LOGICAL-c273t-5be323d3835af2719b4aa70a3aa338c199a21ddff0a6c627c1d703ad36afa7063</originalsourceid><addsrcrecordid>eNotkMtOwzAURC0EEqXwAewisTZc-9Z2siwVL6kSG1hbN45NXUJS7EQVf09K2cxsjmakw9i1gFsBYO4ygDDAARQHgYqrEzYTC0SOINQpm4HUJUejy3N2kfN2orXQ5YzdL4s6uhQHnyJ1RWj7fZE3_a7IbuObsY3dRzHmQ1IaYoguUlt0fkx_Nez79HnJzgK12V_995y9Pz68rZ75-vXpZbVccycNDlzVHiU2WKKiII2o6gWRAUIixNKJqiIpmiYEIO20NE40BpAa1BQmTuOc3Rx3d6n_Hn0e7LYfUzddWim1VFAJpSZKHCmX-pyTD3aX4helHyvAHlTZoyo7qbIHVVbhL1K2W-Y</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2262509155</pqid></control><display><type>article</type><title>A bicriterian flow shop scheduling using artificial neural network</title><source>SpringerNature Journals</source><creator>Noorul Haq, A. ; Radha Ramanan, T.</creator><creatorcontrib>Noorul Haq, A. ; Radha Ramanan, T.</creatorcontrib><description>This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs. The authors have used the heuristics proposed by Campbell et al.(1970, A heuristic algorithm for n-jobs m-machines sequencing problem) to find a sequence and makespan (MS). Then a pair wise interchange of jobs is made to find the optimal MS and total flow time (TFT). The obtained sequence is used for giving training to the neural network and a matrix called neural network master matrix (NNMM) is constructed, which is the basic knowledge of the neurons obtained after training. From the matrix, interpretations are made to determine the optimum sequence for the jobs that arrive in the future over a period of time. The results obtained by the ANN are compared with a constructive heuristics and an improvement heuristics. The results show that the quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics. It is found that the system’s efficiency (i.e., obtaining the optimal MS and TFT) increases with increasing numbers of training exemplars.</description><identifier>ISSN: 0268-3768</identifier><identifier>EISSN: 1433-3015</identifier><identifier>DOI: 10.1007/s00170-005-0135-5</identifier><language>eng</language><publisher>Heidelberg: Springer Nature B.V</publisher><subject>Algorithms ; Artificial neural networks ; Heuristic ; Heuristic methods ; Job shop scheduling ; Knowledge acquisition ; Neural networks ; Optimization ; Production scheduling ; Sequential scheduling ; Training</subject><ispartof>International journal of advanced manufacturing technology, 2006-10, Vol.30 (11-12), p.1132-1138</ispartof><rights>The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2005). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c273t-5be323d3835af2719b4aa70a3aa338c199a21ddff0a6c627c1d703ad36afa7063</citedby><cites>FETCH-LOGICAL-c273t-5be323d3835af2719b4aa70a3aa338c199a21ddff0a6c627c1d703ad36afa7063</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Noorul Haq, A.</creatorcontrib><creatorcontrib>Radha Ramanan, T.</creatorcontrib><title>A bicriterian flow shop scheduling using artificial neural network</title><title>International journal of advanced manufacturing technology</title><description>This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs. The authors have used the heuristics proposed by Campbell et al.(1970, A heuristic algorithm for n-jobs m-machines sequencing problem) to find a sequence and makespan (MS). Then a pair wise interchange of jobs is made to find the optimal MS and total flow time (TFT). The obtained sequence is used for giving training to the neural network and a matrix called neural network master matrix (NNMM) is constructed, which is the basic knowledge of the neurons obtained after training. From the matrix, interpretations are made to determine the optimum sequence for the jobs that arrive in the future over a period of time. The results obtained by the ANN are compared with a constructive heuristics and an improvement heuristics. The results show that the quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics. It is found that the system’s efficiency (i.e., obtaining the optimal MS and TFT) increases with increasing numbers of training exemplars.</description><subject>Algorithms</subject><subject>Artificial neural networks</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>Job shop scheduling</subject><subject>Knowledge acquisition</subject><subject>Neural networks</subject><subject>Optimization</subject><subject>Production scheduling</subject><subject>Sequential scheduling</subject><subject>Training</subject><issn>0268-3768</issn><issn>1433-3015</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNotkMtOwzAURC0EEqXwAewisTZc-9Z2siwVL6kSG1hbN45NXUJS7EQVf09K2cxsjmakw9i1gFsBYO4ygDDAARQHgYqrEzYTC0SOINQpm4HUJUejy3N2kfN2orXQ5YzdL4s6uhQHnyJ1RWj7fZE3_a7IbuObsY3dRzHmQ1IaYoguUlt0fkx_Nez79HnJzgK12V_995y9Pz68rZ75-vXpZbVccycNDlzVHiU2WKKiII2o6gWRAUIixNKJqiIpmiYEIO20NE40BpAa1BQmTuOc3Rx3d6n_Hn0e7LYfUzddWim1VFAJpSZKHCmX-pyTD3aX4helHyvAHlTZoyo7qbIHVVbhL1K2W-Y</recordid><startdate>20061001</startdate><enddate>20061001</enddate><creator>Noorul Haq, A.</creator><creator>Radha Ramanan, T.</creator><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>20061001</creationdate><title>A bicriterian flow shop scheduling using artificial neural network</title><author>Noorul Haq, A. ; Radha Ramanan, T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c273t-5be323d3835af2719b4aa70a3aa338c199a21ddff0a6c627c1d703ad36afa7063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Artificial neural networks</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>Job shop scheduling</topic><topic>Knowledge acquisition</topic><topic>Neural networks</topic><topic>Optimization</topic><topic>Production scheduling</topic><topic>Sequential scheduling</topic><topic>Training</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Noorul Haq, A.</creatorcontrib><creatorcontrib>Radha Ramanan, T.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</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>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>Noorul Haq, A.</au><au>Radha Ramanan, T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A bicriterian flow shop scheduling using artificial neural network</atitle><jtitle>International journal of advanced manufacturing technology</jtitle><date>2006-10-01</date><risdate>2006</risdate><volume>30</volume><issue>11-12</issue><spage>1132</spage><epage>1138</epage><pages>1132-1138</pages><issn>0268-3768</issn><eissn>1433-3015</eissn><abstract>This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs. The authors have used the heuristics proposed by Campbell et al.(1970, A heuristic algorithm for n-jobs m-machines sequencing problem) to find a sequence and makespan (MS). Then a pair wise interchange of jobs is made to find the optimal MS and total flow time (TFT). The obtained sequence is used for giving training to the neural network and a matrix called neural network master matrix (NNMM) is constructed, which is the basic knowledge of the neurons obtained after training. From the matrix, interpretations are made to determine the optimum sequence for the jobs that arrive in the future over a period of time. The results obtained by the ANN are compared with a constructive heuristics and an improvement heuristics. The results show that the quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics. It is found that the system’s efficiency (i.e., obtaining the optimal MS and TFT) increases with increasing numbers of training exemplars.</abstract><cop>Heidelberg</cop><pub>Springer Nature B.V</pub><doi>10.1007/s00170-005-0135-5</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0268-3768 |
ispartof | International journal of advanced manufacturing technology, 2006-10, Vol.30 (11-12), p.1132-1138 |
issn | 0268-3768 1433-3015 |
language | eng |
recordid | cdi_proquest_journals_2262509155 |
source | SpringerNature Journals |
subjects | Algorithms Artificial neural networks Heuristic Heuristic methods Job shop scheduling Knowledge acquisition Neural networks Optimization Production scheduling Sequential scheduling Training |
title | A bicriterian flow shop scheduling using artificial neural network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T11%3A09%3A10IST&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=A%20bicriterian%20flow%20shop%20scheduling%20using%20artificial%20neural%20network&rft.jtitle=International%20journal%20of%20advanced%20manufacturing%20technology&rft.au=Noorul%20Haq,%20A.&rft.date=2006-10-01&rft.volume=30&rft.issue=11-12&rft.spage=1132&rft.epage=1138&rft.pages=1132-1138&rft.issn=0268-3768&rft.eissn=1433-3015&rft_id=info:doi/10.1007/s00170-005-0135-5&rft_dat=%3Cproquest_cross%3E2262509155%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=2262509155&rft_id=info:pmid/&rfr_iscdi=true |