A solution to the capacitated lot sizing problem

A solution to the capacitated lot sizing problem

We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zhicong Zhang, Weiping Wang, Shouyan Zhong, Kaishun Hu
Format: Tagungsbericht
Sprache:eng
Schlagworte:
capacity constraint
Containers
Europe
Heuristic algorithms
Lot sizing
Mathematical programming
network algorithm
Shortest path problem
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 559
container_issue
container_start_page 555
container_title
container_volume
creator Zhicong Zhang
Weiping Wang
Shouyan Zhong
Kaishun Hu
description We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity in one period is integral multiple of the capacity of a container and reveal the special structure of the optimal solution. We transfer the lot sizing problem into a shortest path problem and propose a network algorithm to deal with it. The T-period problem is solved in O(T 4 ) effort by the network algorithm.
doi_str_mv 10.1109/IEEM.2011.6117978
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6117978</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6117978</ieee_id><sourcerecordid>6117978</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-f470f19566a6d7598356dc8e71303e0ff8fad163d0e3a6ee4a1cf4cc473c91493</originalsourceid><addsrcrecordid>eNo9j81Kw0AURsc_sNY8gLiZF0i8N_O_LCVqoeJGwV0ZJ3d0JG1CMi706RUMbs63OPDBYewKoUIEd7NpmoeqBsRKIxpn7BErfolSGQNGWHnMFjUqUwpdv5ywi1lIEKf_AvGcFdP0AQBYW107vWCw4lPffebUH3jueX4nHvzgQ8o-U8u7PvMpfafDGx_G_rWj_SU7i76bqJh3yZ5vm6f1fbl9vNusV9syoVG5jNJARKe09ro1ylmhdBssGRQgCGK00beoRQskvCaSHkOUIUgjgkPpxJJd__0mItoNY9r78Ws3x4sfcO1IMQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A solution to the capacitated lot sizing problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhicong Zhang ; Weiping Wang ; Shouyan Zhong ; Kaishun Hu</creator><creatorcontrib>Zhicong Zhang ; Weiping Wang ; Shouyan Zhong ; Kaishun Hu</creatorcontrib><description>We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity in one period is integral multiple of the capacity of a container and reveal the special structure of the optimal solution. We transfer the lot sizing problem into a shortest path problem and propose a network algorithm to deal with it. The T-period problem is solved in O(T 4 ) effort by the network algorithm.</description><identifier>ISSN: 2157-3611</identifier><identifier>ISBN: 1457707403</identifier><identifier>ISBN: 9781457707407</identifier><identifier>EISSN: 2157-362X</identifier><identifier>EISBN: 9781457707384</identifier><identifier>EISBN: 1457707381</identifier><identifier>EISBN: 145770739X</identifier><identifier>EISBN: 9781457707391</identifier><identifier>DOI: 10.1109/IEEM.2011.6117978</identifier><language>eng</language><publisher>IEEE</publisher><subject>capacity constraint ; Containers ; Europe ; Heuristic algorithms ; Lot sizing ; Mathematical programming ; network algorithm ; Shortest path problem</subject><ispartof>2011 IEEE International Conference on Industrial Engineering and Engineering Management, 2011, p.555-559</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/6117978$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6117978$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhicong Zhang</creatorcontrib><creatorcontrib>Weiping Wang</creatorcontrib><creatorcontrib>Shouyan Zhong</creatorcontrib><creatorcontrib>Kaishun Hu</creatorcontrib><title>A solution to the capacitated lot sizing problem</title><title>2011 IEEE International Conference on Industrial Engineering and Engineering Management</title><addtitle>IEEM</addtitle><description>We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity in one period is integral multiple of the capacity of a container and reveal the special structure of the optimal solution. We transfer the lot sizing problem into a shortest path problem and propose a network algorithm to deal with it. The T-period problem is solved in O(T 4 ) effort by the network algorithm.</description><subject>capacity constraint</subject><subject>Containers</subject><subject>Europe</subject><subject>Heuristic algorithms</subject><subject>Lot sizing</subject><subject>Mathematical programming</subject><subject>network algorithm</subject><subject>Shortest path problem</subject><issn>2157-3611</issn><issn>2157-362X</issn><isbn>1457707403</isbn><isbn>9781457707407</isbn><isbn>9781457707384</isbn><isbn>1457707381</isbn><isbn>145770739X</isbn><isbn>9781457707391</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9j81Kw0AURsc_sNY8gLiZF0i8N_O_LCVqoeJGwV0ZJ3d0JG1CMi706RUMbs63OPDBYewKoUIEd7NpmoeqBsRKIxpn7BErfolSGQNGWHnMFjUqUwpdv5ywi1lIEKf_AvGcFdP0AQBYW107vWCw4lPffebUH3jueX4nHvzgQ8o-U8u7PvMpfafDGx_G_rWj_SU7i76bqJh3yZ5vm6f1fbl9vNusV9syoVG5jNJARKe09ro1ylmhdBssGRQgCGK00beoRQskvCaSHkOUIUgjgkPpxJJd__0mItoNY9r78Ws3x4sfcO1IMQ</recordid><startdate>201112</startdate><enddate>201112</enddate><creator>Zhicong Zhang</creator><creator>Weiping Wang</creator><creator>Shouyan Zhong</creator><creator>Kaishun Hu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201112</creationdate><title>A solution to the capacitated lot sizing problem</title><author>Zhicong Zhang ; Weiping Wang ; Shouyan Zhong ; Kaishun Hu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-f470f19566a6d7598356dc8e71303e0ff8fad163d0e3a6ee4a1cf4cc473c91493</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>capacity constraint</topic><topic>Containers</topic><topic>Europe</topic><topic>Heuristic algorithms</topic><topic>Lot sizing</topic><topic>Mathematical programming</topic><topic>network algorithm</topic><topic>Shortest path problem</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhicong Zhang</creatorcontrib><creatorcontrib>Weiping Wang</creatorcontrib><creatorcontrib>Shouyan Zhong</creatorcontrib><creatorcontrib>Kaishun Hu</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>Zhicong Zhang</au><au>Weiping Wang</au><au>Shouyan Zhong</au><au>Kaishun Hu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A solution to the capacitated lot sizing problem</atitle><btitle>2011 IEEE International Conference on Industrial Engineering and Engineering Management</btitle><stitle>IEEM</stitle><date>2011-12</date><risdate>2011</risdate><spage>555</spage><epage>559</epage><pages>555-559</pages><issn>2157-3611</issn><eissn>2157-362X</eissn><isbn>1457707403</isbn><isbn>9781457707407</isbn><eisbn>9781457707384</eisbn><eisbn>1457707381</eisbn><eisbn>145770739X</eisbn><eisbn>9781457707391</eisbn><abstract>We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity in one period is integral multiple of the capacity of a container and reveal the special structure of the optimal solution. We transfer the lot sizing problem into a shortest path problem and propose a network algorithm to deal with it. The T-period problem is solved in O(T 4 ) effort by the network algorithm.</abstract><pub>IEEE</pub><doi>10.1109/IEEM.2011.6117978</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2157-3611
ispartof 2011 IEEE International Conference on Industrial Engineering and Engineering Management, 2011, p.555-559
issn 2157-3611
2157-362X
language eng
recordid cdi_ieee_primary_6117978
source IEEE Electronic Library (IEL) Conference Proceedings
subjects capacity constraint
Containers
Europe
Heuristic algorithms
Lot sizing
Mathematical programming
network algorithm
Shortest path problem
title A solution to the capacitated lot sizing problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T06%3A06%3A32IST&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=A%20solution%20to%20the%20capacitated%20lot%20sizing%20problem&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Industrial%20Engineering%20and%20Engineering%20Management&rft.au=Zhicong%20Zhang&rft.date=2011-12&rft.spage=555&rft.epage=559&rft.pages=555-559&rft.issn=2157-3611&rft.eissn=2157-362X&rft.isbn=1457707403&rft.isbn_list=9781457707407&rft_id=info:doi/10.1109/IEEM.2011.6117978&rft_dat=%3Cieee_6IE%3E6117978%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781457707384&rft.eisbn_list=1457707381&rft.eisbn_list=145770739X&rft.eisbn_list=9781457707391&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6117978&rfr_iscdi=true