Solving the single-machine sequencing problem using integer programming
Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of espe...
Gespeichert in:
| Veröffentlicht in: | Computers & industrial engineering 2010-11, Vol.59 (4), p.730-735 |
|---|---|
| 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 | 735 |
|---|---|
| container_issue | 4 |
| container_start_page | 730 |
| container_title | Computers & industrial engineering |
| container_volume | 59 |
| creator | Baker, Kenneth R. Keller, Brian |
| description | Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using CPLEX software. We found that one formulation performs much more effectively than the others. A generic integer programming approach is still not capable of solving problems with hundreds of jobs, so in that respect, it does not compete with state-of-the-art tardiness algorithms. However, the integer programming approach remains viable for problems containing as many as 40 or 50 jobs and may be the better algorithmic choice when convenience in implementation is considered. |
| doi_str_mv | 10.1016/j.cie.2010.07.028 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_831192523</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0360835210002196</els_id><sourcerecordid>831192523</sourcerecordid><originalsourceid>FETCH-LOGICAL-c356t-8f710c356988ce0bc6320c17ea497f3a17472655dc7474d53516bb07b7de3d7b3</originalsourceid><addsrcrecordid>eNp9kD9PwzAQxS0EEqXwAdgiFqaEsx3HjphQBQWpEgMwW4lzaR3lT7GTSnz7OioTA5PfnX_vfH6E3FJIKNDsoUmMxYRBqEEmwNQZWVAl8xiEgHOyAJ5BrLhgl-TK-wYAUpHTBVl_DO3B9tto3GHkg2gx7gqzs30o8XvC3sy3ezeULXbRNCOR7Ufcopu7W1d0Xehdk4u6aD3e_J5L8vXy_Ll6jTfv67fV0yY2XGRjrGpJYZa5UgahNBlnYKjEIs1lzQsqU8kyISoTRFoJLmhWliBLWSGvZMmX5P40N7wdtvOj7qw32LZFj8PkteKU5kwwHsi7P2QzTK4Py2kFMhcKKAsQPUHGDd47rPXe2a5wP5qCnoPVjQ7B6jlYDVKHYIPn8eTB8M-DRad9QHqDlXVoRl0N9h_3EVcaf9k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>807958012</pqid></control><display><type>article</type><title>Solving the single-machine sequencing problem using integer programming</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Baker, Kenneth R. ; Keller, Brian</creator><creatorcontrib>Baker, Kenneth R. ; Keller, Brian</creatorcontrib><description>Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using CPLEX software. We found that one formulation performs much more effectively than the others. A generic integer programming approach is still not capable of solving problems with hundreds of jobs, so in that respect, it does not compete with state-of-the-art tardiness algorithms. However, the integer programming approach remains viable for problems containing as many as 40 or 50 jobs and may be the better algorithmic choice when convenience in implementation is considered.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/j.cie.2010.07.028</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Algorithms ; Comparative analysis ; Computer programs ; Computer simulation ; Genetic algorithms ; Integer programming ; Mathematical models ; Sequencing ; Sequential scheduling ; Software ; State of the art ; Studies ; Tardiness problem</subject><ispartof>Computers & industrial engineering, 2010-11, Vol.59 (4), p.730-735</ispartof><rights>2010 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Nov 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c356t-8f710c356988ce0bc6320c17ea497f3a17472655dc7474d53516bb07b7de3d7b3</citedby><cites>FETCH-LOGICAL-c356t-8f710c356988ce0bc6320c17ea497f3a17472655dc7474d53516bb07b7de3d7b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0360835210002196$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids></links><search><creatorcontrib>Baker, Kenneth R.</creatorcontrib><creatorcontrib>Keller, Brian</creatorcontrib><title>Solving the single-machine sequencing problem using integer programming</title><title>Computers & industrial engineering</title><description>Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using CPLEX software. We found that one formulation performs much more effectively than the others. A generic integer programming approach is still not capable of solving problems with hundreds of jobs, so in that respect, it does not compete with state-of-the-art tardiness algorithms. However, the integer programming approach remains viable for problems containing as many as 40 or 50 jobs and may be the better algorithmic choice when convenience in implementation is considered.</description><subject>Algorithms</subject><subject>Comparative analysis</subject><subject>Computer programs</subject><subject>Computer simulation</subject><subject>Genetic algorithms</subject><subject>Integer programming</subject><subject>Mathematical models</subject><subject>Sequencing</subject><subject>Sequential scheduling</subject><subject>Software</subject><subject>State of the art</subject><subject>Studies</subject><subject>Tardiness problem</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNp9kD9PwzAQxS0EEqXwAdgiFqaEsx3HjphQBQWpEgMwW4lzaR3lT7GTSnz7OioTA5PfnX_vfH6E3FJIKNDsoUmMxYRBqEEmwNQZWVAl8xiEgHOyAJ5BrLhgl-TK-wYAUpHTBVl_DO3B9tto3GHkg2gx7gqzs30o8XvC3sy3ezeULXbRNCOR7Ufcopu7W1d0Xehdk4u6aD3e_J5L8vXy_Ll6jTfv67fV0yY2XGRjrGpJYZa5UgahNBlnYKjEIs1lzQsqU8kyISoTRFoJLmhWliBLWSGvZMmX5P40N7wdtvOj7qw32LZFj8PkteKU5kwwHsi7P2QzTK4Py2kFMhcKKAsQPUHGDd47rPXe2a5wP5qCnoPVjQ7B6jlYDVKHYIPn8eTB8M-DRad9QHqDlXVoRl0N9h_3EVcaf9k</recordid><startdate>20101101</startdate><enddate>20101101</enddate><creator>Baker, Kenneth R.</creator><creator>Keller, Brian</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20101101</creationdate><title>Solving the single-machine sequencing problem using integer programming</title><author>Baker, Kenneth R. ; Keller, Brian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c356t-8f710c356988ce0bc6320c17ea497f3a17472655dc7474d53516bb07b7de3d7b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Comparative analysis</topic><topic>Computer programs</topic><topic>Computer simulation</topic><topic>Genetic algorithms</topic><topic>Integer programming</topic><topic>Mathematical models</topic><topic>Sequencing</topic><topic>Sequential scheduling</topic><topic>Software</topic><topic>State of the art</topic><topic>Studies</topic><topic>Tardiness problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baker, Kenneth R.</creatorcontrib><creatorcontrib>Keller, Brian</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Baker, Kenneth R.</au><au>Keller, Brian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Solving the single-machine sequencing problem using integer programming</atitle><jtitle>Computers & industrial engineering</jtitle><date>2010-11-01</date><risdate>2010</risdate><volume>59</volume><issue>4</issue><spage>730</spage><epage>735</epage><pages>730-735</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>Various integer programming models have been proposed for sequencing problems. However, little is known about the practical value of these models. This paper reports a comparison of six different integer programming formulations of the single-machine total tardiness problem. We created a set of especially difficult test problems and attempted to solve them with each of the formulations, using CPLEX software. We found that one formulation performs much more effectively than the others. A generic integer programming approach is still not capable of solving problems with hundreds of jobs, so in that respect, it does not compete with state-of-the-art tardiness algorithms. However, the integer programming approach remains viable for problems containing as many as 40 or 50 jobs and may be the better algorithmic choice when convenience in implementation is considered.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cie.2010.07.028</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-8352 |
| ispartof | Computers & industrial engineering, 2010-11, Vol.59 (4), p.730-735 |
| issn | 0360-8352 1879-0550 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_831192523 |
| source | Elsevier ScienceDirect Journals Complete |
| subjects | Algorithms Comparative analysis Computer programs Computer simulation Genetic algorithms Integer programming Mathematical models Sequencing Sequential scheduling Software State of the art Studies Tardiness problem |
| title | Solving the single-machine sequencing problem using integer programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T16%3A25%3A23IST&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=Solving%20the%20single-machine%20sequencing%20problem%20using%20integer%20programming&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Baker,%20Kenneth%20R.&rft.date=2010-11-01&rft.volume=59&rft.issue=4&rft.spage=730&rft.epage=735&rft.pages=730-735&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/j.cie.2010.07.028&rft_dat=%3Cproquest_cross%3E831192523%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=807958012&rft_id=info:pmid/&rft_els_id=S0360835210002196&rfr_iscdi=true |