Synchronisation issue of supply chains: a six-sigma constrained random search approach Online publication date: Mon, 13-Nov-2006
by Felix Tung Sun Chan, Rahul Swarnkar, Manoj Kumar Tiwari
International Journal of Services Technology and Management (IJSTM), Vol. 7, No. 5/6, 2006
Abstract: Supply Chains (SC) can be viewed as a network of facilities or companies in which an order will flow through various business processes and ultimately reach the customer on time. In such networks, end-to-end material and information flows are optimally and collaboratively managed to create value for the customer and other stakeholders. The delivery performance of such networks can be optimised by pushing the workflow through the system in a way that there is a high probability of final products reaching the end user in specified delivery window. This paper addresses the problem of synchronisation of the business processes in a supply chain with the objective of minimising the total cost involved. A mathematical formulation of the problem is developed to relate the costs involved and the tolerances gained. A Genetic Algorithm (GA)-based heuristic is proposed to achieve the near optimal solution of the problem.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Technology and Management (IJSTM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook