Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Esther Álvarez
Fernando Díaz
Miguel A. Larrinaga
Universidad de Deusto
1. La logística en su lugar
1
Este ratio recordemos que es el resultado de la diferencia del total periodo medio de pago con
el total de días de inventario más periodo medio de cobro, de manera que un saldo negativo, indica
que los clientes me financian, es decir, cobro antes de pagar.
2
En el estudio Accenture Research and Insights into Supply Chain Planning Mastery
(Accenture, 2009) entre 240 empresas, las consideradas “master” tenían un ratio de rotación de
inventarios más frecuente de 30 mientras que el resto tan sólo de 5.
PANORAMA DE LA GESTIÓN DE LA CADENA DE SUMINISTRO: RETOS, COLABORACIÓN ... 533
1.3. La sostenibilidad
1.4. La vulnerabilidad
que buscarlo y cuidarlo. Este talento puede ser innato, pero normalmen-
te es adquirido y puede durar durante mucho tiempo. Las tensiones
demográficas de envejecimiento de la población van a afectar no sólo a
cuestiones tales cómo qué tipo de productos se van a diseñar, cómo se
van a producir sino sobre todo también de dónde vamos a captar ese
talento. Si la pirámide demográfica se invierte, ¿tendremos suficiente
talento en las personas jóvenes? Las discusiones actuales sobre la edad
de jubilación, el impacto del nuevo Sistema Europeo de Educación
Superior (espacio Bolonia) complican aún más este análisis.
3
Un buen ejemplo puede leerse en Cederlund et al. (2007).
538 ESTHER ÁLVAREZ, FERNANDO DÍAZ Y MIGUEL A. LARRINAGA
Figura 4
El modelo CPFR
Fuente: www.vics.org
4. El proyecto Prorreco
Empresa
6. Conclusion
4
Obviamente, la computación en la nube también ofrece algunas dudas: seguridad en la gestión,
diferente facilidad de acceso a las tecnologías por parte de los diferentes miembros de la cadena, etc.
546 ESTHER ÁLVAREZ, FERNANDO DÍAZ Y MIGUEL A. LARRINAGA
Bibliografia
ACCENTURE (2008): The High Performance Supply Chain Study. The Sustainable
Supply Chain Study, publicado en www.accenture.com
ACCENTURE (2009): Accenture Research and Insights into Supply Chain Planning
Mastery, publicado en www.accenture.com
ANDERSON, CHRIS (2006): The long tail. Hyperion, pp. 256.
AMIRTHAGADESWARAN, K. S. AND V.P. ARUNACHALAM (2007): “Enhancement of
Performance of Genetic Algorithm for Job Shop Scheduling Problems through
Inversion Operator”. International Journal of Advanced Manufacturing
Technology, nº 32, pp. 780-786.
AZEVEDO, A.L.; C. TOSCANO AND J.P. SOUSA (2005): “Cooperative planning in dyna-
mic supply chains”. International Journal of Computer Integrated
Manufacturing, vol. 18, nº 5, pp. 350-356.
BAKER, K.R. (1974): Introduction to Sequencing and Scheduling. Wiley, New York.
CEDERLUND, JEROLD P.; RAJIV, KOHLI; SUSAN A. SHERER, AND YULIANG YAO (2007):
“How Motorola put CPFR into Action”. Supply Chain Management Review.
October, pp. 30 – 37.
CHAN, F.T.S.; T.C. WONG & L.Y. CHAN (2005): “A Genetic Algorithm-Based
Approach to Machine Assignment Problem”. International Journal of
Production Research, vol. 43, no. 12, pp. 2451-2472.
5
En el estudio antes mencionado “Accenture Research and Insights into Supply Chain Planning
Mastery”, el nivel de adherencia de lo previsto a lo real en planes de producción era del 98% en las
empresas sobresalientes frente a un 90% para el resto.
PANORAMA DE LA GESTIÓN DE LA CADENA DE SUMINISTRO: RETOS, COLABORACIÓN ... 547
CHAN, F.T.S.; T.C. WONG & L.Y. CHAN (2006): “Flexible Job-Shop Scheduling
Problem under Resource Constraints”. International Journal of Production
Research vol. 44, no. 11, pp. 2071-2089.
CHANG, F.C.R. (1997): “Heuristics for Dynamic Job Shop Scheduling with Real-
Time Updates Queuing Time Estimates”. International Journal of Production
Research, vol. 35, nº3, pp. 651-665.
CHEN, K.J. & P. JI (2007): “A Genetic Algorithm for Dynamic Advanced Planning
and Scheduling (DAPS) with a Frozen Interval”. Expert Systems with
Applications, vol. 33, pp. 1004-1010.
CHRISTOPHER, M. y BARBARA GAUDENZI (2009): “Exploiting Knowledge across
Networks through reputation management”, Industrial Marketing Management.
Vol. 38, nº 2, pp. 191-197.
CHRISTOPHER, M. (1996): “From brand value to customer value”, Journal of
Marketing Practice. Applied Marketing Science, Vol. 2, nº 1, pp. 55-66.
CHRISTOPHER, M. (2010): “Enhancing Supply Chain Agility Through Complexity
Reduction”, papel presentado en Supply Chain & Logistics Summit, Polonia.
CHRISTOPHER, M. (2011): Logistics and Supply Chain Management, Prentice-Hall,
4rd edition.
COTTRILL, KEN (2010): “Are you prepare for the supply chain talent crisis?”. MIT
CTL White Paper.
DEWAN, P. AND S. JOSHI (2002): “Auction-based distributed scheduling in a dynamic
job shop environment”. International Journal of Production Research. Vol. 40,
nº 5, pp. 1173-1191.
DONOVAN, R. M. (2002): Supply chain management: Cracking the bullwhip effect.
Accedido en http://www.rmdonovan.com.
DORIGO, M.; V. MANIEZZO & A. COLORNI (1996): “The ant system: Optimization by
a colony of cooperating agents”. IEEE Transactions on Systems, Man and
Cybernetics, Part B, Vol. 26, No. 1, pp. 29-41.
ELLIS, SIMON (2010): European Supply Chain Best Practices, ponencia presentada
en la conferencia NACDS Supply Chain Conference.
FEO, T.A. AND M.G.C. RESENDE (1989): “A Probabilistic Heuristic for a
Computationally Difficult Set Covering Problem”. Operations Research Letters,
vol. 8, pp. 67-71.
FRIEDMANN, THOMAS (2005): The World Is Flat: A Brief History of the Twenty-first
Century. Ed Farrar, Straus and Giroux; 1st edition.
GLOVER, F. (1986): “Future Paths for Integer Programming and Links to Artificial
Intelligence”. Computers and Operations Research, nº 5, pp. 533-549.
HOLLAND, J.H. (1973): “Genetic Algorithms and the Optimal Allocation of Trials”.
SIAM Journal of Computing, nº 2, pp. 88-105.
HUANG, G. C.; J.S.K. LAU; K. L. MAK AND L. LIANG (2005): “Distributed supply-
chain project rescheduling: part I- Impacts of information-sharing strategies”.
International Journal of Production Research, vol. 43, nº 24, pp. 5107-5129.
548 ESTHER ÁLVAREZ, FERNANDO DÍAZ Y MIGUEL A. LARRINAGA
JAYAMOHAN, M.A. AND C. RAJENDRAN (2000): “New Dispatching Rules for Job
Shop Scheduling; A Step Forward”. International Journal of Production
Research, vol. 38, nº 3, pp. 563-586.
JODLBAUER, H. (2005): “Range work in progress and utilization”. International
Journal of Production Research, vol. 43, nº 22, pp. 4771-4786.
KANYALKAR, P. AND G.K. ADIL (2005): “An integrated aggregate and detailed plan-
ning in a multi-site production environment using linear programming”,
International Journal of Production Research, vol. 43, nº 20, pp. 4431-4454.
KENNEDY, J. AND R.C. EBERHART (1995): “Particle swarm optimization”.
Proceedings of the IEEE International Conference on Neural Networks-
ICNN’95, vol. 4, pp. 1942-1948.
KIRKPATRICK, S.; C.D. GELATT AND M.P. VECCHI (1983): “Optimization by
Simulating Annealing”. Science, nº 220, pp. 671-680.
LENSTRA, J.K.; A.H.G. RINNOOY KAN AND P. BRUCKER (1997): “Complexity of Machine
Scheduling Problem”. Annals of Discrete Mathematics, vol. 1, pp. 343- 362.
LEE, HAU; V. PADMANABHAN and SEUNGJIN WHANG (1997): “Information
Distortion in a Supply Chain: The Bullwhip Effect”. Management Science, Vol.
43, Nº 4, pp. 546–558.
LIN, S. (1965): “Computer Solutions of the Traveling Salesman Problem”. Bell
System Technical Journal, nº. 44, pp. 2245-2269.
MATTFELD, D. C. AND C. BIERWIRTH (2004): “An Efficient Genetic Algorithm for
Job-Shop Scheduling with Tardiness Objectives”. European Journal of
Operational Research, nº 155, pp. 616-630.
MOON, I.; S. LEE AND H. BAE (2008): “Genetic Algorithms for Job-Shop Scheduling
Problems with Alternative Routings”. International Journal of Production
Research, vol. 46, nº. 10, 2695-2705.
MOSCATO, P. (1989): “On Evolution, Search, Optimization Genetic Algorithms and
Martial Arts: Towards Memetic Algorithms”. Technical Report, Caltech Concurrent
Computation Program, Report 826. California Institute of Technology.
PARK, Y.B (2005): “An integrated approach for production and distribution planning
in supply chain management”, International Journal of Production Research,
vol. 43, nº 6, pp.1205-1224.
PEZZELLA, F.; G. MORGANTI AND G. CIASCHETTI (2008): “A Genetic Algorithm for
the Flexible Job-Shop Scheduling Problem”. Computers & Operations
Research, nº 35, pp. 3202-3212.
PROVEDO, PETER (2009): Future Supply Chain 2016, ponencia presentada en el Foro
Pilot.
REEJA, M. AND C. RAJENDRAN (2000): Dispatching Rules for Scheduling in Assembly
Job Shops - Part 1. International Journal of Production Research, vol. 38, nº 9,
pp. 2051-2066.
SENTHILKUMAR, P. AND P. SHAHABUDEEN (2006): “GA Based Heuristic for the Open
Job Shop Scheduling Problem”. International Journal of Advanced
Manufacturing Technology, nº 30, pp. 297-301.
PANORAMA DE LA GESTIÓN DE LA CADENA DE SUMINISTRO: RETOS, COLABORACIÓN ... 549
SHAFAEI, R. AND P. BRUNN (2000): “Workshop Scheduling Using Practical Data. Part
1, 2, 3: A Framework to Integrate Job Releasing, Routing and Scheduling
Functions to Create a Robust Predictive Schedule”. International Journal of
Production Research, vol. 38, nº 1, pp. 85-99.
SHEN, W.; L. WANG AND Q. HAO (2004): “Agent-Based Integration of Manufacturing
Process Planning and Scheduling: A review”. Proceedings of the 14th
Conference on Flexible Automation and Intelligent Manufacturing, pp. 906-914.
SINGH JAIN, A. AND S. MEERAN (1998): A State-of-The-Art Review of Job-Shop
Scheduling Techniques. Department of Applied Physics, Electronic And
Mechanical Engineering University Of Dundee.
SIWAMOGSATHAM,T. AND C. SAYGIN (2004): “Auction-based distributed scheduling
and control scheme for flexible manufacturing systems”. International Journal
of Production Research, vol. 42, n º 3, pp. 547-572.
SUPPLY CHAIN COUNCIL (2011): SCOR 10.0 Overview, descargado de http://www.supply-
chain.org/cs/root/scor_tools_resources/scor_model/scor_model
SURANA, A.; S. KUMARA; M. GREAVES AND U. N. RAGHADAVAN (2005): “Supply-
chain networks: a complex adaptive systems perspective”. International Journal
of Production Research, vol. 43, nº 20, pp. 4235-4265.
VICS (2004): CPFR. An overview. descargado de http://www.vics.org/committe-
es/cpfr/cpfr_white_papers/
VISWANATHAN, S.; H. WIDIARTA AND R. PIPLANI (2007): “Value of information
exchange and synchronization in a multi-tier supply chain”. International
Journal of Production Research, vol. 45, nº 21, pp. 5057-5074.
WATANABE, M.; K. IDA AND M. GEN (2005): “A Genetic Algorithm with Modified
Crossover Operator and Search Area Adaptation for the Job-Shop Scheduling
Problem”. Computers and Industrial Engineering, vol. 48, pp. 743-752.
WILLCOX, LESLIE; WILL, VENTERS AND EDGAR A. WHITLEY (2011): “Meeting the
challenges of cloud computing”. Accenture Outlook, May, nº 1.
XU, X. AND C. LI (2007): “Research on Immune Genetic Algorithm for Solving the
Job-Shop Scheduling Problem”. International Journal of Advanced
Manufacturing Technology, nº 34, pp. 783-789.
YOSHITOMI, Y. (2002): “A Genetic Algorithm Approach to Solving Stochastic Job-
Shop Scheduling Problems”. International Transactions in Operational
Research, nº 9, pp. 479-495.
ZHIMING,W.; AND Z. CHUNWEI (2000): “Genetic Algorithm Approach to Job-Shop
Scheduling and Its Use in Real-Time Cases”. International Journal of Computer
Integrated Manufacturing, vol. 13, no. 5, 422-429.
RESUMEN
La crisis global nos permite encontrar la excusa perfecta para revisar la relación de una empre-
sa con sus proveedores y clientes, es decir, para centrarnos en lo que se conoce como cadena de
suministros. Tras una descripción de los principales retos que esta gestión supone, el artículo se cen-
tra en la colaboración entre agentes ofreciendo una gestión proactiva de las excepciones en dicha
550 ESTHER ÁLVAREZ, FERNANDO DÍAZ Y MIGUEL A. LARRINAGA
cadena, teniendo en mente el efecto bullwhip. Así, cada planta en un entorno productivo deja de ser
autónoma en su planificación productiva con mejora en la visibilidad de la información comparti-
da, con transmisión más rápida de cualquier contratiempo o excepción. El artículo termina con una
breve mención a la computación en la nube en este contexto.
Palabras Clave: Cadena de Suministro. Colaboración. Gestión de Eventos. Algoritmos.
Computación en la Nube.
SUMMARY
Global crisis is a good excuse to review the business relationship with suppliers and customers,
that is, a thorough rethink of a company’s supply chain. A supply chain is composed of a set of dif-
ferent agents such as suppliers, manufacturers and distributors. In order to manage a supply chain
in a successful way, it is necessary to reduce some key aspects like lead times and stock levels, since
they contribute to increase the global cost of the supply chain. This research aims at building a pro-
active exceptions management solution that operates in real time by monitoring possible disturban-
ces and processing them on a wide basis, thus considering their impact on the overall supply chain.
In this way, a suitable synchronization of the different production schedules will be achieved, thus
leading to a global competitive advantage over competitors. The selected approach will make use of
distributed control, where decisions are made at each node taking into account the information inter-
changed with other nodes of the supply chain. This means that each plant will be autonomous as
regards production planning and scheduling but at the same time will take advantage of the com-
mon information of the supply chain, so as to allow a dynamic collaboration between the agents.
Some expected benefits of the system are the following: a better information visibility, a fast noti-
fication of disturbances throughout the supply chain, a synchronized production and a collaborative
production scheduling. The article ends with a short comment about the implications of Cloud
Computing within this framework.
Key Words: Supply Chain. Collaboration. Event Management. Algorithm. Cloud Computing.
Reproduced with permission of the copyright owner. Further reproduction prohibited without
permission.