ACM Home Page
Please provide us with feedback. Feedback
Product flow analysis in distribution networks with a fixed time horizon
Full text PdfPdf (252 KB)
Source ACSC; Vol. 312 archive
Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 table of contents
Wollongong, Australia
SESSION: Contributed papers: algorithms table of contents
Pages 73-81  
Year of Publication: 2008
ISBN ~ ISSN:1445-1336 , 978-1-920682-55-2
Authors
M. T. Wynn  Queensland University of Technology, Australia
C. J. Fidge  Queensland University of Technology, Australia
A. H. M. ter Hofstede  Queensland University of Technology, Australia
M. Dumas  Queensland University of Technology, Australia
Sponsors
: CORE - Computing Research and Education
: Macquarie University-Sydney
: University of Wollongong, Australia
Australian Comp Soc : Australian Computer Society
: University of Auckland, New Zealand
Publisher
Australian Computer Society, Inc.  Darlinghurst, Australia, Australia
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

The movement of items through a product distribution network is a complex dynamic process which depends not only on the network's static topology but also on a knowledge of how each node stores, handles and forwards items. Analysing this time-dependent behaviour would normally require a simulation algorithm which maintains a globally-synchronised system state. For a certain class of problem, however, where the simulation is required to stop in a consistent state but not necessarily maintain consistency at all times, we show that an algorithm that makes localised decisions only is sufficient. As a motivating example we consider the practical problem of product recalls, in which our primary concern is the state of the distribution network at a specific time after a batch of suspect items was released, but we do not necessarily care about intermediate states leading up to the final one.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berman, K. A. & Paul, J. L. (2005), Algorithms: Sequential, Parallel and Distributed, Thomson. ISBN 0-534-42057-5.
 
2
Daskin, M. & Owen, S. (2003), Location models in transportation, in R. Hall, ed., 'Handbook of Transportation Science', Kluwer, pp. 321--370.
 
3
 
4
Hajnal, E., Kollar, G. & Lang-Lazi, M. (2004), 'IT support and statistics in traceability and product recall at food logistics providers', Periodica Polytechnica Chemical Engineering 48(1), 21--29.
 
5
Industry Search (2006), 'Forty lines of Top Taste products are on recall nationwide', http://www.industrysearch.com.au/news/printarticle.asp?id=20402. Accessed June 2006.
 
6
Lin, H.-E., Zito, R. & Taylor, M. (2005), 'A review of travel-time prediction in transport and logistics', Proceedings of the Eastern Asia Society for Transportation Studies 5, 1433--1448.
 
7
McComb, T. & Wildman, L. (2005), SIFA: A tool for evaluation of high-grade security devices., in C. Boyd & J. M. G. Nieto, eds, 'Information Security and Privacy, 10th Australasian Conference (ACISP 2005)', Vol. 3574 of Lecture Notes in Computer Science, Springer, pp. 230--241.
 
8
Pulse Logistics Systems (2005), 'Product recall software added', http://www.pulse.com.au/news_detail.asp?NewsID=55&Source=News. Accessed January 2005.
 
9
 
10
Safe, M. (2005), 'Mars attack', The Weekend Australian Magazine, 10--11 September pp. 18--23.
 
11
Sarmiento, A.-M. & Nagi, R. (1999), 'A review of integrated analysis of production-distribution systems', IIE Transactions 31(11), 1061--1074.
 
12
Seradex (2005), 'Product recall---Seradex ERP module', http://www.seradex.com/Product_Recall_Module.shtml. Accessed January 2005.

Collaborative Colleagues:
M. T. Wynn: colleagues
C. J. Fidge: colleagues
A. H. M. ter Hofstede: colleagues
M. Dumas: colleagues