Sequency on two and three machines with setup, processing and removal times separated

Sequency on two and three machines with setup, processing and removal times separated

n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research 1983-09, Vol.21 (5), p.723-732
Hauptverfasser: SULE, DILEEP R., HUANG, KIN YANN
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 732
container_issue 5
container_start_page 723
container_title International journal of production research
container_volume 21
creator SULE, DILEEP R.
HUANG, KIN YANN
description n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.
doi_str_mv 10.1080/00207548308942406
format Article
fullrecord <record><control><sourceid>proquest_infor</sourceid><recordid>TN_cdi_proquest_miscellaneous_23374225</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>23374225</sourcerecordid><originalsourceid>FETCH-LOGICAL-c242t-c9085648678b20e107a49f2398b575d1a531d223697f8347d9d3e9f3ad6095c3</originalsourceid><addsrcrecordid>eNp1kE1LAzEQhoMoWKs_wFtOnlzN524CXqT4BQUPVvAW0iRrI7vJmqSW_nu31ps4lznM8wwzLwDnGF1hJNA1QgQ1nAmKhGSEofoATDCt64oL8XYIJrt5NQL0GJzk_IHG4oJNwOuL-1y7YLYwBlg2EepgYVkl52CvzcoHl-HGlxXMrqyHSzikaFzOPrz_kMn18Ut3sPh-BLMbdNLF2VNw1Oouu7PfPgWL-7vF7LGaPz88zW7nlSGMlMpIJHjNRN2IJUEOo0Yz2RIqxZI33GLNKbaE0Fo2raCssdJSJ1uqbY0kN3QKLvZrx6vGL3JRvc_GdZ0OLq6zIpQ2jBA-gngPmhRzTq5VQ_K9TluFkdrlp_7kNzo3e8eHNqZeb2LqrCp628XUJh2Mz4r-r38DcKN0-g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>23374225</pqid></control><display><type>article</type><title>Sequency on two and three machines with setup, processing and removal times separated</title><source>Business Source Complete</source><source>Taylor &amp; Francis:Master (3349 titles)</source><creator>SULE, DILEEP R. ; HUANG, KIN YANN</creator><creatorcontrib>SULE, DILEEP R. ; HUANG, KIN YANN</creatorcontrib><description>n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207548308942406</identifier><language>eng</language><publisher>Taylor &amp; Francis Group</publisher><ispartof>International journal of production research, 1983-09, Vol.21 (5), p.723-732</ispartof><rights>Copyright Taylor &amp; Francis Group, LLC 1983</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c242t-c9085648678b20e107a49f2398b575d1a531d223697f8347d9d3e9f3ad6095c3</citedby><cites>FETCH-LOGICAL-c242t-c9085648678b20e107a49f2398b575d1a531d223697f8347d9d3e9f3ad6095c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207548308942406$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207548308942406$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,59623,60412</link.rule.ids></links><search><creatorcontrib>SULE, DILEEP R.</creatorcontrib><creatorcontrib>HUANG, KIN YANN</creatorcontrib><title>Sequency on two and three machines with setup, processing and removal times separated</title><title>International journal of production research</title><description>n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.</description><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1983</creationdate><recordtype>article</recordtype><recordid>eNp1kE1LAzEQhoMoWKs_wFtOnlzN524CXqT4BQUPVvAW0iRrI7vJmqSW_nu31ps4lznM8wwzLwDnGF1hJNA1QgQ1nAmKhGSEofoATDCt64oL8XYIJrt5NQL0GJzk_IHG4oJNwOuL-1y7YLYwBlg2EepgYVkl52CvzcoHl-HGlxXMrqyHSzikaFzOPrz_kMn18Ut3sPh-BLMbdNLF2VNw1Oouu7PfPgWL-7vF7LGaPz88zW7nlSGMlMpIJHjNRN2IJUEOo0Yz2RIqxZI33GLNKbaE0Fo2raCssdJSJ1uqbY0kN3QKLvZrx6vGL3JRvc_GdZ0OLq6zIpQ2jBA-gngPmhRzTq5VQ_K9TluFkdrlp_7kNzo3e8eHNqZeb2LqrCp628XUJh2Mz4r-r38DcKN0-g</recordid><startdate>19830901</startdate><enddate>19830901</enddate><creator>SULE, DILEEP R.</creator><creator>HUANG, KIN YANN</creator><general>Taylor &amp; Francis Group</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>19830901</creationdate><title>Sequency on two and three machines with setup, processing and removal times separated</title><author>SULE, DILEEP R. ; HUANG, KIN YANN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c242t-c9085648678b20e107a49f2398b575d1a531d223697f8347d9d3e9f3ad6095c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1983</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>SULE, DILEEP R.</creatorcontrib><creatorcontrib>HUANG, KIN YANN</creatorcontrib><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>SULE, DILEEP R.</au><au>HUANG, KIN YANN</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sequency on two and three machines with setup, processing and removal times separated</atitle><jtitle>International journal of production research</jtitle><date>1983-09-01</date><risdate>1983</risdate><volume>21</volume><issue>5</issue><spage>723</spage><epage>732</epage><pages>723-732</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><abstract>n jobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.</abstract><pub>Taylor &amp; Francis Group</pub><doi>10.1080/00207548308942406</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0020-7543
ispartof International journal of production research, 1983-09, Vol.21 (5), p.723-732
issn 0020-7543
1366-588X
language eng
recordid cdi_proquest_miscellaneous_23374225
source Business Source Complete; Taylor & Francis:Master (3349 titles)
title Sequency on two and three machines with setup, processing and removal times separated
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T18%3A17%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sequency%20on%20two%20and%20three%20machines%20with%20setup,%20processing%20and%20removal%20times%20separated&rft.jtitle=International%20journal%20of%20production%20research&rft.au=SULE,%20DILEEP%20R.&rft.date=1983-09-01&rft.volume=21&rft.issue=5&rft.spage=723&rft.epage=732&rft.pages=723-732&rft.issn=0020-7543&rft.eissn=1366-588X&rft_id=info:doi/10.1080/00207548308942406&rft_dat=%3Cproquest_infor%3E23374225%3C/proquest_infor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=23374225&rft_id=info:pmid/&rfr_iscdi=true