Mixed integer programming formulation for hybrid flow shop scheduling problem

This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Omar, M K, Teo, S C, Suppiah, Y
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Annealing Batch production systems Chemicals discrete machines Equations Hybrid flow shop Job shop scheduling mixed integer programming scheduling
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	389
container_issue
container_start_page	385
container_title
container_volume
creator	Omar, M K Teo, S C Suppiah, Y
description	This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent the scheduling problem. Data was taken from the manufacturing firm to test the MIP to in terms of obtaining optimal solution for a reasonable size problem. The developed model was tested with loss and tight due dates conditions. The results indicate the model was able to provide optimal solution to all the cases considered.
doi_str_mv	10.1109/IEEM.2010.5674608
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5674608</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5674608</ieee_id><sourcerecordid>5674608</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-879e541314439230d1dfec84f2130a1bd3a8116d34fd6f1ce78b9ef807f28d13</originalsourceid><addsrcrecordid>eNpVUMlOwzAUNJtEVfoBiIt_IMXPdrwcURVKpUYc4MCtcuLn1ihpKicV9O9pRYXEaWY0y2EIuQc2BWD2cVEU5ZSzo8yVloqZCzKx2oDkUpqcCbgkIw65zoTiH1f_PNDXfx7ALZn0_SdjDLhR3KoRKcv4jZ7G7YBrTHSXunVybRu3axq61O4bN8Rue-J0c6hS9DQ03RftN92O9vUG_b45ZY-9qsH2jtwE1_Q4OeOYvD0X77OXbPk6X8yellm0bMiMtphLECClsFwwDz5gbWTgIJiDygtnAJQXMngVoEZtKovBMB248SDG5OF3NSLiapdi69Jhdb5G_ABhGVOp</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Mixed integer programming formulation for hybrid flow shop scheduling problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Omar, M K ; Teo, S C ; Suppiah, Y</creator><creatorcontrib>Omar, M K ; Teo, S C ; Suppiah, Y</creatorcontrib><description>This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent the scheduling problem. Data was taken from the manufacturing firm to test the MIP to in terms of obtaining optimal solution for a reasonable size problem. The developed model was tested with loss and tight due dates conditions. The results indicate the model was able to provide optimal solution to all the cases considered.</description><identifier>ISSN: 2157-3611</identifier><identifier>ISBN: 9781424485017</identifier><identifier>ISBN: 1424485010</identifier><identifier>EISSN: 2157-362X</identifier><identifier>EISBN: 9781424485031</identifier><identifier>EISBN: 9781424485024</identifier><identifier>EISBN: 1424485037</identifier><identifier>EISBN: 1424485029</identifier><identifier>DOI: 10.1109/IEEM.2010.5674608</identifier><language>eng</language><publisher>IEEE</publisher><subject>Annealing ; Batch production systems ; Chemicals ; discrete machines ; Equations ; Hybrid flow shop ; Job shop scheduling ; mixed integer programming ; scheduling</subject><ispartof>2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010, p.385-389</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/5674608$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5674608$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Omar, M K</creatorcontrib><creatorcontrib>Teo, S C</creatorcontrib><creatorcontrib>Suppiah, Y</creatorcontrib><title>Mixed integer programming formulation for hybrid flow shop scheduling problem</title><title>2010 IEEE International Conference on Industrial Engineering and Engineering Management</title><addtitle>IEEM</addtitle><description>This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent the scheduling problem. Data was taken from the manufacturing firm to test the MIP to in terms of obtaining optimal solution for a reasonable size problem. The developed model was tested with loss and tight due dates conditions. The results indicate the model was able to provide optimal solution to all the cases considered.</description><subject>Annealing</subject><subject>Batch production systems</subject><subject>Chemicals</subject><subject>discrete machines</subject><subject>Equations</subject><subject>Hybrid flow shop</subject><subject>Job shop scheduling</subject><subject>mixed integer programming</subject><subject>scheduling</subject><issn>2157-3611</issn><issn>2157-362X</issn><isbn>9781424485017</isbn><isbn>1424485010</isbn><isbn>9781424485031</isbn><isbn>9781424485024</isbn><isbn>1424485037</isbn><isbn>1424485029</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVUMlOwzAUNJtEVfoBiIt_IMXPdrwcURVKpUYc4MCtcuLn1ihpKicV9O9pRYXEaWY0y2EIuQc2BWD2cVEU5ZSzo8yVloqZCzKx2oDkUpqcCbgkIw65zoTiH1f_PNDXfx7ALZn0_SdjDLhR3KoRKcv4jZ7G7YBrTHSXunVybRu3axq61O4bN8Rue-J0c6hS9DQ03RftN92O9vUG_b45ZY-9qsH2jtwE1_Q4OeOYvD0X77OXbPk6X8yellm0bMiMtphLECClsFwwDz5gbWTgIJiDygtnAJQXMngVoEZtKovBMB248SDG5OF3NSLiapdi69Jhdb5G_ABhGVOp</recordid><startdate>201012</startdate><enddate>201012</enddate><creator>Omar, M K</creator><creator>Teo, S C</creator><creator>Suppiah, Y</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201012</creationdate><title>Mixed integer programming formulation for hybrid flow shop scheduling problem</title><author>Omar, M K ; Teo, S C ; Suppiah, Y</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-879e541314439230d1dfec84f2130a1bd3a8116d34fd6f1ce78b9ef807f28d13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Annealing</topic><topic>Batch production systems</topic><topic>Chemicals</topic><topic>discrete machines</topic><topic>Equations</topic><topic>Hybrid flow shop</topic><topic>Job shop scheduling</topic><topic>mixed integer programming</topic><topic>scheduling</topic><toplevel>online_resources</toplevel><creatorcontrib>Omar, M K</creatorcontrib><creatorcontrib>Teo, S C</creatorcontrib><creatorcontrib>Suppiah, Y</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Omar, M K</au><au>Teo, S C</au><au>Suppiah, Y</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Mixed integer programming formulation for hybrid flow shop scheduling problem</atitle><btitle>2010 IEEE International Conference on Industrial Engineering and Engineering Management</btitle><stitle>IEEM</stitle><date>2010-12</date><risdate>2010</risdate><spage>385</spage><epage>389</epage><pages>385-389</pages><issn>2157-3611</issn><eissn>2157-362X</eissn><isbn>9781424485017</isbn><isbn>1424485010</isbn><eisbn>9781424485031</eisbn><eisbn>9781424485024</eisbn><eisbn>1424485037</eisbn><eisbn>1424485029</eisbn><abstract>This paper addresses a complex hybrid flow shop (HFS) scheduling problem confronted in a real industrial environment in which a manufacturing firm provides electroplating service to the electronic and semiconductor industries. A mixed integer programming (MIP) formulation was developed to represent the scheduling problem. Data was taken from the manufacturing firm to test the MIP to in terms of obtaining optimal solution for a reasonable size problem. The developed model was tested with loss and tight due dates conditions. The results indicate the model was able to provide optimal solution to all the cases considered.</abstract><pub>IEEE</pub><doi>10.1109/IEEM.2010.5674608</doi><tpages>5</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2157-3611
ispartof	2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010, p.385-389
issn	2157-3611 2157-362X
language	eng
recordid	cdi_ieee_primary_5674608
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Annealing Batch production systems Chemicals discrete machines Equations Hybrid flow shop Job shop scheduling mixed integer programming scheduling
title	Mixed integer programming formulation for hybrid flow shop scheduling problem
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T18%3A26%3A46IST&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=Mixed%20integer%20programming%20formulation%20for%20hybrid%20flow%20shop%20scheduling%20problem&rft.btitle=2010%20IEEE%20International%20Conference%20on%20Industrial%20Engineering%20and%20Engineering%20Management&rft.au=Omar,%20M%20K&rft.date=2010-12&rft.spage=385&rft.epage=389&rft.pages=385-389&rft.issn=2157-3611&rft.eissn=2157-362X&rft.isbn=9781424485017&rft.isbn_list=1424485010&rft_id=info:doi/10.1109/IEEM.2010.5674608&rft_dat=%3Cieee_6IE%3E5674608%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424485031&rft.eisbn_list=9781424485024&rft.eisbn_list=1424485037&rft.eisbn_list=1424485029&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5674608&rfr_iscdi=true