Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/13521
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Li, S | - |
dc.creator | Li, M | - |
dc.creator | Yan, H | - |
dc.date.accessioned | 2015-10-13T08:27:55Z | - |
dc.date.available | 2015-10-13T08:27:55Z | - |
dc.identifier.issn | 1024-123X | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/13521 | - |
dc.language.iso | en | en_US |
dc.publisher | Hindawi Publishing Corporation | en_US |
dc.rights | Copyright © 2015 Shanlin Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_US |
dc.rights | The following article: Li, S., Li, M., & Yan, H. (2015). Supply chain batching problem with identical orders and lifespan. Mathematical Problems in Engineering, 2015, is available at https//doi.org/10.1155/2015/716248 | en_US |
dc.title | Supply chain batching problem with identical orders and lifespan | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 2015 | en_US |
dc.identifier.doi | 10.1155/2015/716248 | en_US |
dcterms.abstract | In the real world, there are a large number of supply chains that involve the short lifespan products. In this paper, we consider an integrated production and distribution batch scheduling problem on a single machine for the orders with a short lifespan, because it may be cheaper or faster to process and distribute orders in a batch than to process and distribute them individually. Assume that the orders have the identical processing time and come from the same location, and the batch setup time is a constant. The problem is to choose the number of batches and batch sizes to minimize the total delivery time without violating the order lifespan. We first give a backward dynamic programming algorithm, but it is not an actually polynomial-time algorithm. Then we propose a constant time partial dynamic programming algorithm by doing further research into the recursion formula in the algorithm. Further, using the difference characteristics of the optimal value function, a specific calculating formula to solve the problem with the setup time being integer times of the processing time is obtained. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Mathematical problems in engineering, 2015, v. 2015, 716248 | - |
dcterms.isPartOf | Mathematical problems in engineering | - |
dcterms.issued | 2015 | - |
dc.identifier.scopus | 2-s2.0-84929649712 | - |
dc.identifier.eissn | 1563-5147 | en_US |
dc.identifier.rosgroupid | 2015005171 | - |
dc.description.ros | 2015-2016 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.validate | bcsm | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Li_Supply_Chain_Batching.pdf | 1.96 MB | Adobe PDF | View/Open |
Page views
99
Last Week
1
1
Last month
Citations as of Apr 21, 2024
Downloads
84
Citations as of Apr 21, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.