File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Divergent production scheduling with multi-process routes and common inventory
  • Basic View
  • Metadata View
  • XML View
TitleDivergent production scheduling with multi-process routes and common inventory
 
AuthorsLuo, H1
Huang, GQ1
Shi, Y3
Qu, T1 2
 
KeywordsComputational results
Finished products
Fixed numbers
Inventory capacity
Manufacturing companies
 
Issue Date2012
 
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
 
CitationInternational Journal of Production Research, 2012, v. 50 n. 20, p. 5762-5782 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2011.627387
 
AbstractThis research considers a scheduling problem in a divergent production system (DPS) where a single input item is converted into multiple output items. Therefore, the number of finished products is much larger than the number of input items. This paper addresses two important challenges in a real-life DPS problem faced by an aluminium manufacturing company. One challenge is that one product can be produced following different process routes that may have slightly different capabilities and capacities. The other is that the total inventory capacity is very limited in the company in the sense that a fixed number of inventory spaces are commonly shared by raw materials, WIP (work-in-process) items and finished products. This paper proposes a two-step approach to solving this problem. In the first step, an integer programming (IP) model is developed to plan the type and quantity of operations. In the second step, a particle swarm optimisation (PSO) is proposed to schedule the operations determined in the first step. The computational results based on actual production data have shown that the proposed two-step solution is appropriate and advantageous for the DPS scheduling problem in the company. © 2012 Copyright Taylor and Francis Group, LLC.
 
ISSN0020-7543
2013 Impact Factor: 1.323
 
DOIhttp://dx.doi.org/10.1080/00207543.2011.627387
 
ISI Accession Number IDWOS:000310595700008
 
DC FieldValue
dc.contributor.authorLuo, H
 
dc.contributor.authorHuang, GQ
 
dc.contributor.authorShi, Y
 
dc.contributor.authorQu, T
 
dc.date.accessioned2012-08-16T05:51:55Z
 
dc.date.available2012-08-16T05:51:55Z
 
dc.date.issued2012
 
dc.description.abstractThis research considers a scheduling problem in a divergent production system (DPS) where a single input item is converted into multiple output items. Therefore, the number of finished products is much larger than the number of input items. This paper addresses two important challenges in a real-life DPS problem faced by an aluminium manufacturing company. One challenge is that one product can be produced following different process routes that may have slightly different capabilities and capacities. The other is that the total inventory capacity is very limited in the company in the sense that a fixed number of inventory spaces are commonly shared by raw materials, WIP (work-in-process) items and finished products. This paper proposes a two-step approach to solving this problem. In the first step, an integer programming (IP) model is developed to plan the type and quantity of operations. In the second step, a particle swarm optimisation (PSO) is proposed to schedule the operations determined in the first step. The computational results based on actual production data have shown that the proposed two-step solution is appropriate and advantageous for the DPS scheduling problem in the company. © 2012 Copyright Taylor and Francis Group, LLC.
 
dc.description.naturelink_to_subscribed_fulltext
 
dc.identifier.citationInternational Journal of Production Research, 2012, v. 50 n. 20, p. 5762-5782 [How to Cite?]
DOI: http://dx.doi.org/10.1080/00207543.2011.627387
 
dc.identifier.doihttp://dx.doi.org/10.1080/00207543.2011.627387
 
dc.identifier.epage5782
 
dc.identifier.hkuros203272
 
dc.identifier.isiWOS:000310595700008
 
dc.identifier.issn0020-7543
2013 Impact Factor: 1.323
 
dc.identifier.issue20
 
dc.identifier.scopuseid_2-s2.0-84867393636
 
dc.identifier.spage5762
 
dc.identifier.urihttp://hdl.handle.net/10722/159545
 
dc.identifier.volume50
 
dc.languageeng
 
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
 
dc.publisher.placeUnited Kingdom
 
dc.relation.ispartofInternational Journal of Production Research
 
dc.subjectComputational results
 
dc.subjectFinished products
 
dc.subjectFixed numbers
 
dc.subjectInventory capacity
 
dc.subjectManufacturing companies
 
dc.titleDivergent production scheduling with multi-process routes and common inventory
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Luo, H</contributor.author>
<contributor.author>Huang, GQ</contributor.author>
<contributor.author>Shi, Y</contributor.author>
<contributor.author>Qu, T</contributor.author>
<date.accessioned>2012-08-16T05:51:55Z</date.accessioned>
<date.available>2012-08-16T05:51:55Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>International Journal of Production Research, 2012, v. 50 n. 20, p. 5762-5782</identifier.citation>
<identifier.issn>0020-7543</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/159545</identifier.uri>
<description.abstract>This research considers a scheduling problem in a divergent production system (DPS) where a single input item is converted into multiple output items. Therefore, the number of finished products is much larger than the number of input items. This paper addresses two important challenges in a real-life DPS problem faced by an aluminium manufacturing company. One challenge is that one product can be produced following different process routes that may have slightly different capabilities and capacities. The other is that the total inventory capacity is very limited in the company in the sense that a fixed number of inventory spaces are commonly shared by raw materials, WIP (work-in-process) items and finished products. This paper proposes a two-step approach to solving this problem. In the first step, an integer programming (IP) model is developed to plan the type and quantity of operations. In the second step, a particle swarm optimisation (PSO) is proposed to schedule the operations determined in the first step. The computational results based on actual production data have shown that the proposed two-step solution is appropriate and advantageous for the DPS scheduling problem in the company. &#169; 2012 Copyright Taylor and Francis Group, LLC.</description.abstract>
<language>eng</language>
<publisher>Taylor &amp; Francis Ltd. The Journal&apos;s web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp</publisher>
<relation.ispartof>International Journal of Production Research</relation.ispartof>
<subject>Computational results</subject>
<subject>Finished products</subject>
<subject>Fixed numbers</subject>
<subject>Inventory capacity</subject>
<subject>Manufacturing companies</subject>
<title>Divergent production scheduling with multi-process routes and common inventory</title>
<type>Article</type>
<description.nature>link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1080/00207543.2011.627387</identifier.doi>
<identifier.scopus>eid_2-s2.0-84867393636</identifier.scopus>
<identifier.hkuros>203272</identifier.hkuros>
<identifier.volume>50</identifier.volume>
<identifier.issue>20</identifier.issue>
<identifier.spage>5762</identifier.spage>
<identifier.epage>5782</identifier.epage>
<identifier.isi>WOS:000310595700008</identifier.isi>
<publisher.place>United Kingdom</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Guangdong University of Technology
  3. South China University of Technology