Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices
The goal of this paper is to propose a novel mixed integer programming (MIP) formulation for the deadlock-free job shop scheduling problem with limited capacity buffers. Two scenarios are considered; the presence of a central buffer, and unit capacity input buffers for the machines. Due to the compl...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2781 |
|---|---|
| container_issue | |
| container_start_page | 2776 |
| container_title | |
| container_volume | |
| creator | Fahmy, Sherif A. El Mekkawy, Tarek Y. Balakrishnan, Subramaniam |
| description | The goal of this paper is to propose a novel mixed integer programming (MIP) formulation for the deadlock-free job shop scheduling problem with limited capacity buffers. Two scenarios are considered; the presence of a central buffer, and unit capacity input buffers for the machines. Due to the complexity of the problem, an operations insertion heuristic based on rank matrices is also proposed to solve the problem. In this heuristic, rank matrices are used to generate the schedules and to check for deadlock situations and machine blocking considering the presence of a central buffer. To evaluate the performances of the mathematical models and the heuristic, comparisons to other approaches reported in literature are conducted. |
| doi_str_mv | 10.1109/ICSMC.2007.4413614 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4413614</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4413614</ieee_id><sourcerecordid>4413614</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-e92698dd36b4403c28c95edf91b8e55e914dba3f73599c1e8f24c2785bcbfc443</originalsourceid><addsrcrecordid>eNo1kMtuwjAURN0HUgnlB9qNfyDU14_EXlZRaalArQQLdsixbyCFJMgGqf37gko3M4uRjmaGkAdgIwBmnibFfFaMOGP5SEoQGcgrMjS5BsmlZMaAvCZ9rvI8hUypG5L8B2x5S_rAMp4azpc9kpwZhjOh4I4kMX4xxpkE3Sfz966kcdPtqUfrd53bplVApNFt0B93dbumx3jWWf2Nnk7aA64x0M_QrYNtmnNiW0-Dbbe0sYdQO4z3pFfZXcThxQdkMX5ZFG_p9ON1UjxP09qwQ4qGZ0Z7L7Ly1Fk4rp1R6CsDpUal8LTOl1ZUuVDGOEBdcel4rlXpyspJKQbk8Q9bI-JqH-rGhp_V5SjxCx7mVvs</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fahmy, Sherif A. ; El Mekkawy, Tarek Y. ; Balakrishnan, Subramaniam</creator><creatorcontrib>Fahmy, Sherif A. ; El Mekkawy, Tarek Y. ; Balakrishnan, Subramaniam</creatorcontrib><description>The goal of this paper is to propose a novel mixed integer programming (MIP) formulation for the deadlock-free job shop scheduling problem with limited capacity buffers. Two scenarios are considered; the presence of a central buffer, and unit capacity input buffers for the machines. Due to the complexity of the problem, an operations insertion heuristic based on rank matrices is also proposed to solve the problem. In this heuristic, rank matrices are used to generate the schedules and to check for deadlock situations and machine blocking considering the presence of a central buffer. To evaluate the performances of the mathematical models and the heuristic, comparisons to other approaches reported in literature are conducted.</description><identifier>ISSN: 1062-922X</identifier><identifier>ISBN: 142440990X</identifier><identifier>ISBN: 9781424409907</identifier><identifier>EISSN: 2577-1655</identifier><identifier>EISBN: 9781424409914</identifier><identifier>EISBN: 1424409918</identifier><identifier>DOI: 10.1109/ICSMC.2007.4413614</identifier><identifier>LCCN: 2007920351</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automata ; deadlock-free ; heuristic ; Job shop ; Job shop scheduling ; Linear programming ; Manufacturing automation ; Manufacturing systems ; mathematical formulations ; Mathematical model ; Performance evaluation ; Pulp manufacturing ; Scheduling algorithm ; System recovery</subject><ispartof>2007 IEEE International Conference on Systems, Man and Cybernetics, 2007, p.2776-2781</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4413614$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,27930,54925</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4413614$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fahmy, Sherif A.</creatorcontrib><creatorcontrib>El Mekkawy, Tarek Y.</creatorcontrib><creatorcontrib>Balakrishnan, Subramaniam</creatorcontrib><title>Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices</title><title>2007 IEEE International Conference on Systems, Man and Cybernetics</title><addtitle>ICSMC</addtitle><description>The goal of this paper is to propose a novel mixed integer programming (MIP) formulation for the deadlock-free job shop scheduling problem with limited capacity buffers. Two scenarios are considered; the presence of a central buffer, and unit capacity input buffers for the machines. Due to the complexity of the problem, an operations insertion heuristic based on rank matrices is also proposed to solve the problem. In this heuristic, rank matrices are used to generate the schedules and to check for deadlock situations and machine blocking considering the presence of a central buffer. To evaluate the performances of the mathematical models and the heuristic, comparisons to other approaches reported in literature are conducted.</description><subject>Automata</subject><subject>deadlock-free</subject><subject>heuristic</subject><subject>Job shop</subject><subject>Job shop scheduling</subject><subject>Linear programming</subject><subject>Manufacturing automation</subject><subject>Manufacturing systems</subject><subject>mathematical formulations</subject><subject>Mathematical model</subject><subject>Performance evaluation</subject><subject>Pulp manufacturing</subject><subject>Scheduling algorithm</subject><subject>System recovery</subject><issn>1062-922X</issn><issn>2577-1655</issn><isbn>142440990X</isbn><isbn>9781424409907</isbn><isbn>9781424409914</isbn><isbn>1424409918</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kMtuwjAURN0HUgnlB9qNfyDU14_EXlZRaalArQQLdsixbyCFJMgGqf37gko3M4uRjmaGkAdgIwBmnibFfFaMOGP5SEoQGcgrMjS5BsmlZMaAvCZ9rvI8hUypG5L8B2x5S_rAMp4azpc9kpwZhjOh4I4kMX4xxpkE3Sfz966kcdPtqUfrd53bplVApNFt0B93dbumx3jWWf2Nnk7aA64x0M_QrYNtmnNiW0-Dbbe0sYdQO4z3pFfZXcThxQdkMX5ZFG_p9ON1UjxP09qwQ4qGZ0Z7L7Ly1Fk4rp1R6CsDpUal8LTOl1ZUuVDGOEBdcel4rlXpyspJKQbk8Q9bI-JqH-rGhp_V5SjxCx7mVvs</recordid><startdate>200710</startdate><enddate>200710</enddate><creator>Fahmy, Sherif A.</creator><creator>El Mekkawy, Tarek Y.</creator><creator>Balakrishnan, Subramaniam</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200710</creationdate><title>Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices</title><author>Fahmy, Sherif A. ; El Mekkawy, Tarek Y. ; Balakrishnan, Subramaniam</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-e92698dd36b4403c28c95edf91b8e55e914dba3f73599c1e8f24c2785bcbfc443</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Automata</topic><topic>deadlock-free</topic><topic>heuristic</topic><topic>Job shop</topic><topic>Job shop scheduling</topic><topic>Linear programming</topic><topic>Manufacturing automation</topic><topic>Manufacturing systems</topic><topic>mathematical formulations</topic><topic>Mathematical model</topic><topic>Performance evaluation</topic><topic>Pulp manufacturing</topic><topic>Scheduling algorithm</topic><topic>System recovery</topic><toplevel>online_resources</toplevel><creatorcontrib>Fahmy, Sherif A.</creatorcontrib><creatorcontrib>El Mekkawy, Tarek Y.</creatorcontrib><creatorcontrib>Balakrishnan, Subramaniam</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fahmy, Sherif A.</au><au>El Mekkawy, Tarek Y.</au><au>Balakrishnan, Subramaniam</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices</atitle><btitle>2007 IEEE International Conference on Systems, Man and Cybernetics</btitle><stitle>ICSMC</stitle><date>2007-10</date><risdate>2007</risdate><spage>2776</spage><epage>2781</epage><pages>2776-2781</pages><issn>1062-922X</issn><eissn>2577-1655</eissn><isbn>142440990X</isbn><isbn>9781424409907</isbn><eisbn>9781424409914</eisbn><eisbn>1424409918</eisbn><abstract>The goal of this paper is to propose a novel mixed integer programming (MIP) formulation for the deadlock-free job shop scheduling problem with limited capacity buffers. Two scenarios are considered; the presence of a central buffer, and unit capacity input buffers for the machines. Due to the complexity of the problem, an operations insertion heuristic based on rank matrices is also proposed to solve the problem. In this heuristic, rank matrices are used to generate the schedules and to check for deadlock situations and machine blocking considering the presence of a central buffer. To evaluate the performances of the mathematical models and the heuristic, comparisons to other approaches reported in literature are conducted.</abstract><pub>IEEE</pub><doi>10.1109/ICSMC.2007.4413614</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1062-922X |
| ispartof | 2007 IEEE International Conference on Systems, Man and Cybernetics, 2007, p.2776-2781 |
| issn | 1062-922X 2577-1655 |
| language | eng |
| recordid | cdi_ieee_primary_4413614 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Automata deadlock-free heuristic Job shop Job shop scheduling Linear programming Manufacturing automation Manufacturing systems mathematical formulations Mathematical model Performance evaluation Pulp manufacturing Scheduling algorithm System recovery |
| title | Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T09%3A00%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Job%20shop%20deadlock-free%20scheduling%20using%20Mixed%20Integer%20Programming%20and%20rank%20matrices&rft.btitle=2007%20IEEE%20International%20Conference%20on%20Systems,%20Man%20and%20Cybernetics&rft.au=Fahmy,%20Sherif%20A.&rft.date=2007-10&rft.spage=2776&rft.epage=2781&rft.pages=2776-2781&rft.issn=1062-922X&rft.eissn=2577-1655&rft.isbn=142440990X&rft.isbn_list=9781424409907&rft_id=info:doi/10.1109/ICSMC.2007.4413614&rft_dat=%3Cieee_6IE%3E4413614%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424409914&rft.eisbn_list=1424409918&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4413614&rfr_iscdi=true |