Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing
This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is...
Gespeichert in:
| Veröffentlicht in: | International journal of production economics 2004-01, Vol.87 (2), p.141-147 |
|---|---|
| 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 | 147 |
|---|---|
| container_issue | 2 |
| container_start_page | 141 |
| container_title | International journal of production economics |
| container_volume | 87 |
| creator | Melouk, Sharif Damodaran, Purushothaman Chang, Ping-Yu |
| description | This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances. |
| doi_str_mv | 10.1016/S0925-5273(03)00092-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_199016595</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0925527303000926</els_id><sourcerecordid>587499681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c432t-b5a2c46575e63f75687021c1e2630979dc6a14a87e6ebf06e42380e68917c9763</originalsourceid><addsrcrecordid>eNqFUMFO3DAQtaoisQU-Acni1B5C7Ti241NVIQqtQByAs-V1Jl0viZPaWardr2eyW3Gt5PHYM2_ePD1Czjm75Iyrr4_MlLKQpRafmfjCGH4L9YEseK1FoaU2H8niHXJMPuW8RpDmdb0g8T7E0IddiL9p714gjy7Sdkg0Y6UDrPlViECXbvIrOqbBQ55b9G-YVjQOsQgNxCl419H1sMSxHWS62UNy6Dedm6ChLkZwHdZOyVHrugxn__IJef5x_XR1W9w93Py8-n5X-EqUU7GUrvSVklqCEq2Wqtas5J5DqQQz2jReOV65WoOCZcsUVKWoGajacO2NVuKEXBx4UfGfDeTJrodNirjScmPQNGkkguQB5NOQc4LWjin0Lm0tZ3Z21u6dtbNtluGZnbUz-a_DXIIR_PsQAOA28IN9tQK14bXFKBmrMIX5iTFi8IpbXmm7mnok-3YgA7TjNUCy2QeIHpqQwE-2GcJ_5LwB0uWaEA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199016595</pqid></control><display><type>article</type><title>Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing</title><source>RePEc</source><source>Elsevier ScienceDirect Journals Complete</source><creator>Melouk, Sharif ; Damodaran, Purushothaman ; Chang, Ping-Yu</creator><creatorcontrib>Melouk, Sharif ; Damodaran, Purushothaman ; Chang, Ping-Yu</creatorcontrib><description>This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances.</description><identifier>ISSN: 0925-5273</identifier><identifier>EISSN: 1873-7579</identifier><identifier>DOI: 10.1016/S0925-5273(03)00092-6</identifier><identifier>CODEN: IJPCEY</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Batch processing ; Mathematical models ; Production scheduling ; Scheduling ; Simulated annealing ; Simulation ; Studies</subject><ispartof>International journal of production economics, 2004-01, Vol.87 (2), p.141-147</ispartof><rights>2003 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jan 28, 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c432t-b5a2c46575e63f75687021c1e2630979dc6a14a87e6ebf06e42380e68917c9763</citedby><cites>FETCH-LOGICAL-c432t-b5a2c46575e63f75687021c1e2630979dc6a14a87e6ebf06e42380e68917c9763</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0925-5273(03)00092-6$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeproeco/v_3a87_3ay_3a2004_3ai_3a2_3ap_3a141-147.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Melouk, Sharif</creatorcontrib><creatorcontrib>Damodaran, Purushothaman</creatorcontrib><creatorcontrib>Chang, Ping-Yu</creatorcontrib><title>Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing</title><title>International journal of production economics</title><description>This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances.</description><subject>Batch processing</subject><subject>Mathematical models</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Simulated annealing</subject><subject>Simulation</subject><subject>Studies</subject><issn>0925-5273</issn><issn>1873-7579</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFUMFO3DAQtaoisQU-Acni1B5C7Ti241NVIQqtQByAs-V1Jl0viZPaWardr2eyW3Gt5PHYM2_ePD1Czjm75Iyrr4_MlLKQpRafmfjCGH4L9YEseK1FoaU2H8niHXJMPuW8RpDmdb0g8T7E0IddiL9p714gjy7Sdkg0Y6UDrPlViECXbvIrOqbBQ55b9G-YVjQOsQgNxCl419H1sMSxHWS62UNy6Dedm6ChLkZwHdZOyVHrugxn__IJef5x_XR1W9w93Py8-n5X-EqUU7GUrvSVklqCEq2Wqtas5J5DqQQz2jReOV65WoOCZcsUVKWoGajacO2NVuKEXBx4UfGfDeTJrodNirjScmPQNGkkguQB5NOQc4LWjin0Lm0tZ3Z21u6dtbNtluGZnbUz-a_DXIIR_PsQAOA28IN9tQK14bXFKBmrMIX5iTFi8IpbXmm7mnok-3YgA7TjNUCy2QeIHpqQwE-2GcJ_5LwB0uWaEA</recordid><startdate>20040128</startdate><enddate>20040128</enddate><creator>Melouk, Sharif</creator><creator>Damodaran, Purushothaman</creator><creator>Chang, Ping-Yu</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TA</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>KR7</scope></search><sort><creationdate>20040128</creationdate><title>Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing</title><author>Melouk, Sharif ; Damodaran, Purushothaman ; Chang, Ping-Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c432t-b5a2c46575e63f75687021c1e2630979dc6a14a87e6ebf06e42380e68917c9763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Batch processing</topic><topic>Mathematical models</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Simulated annealing</topic><topic>Simulation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Melouk, Sharif</creatorcontrib><creatorcontrib>Damodaran, Purushothaman</creatorcontrib><creatorcontrib>Chang, Ping-Yu</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>International journal of production economics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Melouk, Sharif</au><au>Damodaran, Purushothaman</au><au>Chang, Ping-Yu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing</atitle><jtitle>International journal of production economics</jtitle><date>2004-01-28</date><risdate>2004</risdate><volume>87</volume><issue>2</issue><spage>141</spage><epage>147</epage><pages>141-147</pages><issn>0925-5273</issn><eissn>1873-7579</eissn><coden>IJPCEY</coden><abstract>This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0925-5273(03)00092-6</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0925-5273 |
| ispartof | International journal of production economics, 2004-01, Vol.87 (2), p.141-147 |
| issn | 0925-5273 1873-7579 |
| language | eng |
| recordid | cdi_proquest_journals_199016595 |
| source | RePEc; Elsevier ScienceDirect Journals Complete |
| subjects | Batch processing Mathematical models Production scheduling Scheduling Simulated annealing Simulation Studies |
| title | Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T11%3A42%3A06IST&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=Minimizing%20makespan%20for%20single%20machine%20batch%20processing%20with%20non-identical%20job%20sizes%20using%20simulated%20annealing&rft.jtitle=International%20journal%20of%20production%20economics&rft.au=Melouk,%20Sharif&rft.date=2004-01-28&rft.volume=87&rft.issue=2&rft.spage=141&rft.epage=147&rft.pages=141-147&rft.issn=0925-5273&rft.eissn=1873-7579&rft.coden=IJPCEY&rft_id=info:doi/10.1016/S0925-5273(03)00092-6&rft_dat=%3Cproquest_cross%3E587499681%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=199016595&rft_id=info:pmid/&rft_els_id=S0925527303000926&rfr_iscdi=true |