Download full ebook of Advances In Production Management Systems Artificial Intelligence For Sustainable And Resilient Production Systems Ifip Wg 5 7 International Conference Apms 2021 Nantes France September 5 9 2021 Proce online pdf all chapter docx

Advances in Production Management
Systems Artificial Intelligence for

Sustainable and Resilient Production
Systems IFIP WG 5 7 International
Conference APMS 2021 Nantes France
September 5 9 2021 Proceedings Part IV
1st Edition Alexandre Dolgui
Visit to download the full and correct content document:
https://ebookmeta.com/product/advances-in-production-management-systems-artifici
al-intelligence-for-sustainable-and-resilient-production-systems-ifip-wg-5-7-internation
al-conference-apms-2021-nantes-france-september-5-9-2021-proce/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Advances in Production Management Systems Artificial

Intelligence for Sustainable and Resilient Production
Systems IFIP WG 5 7 International and Communication
Technology 631 1st Edition Alexandre Dolgui
https://ebookmeta.com/product/advances-in-production-management-
systems-artificial-intelligence-for-sustainable-and-resilient-
production-systems-ifip-wg-5-7-international-and-communication-
technology-631-1st-edition-alexandre-dol/
Proceedings of 2nd International Conference on

Artificial Intelligence Advances and Applications
ICAIAA 2021 Algorithms for Intelligent Systems Garima
Mathur
https://ebookmeta.com/product/proceedings-of-2nd-international-
conference-on-artificial-intelligence-advances-and-applications-
icaiaa-2021-algorithms-for-intelligent-systems-garima-mathur/
Flexible Query Answering Systems 14th International

Conference FQAS 2021 Bratislava Slovakia September 19
24 2021 Proceedings Lecture Notes in Artificial
Intelligence Troels Andreasen (Editor)
https://ebookmeta.com/product/flexible-query-answering-
systems-14th-international-conference-fqas-2021-bratislava-
slovakia-september-19-24-2021-proceedings-lecture-notes-in-
artificial-intelligence-troels-andreasen-editor/
Progress in Artificial Intelligence 20th EPIA

Conference on Artificial Intelligence EPIA 2021 Virtual
Event September 7 9 2021 Proceedings Lecture Notes in
Computer Science 12981 Goreti Marreiros (Editor)
https://ebookmeta.com/product/progress-in-artificial-
intelligence-20th-epia-conference-on-artificial-intelligence-
epia-2021-virtual-event-september-7-9-2021-proceedings-lecture-
Agriculture Digitalization and Organic Production
Proceedings of the First International Conference ADOP
2021 St Petersburg Russia June 7 9 Innovation Systems
and Technologies 245 Andrey Ronzhin (Editor)
https://ebookmeta.com/product/agriculture-digitalization-and-
organic-production-proceedings-of-the-first-international-
conference-adop-2021-st-petersburg-russia-june-7-9-innovation-
systems-and-technologies-245-andrey-ronzhin-edi/
Document Analysis and Recognition ICDAR 2021 16th

International Conference Lausanne Switzerland September
5 10 2021 Proceedings Part II 1st Edition Josep Lladós
https://ebookmeta.com/product/document-analysis-and-recognition-
icdar-2021-16th-international-conference-lausanne-switzerland-
september-5-10-2021-proceedings-part-ii-1st-edition-josep-llados/
Electronic Government 21st IFIP WG 8 5 International

Conference EGOV 2022 Linköping Sweden September 6 8
2022 Proceedings Marijn Janssen
https://ebookmeta.com/product/electronic-government-21st-ifip-
wg-8-5-international-conference-egov-2022-linkoping-sweden-
september-6-8-2022-proceedings-marijn-janssen/
Computer Vision Systems 13th International Conference

ICVS 2021 Virtual Event September 22 24 2021
Proceedings 1st Edition Markus Vincze
https://ebookmeta.com/product/computer-vision-systems-13th-
international-conference-icvs-2021-virtual-event-
september-22-24-2021-proceedings-1st-edition-markus-vincze/
Machine Learning and Knowledge Extraction 5th IFIP TC 5

TC 12 WG 8 4 WG 8 9 WG 12 9 International Cross Domain
Conference CD MAKE 2021 Virtual Lecture Notes in
Computer Science 12844 Andreas Holzinger (Editor)
https://ebookmeta.com/product/machine-learning-and-knowledge-
extraction-5th-ifip-
tc-5-tc-12-wg-8-4-wg-8-9-wg-12-9-international-cross-domain-
IFIP AICT 633
Alexandre Dolgui
Alain Bernard
David Lemoine
Gregor von Cieminski
David Romero (Eds.)
Advances in Production
Management Systems
Artificial Intelligence for Sustainable
and Resilient Production Systems
IFIP WG 5.7 International Conference, APMS 2021

Nantes, France, September 5–9, 2021
g Part IV
Proceedings,
123
IFIP Advances in Information
and Communication Technology 633
Editor-in-Chief
Kai Rannenberg, Goethe University Frankfurt, Germany
Editorial Board Members

TC 1 – Foundations of Computer Science
Luís Soares Barbosa , University of Minho, Braga, Portugal
TC 2 – Software: Theory and Practice
Michael Goedicke, University of Duisburg-Essen, Germany
TC 3 – Education
Arthur Tatnall , Victoria University, Melbourne, Australia
TC 5 – Information Technology Applications
Erich J. Neuhold, University of Vienna, Austria
TC 6 – Communication Systems
Burkhard Stiller, University of Zurich, Zürich, Switzerland
TC 7 – System Modeling and Optimization
Fredi Tröltzsch, TU Berlin, Germany
TC 8 – Information Systems
Jan Pries-Heje, Roskilde University, Denmark
TC 9 – ICT and Society
David Kreps , National University of Ireland, Galway, Ireland
TC 10 – Computer Systems Technology
Ricardo Reis , Federal University of Rio Grande do Sul, Porto Alegre, Brazil
TC 11 – Security and Privacy Protection in Information Processing Systems
Steven Furnell , Plymouth University, UK
TC 12 – Artificial Intelligence
Eunika Mercier-Laurent , University of Reims Champagne-Ardenne, Reims, France
TC 13 – Human-Computer Interaction
Marco Winckler , University of Nice Sophia Antipolis, France
TC 14 – Entertainment Computing
Rainer Malaka, University of Bremen, Germany
IFIP – The International Federation for Information Processing
IFIP was founded in 1960 under the auspices of UNESCO, following the first World
Computer Congress held in Paris the previous year. A federation for societies working
in information processing, IFIP’s aim is two-fold: to support information processing in
the countries of its members and to encourage technology transfer to developing na-
tions. As its mission statement clearly states:
IFIP is the global non-profit federation of societies of ICT professionals that aims
at achieving a worldwide professional and socially responsible development and
application of information and communication technologies.
IFIP is a non-profit-making organization, run almost solely by 2500 volunteers. It

operates through a number of technical committees and working groups, which organize
events and publications. IFIP’s events range from large international open conferences
to working conferences and local seminars.
The flagship event is the IFIP World Computer Congress, at which both invited and
contributed papers are presented. Contributed papers are rigorously refereed and the
rejection rate is high.
As with the Congress, participation in the open conferences is open to all and papers
may be invited or submitted. Again, submitted papers are stringently refereed.
The working conferences are structured differently. They are usually run by a work-
ing group and attendance is generally smaller and occasionally by invitation only. Their
purpose is to create an atmosphere conducive to innovation and development. Referee-
ing is also rigorous and papers are subjected to extensive group discussion.
Publications arising from IFIP events vary. The papers presented at the IFIP World
Computer Congress and at open conferences are published as conference proceedings,
while the results of the working conferences are often published as collections of se-
lected and edited papers.
IFIP distinguishes three types of institutional membership: Country Representative
Members, Members at Large, and Associate Members. The type of organization that
can apply for membership is a wide variety and includes national or international so-
cieties of individual computer scientists/ICT professionals, associations or federations
of such societies, government institutions/government related organizations, national or
international research institutes or consortia, universities, academies of sciences, com-
panies, national or international associations or federations of companies.
More information about this series at http://www.springer.com/series/6102

Alexandre Dolgui Alain Bernard
• •
David Lemoine Gregor von Cieminski

• •
David Romero (Eds.)
Advances in Production
Management Systems
Artificial Intelligence for Sustainable
and Resilient Production Systems
IFIP WG 5.7 International Conference, APMS 2021
Nantes, France, September 5–9, 2021
Proceedings, Part IV
123
Editors
Alexandre Dolgui Alain Bernard
IMT Atlantique Centrale Nantes
Nantes, France Nantes, France
David Lemoine Gregor von Cieminski
IMT Atlantique ZF Friedrichshafen AG
Nantes, France Friedrichshafen, Germany
David Romero
Tecnológico de Monterrey
Mexico City, Mexico
ISSN 1868-4238 ISSN 1868-422X (electronic)

IFIP Advances in Information and Communication Technology
ISBN 978-3-030-85909-1 ISBN 978-3-030-85910-7 (eBook)
https://doi.org/10.1007/978-3-030-85910-7
© IFIP International Federation for Information Processing 2021

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
The scientific and industrial relevance of the development of sustainable and resilient
production systems lies in ensuring future-proof manufacturing and service systems,
including their supply chains and logistics networks. “Sustainability” and “Resilience”
are essential requirements for competitive manufacturing and service provisioning now
and in the future. Industry 4.0 technologies, such as artificial intelligence; decision aid
models; additive and hybrid manufacturing; augmented, virtual, and mixed reality;
industrial, collaborative, mobile, and software robots; advanced simulations and digital
twins; and smart sensors and intelligent industrial networks, are key enablers for
building new digital and smart capabilities in emerging cyber-physical production
systems in support of more efficient and effective operations planning and control.
These allow manufacturers and service providers to explore more sustainable and
resilient business and operating models. By making innovative use of the aforemen-
tioned technologies and their enabled capabilities, they can pursue the triple bottom
line of economic, environmental, and social sustainability. Furthermore, industrial
companies will be able to withstand and quickly recover from disruptions that pose
threats to their operational continuity. This is in the face of disrupted, complex, tur-
bulent, and uncertain business environments, like the one triggered by the COVID-19
pandemic, or environmental pressures calling for decoupling economic growth from
resource use and emissions.
The International Conference on Advances in Production Management Systems
2021 (APMS 2021) in Nantes, France, brought together leading international experts
on manufacturing, service, supply, and logistics systems from academia, industry, and
government to discuss pressing issues and research opportunities mostly in smart
manufacturing and cyber-physical production systems; service systems design, engi-
neering, and management; digital lean operations management; and resilient supply
chain management in the Industry 4.0 era, with particular focus on artificial
intelligence-enabled solutions.
Under the influence of the COVID-19 pandemic, the event was organised as online
conference sessions. A large international panel of experts (497 from 50 countries)
reviewed all the submissions (with an average of 3.2 reviews per paper) and selected
the best 377 papers (70% of the submitted contributions) to be included in these
international conference proceedings. The topics of interest at APMS 2021 included
artificial intelligence techniques, decision aid, and new and renewed paradigms for
sustainable and resilient production systems at four-wall factory and value chain levels,
comprising their associated models, frameworks, methods, tools, and technologies for
smart and sustainable manufacturing and service systems, as well as resilient digital
supply chains. As usual for the APMS conference, the Program Committee was par-
ticularly attentive to the cutting-edge problems in production management and the
quality of the papers, especially with regard to the applicability of the contributions to
industry and services.
vi Preface
The APMS 2021 conference proceedings are organized into five volumes covering a
large spectre of research concerning the global topic of the conference: “Artificial
Intelligence for Sustainable and Resilient Production Systems”.
The conference was supported by the International Federation of Information
Processing (IFIP), which is celebrating its 60th Anniversary, and was co-organized by
the IFIP Working Group 5.7 on Advances in Production Management Systems, IMT
Atlantique (Campus Nantes) as well as the Centrale Nantes, University of Nantes,
Rennes Business School, and Audecia Business School. It was also supported by three
leading journals in the discipline: Production Planning & Control (PPC), the Interna-
tional Journal of Production Research (IJPR), and the International Journal of Product
Lifecycle Management (IJPLM).
Special attention has been given to the International Journal of Production Research
on the occasion of its 60th Anniversary. Since its foundation in 1961, IJPR has become
one of the flagship journals of our profession. It was the first international journal to
bring together papers on all aspects of production research: product/process engi-
neering, production system design and management, operations management, and
logistics. Many exceptional scientific results have been published in the journal.
We would like to thank all contributing authors for their high-quality work and for
their willingness to share their research findings with the APMS community. We are
also grateful to the members of the IFIP Working Group 5.7, the Program Committee,
and the Scientific Committee, along with the Special Sessions organizers for their
support in the organization of the conference program. Concerning the number of
papers, special thanks must be given to the local colleagues who managed the
reviewing process as well as the preparation of the conference program and proceed-
ings, particularly Hicham Haddou Benderbal and Maria-Isabel Estrepo-Ruiz from IMT
Atlantique.
September 2021 Alexandre Dolgui

Alain Bernard
David Lemoine
Gregor von Cieminski
David Romero
Organization
Conference Chair
Alexandre Dolgui IMT Atlantique, Nantes, France
Conference Co-chair
Gregor von Cieminski ZF Friedrichshafen, Germany
Conference Honorary Co-chairs

Dimitris Kiritsis EPFL, Switzerland
Kathryn E. Stecke University of Texas at Dallas, USA
Program Chair
Alain Bernard Centrale Nantes, France
Program Co-chair
David Romero Tecnológico de Monterrey, Mexico
Program Committee
Alain Bernard Centrale Nantes, France
Kathryn E. Stecke University of Texas at Dallas, USA
International Advisory Committee

Farhad Ameri Texas State University, USA
Ugljesa Marjanovic University of Novi Sad, Serbia
Ilkyeong Moon Seoul National University, South Korea
Bojan Lalic University of Novi Sad, Serbia
Hermann Lödding Hamburg University of Technology, Germany
Organizing Committee Chair

David Lemoine IMT Atlantique, Nantes, France
viii Organization
Organizing Committee Co-chair

Hichem Haddou Benderbal IMT Atlantique, Nantes, France
Doctoral Workshop Chairs

Abdelkrim-Ramzi IMT Atlantique, Nantes, France
Yelles-Chaouche
Seyyed-Ehsan IMT Atlantique, Nantes, France
Hashemi-Petroodi
Award Committee Chairs

Nadjib Brahimi Rennes School of Business, France
Ramzi Hammami Rennes School of Business, France
Organizing Committee
Romain Billot IMT Atlantique, Brest, France
Nadjib Brahimi Rennes School of Business, France
Olivier Cardin University of Nantes, France
Catherine Da Cunha Centrale Nantes, France
Giannakis Mihalis Audencia, Nantes, France
Evgeny Gurevsky University of Nantes, France
Hichem Haddou Benderbal IMT Atlantique, Nantes, France
Ramzi Hammami Rennes School of Business, France
Oncu Hazir Rennes School of Business, France
Seyyed-Ehsan IMT Atlantique, Nantes, France
Hashemi-Petroodi
David Lemoine IMT Atlantique, Nantes, France
Nasser Mebarki University of Nantes, France
Patrick Meyer IMT Atlantique, Brest, France
Merhdad Mohammadi IMT Atlantique, Brest, France
Dominique Morel IMT Atlantique, Nantes, France
Maroua Nouiri University of Nantes, France
Maria-Isabel Restrepo-Ruiz IMT Atlantique, Nantes, France
Naly Rakoto IMT Atlantique, Nantes, France
Ilhem Slama IMT Atlantique, Nantes, France
Simon Thevenin IMT Atlantique, Nantes, France
Abdelkrim-Ramzi IMT Atlantique, Nantes, France
Yelles-Chaouche
Organization ix
Scientific Committee
Erry Yulian Triblas Adesta International Islamic University Malaysia, Malaysia
El-Houssaine Aghezzaf Ghent University, Belgium
Erlend Alfnes Norwegian University of Science and Technology,
Norway
Hamid Allaoui Université d’Artois, France
Thecle Alix IUT Bordeaux Montesquieu, France
Farhad Ameri Texas State University, USA
Bjørn Andersen Norwegian University of Science and Technology,
Norway
Eiji Arai Osaka University, Japan
Jannicke Baalsrud Hauge KTH Royal Institute of Technology, Sweden/BIBA,
Germany
Zied Babai Kedge Business School, France
Natalia Bakhtadze Russian Academy of Sciences, Russia
Pierre Baptiste Polytechnique de Montréal, Canada
Olga Battaïa Kedge Business School, France
Farouk Belkadi Centrale Nantes, France
Lyes Benyoucef Aix-Marseille University, France
Bopaya Bidanda University of Pittsburgh, USA
Frédérique Biennier INSA Lyon, France
Jean-Charles Billaut Université de Tours, France
Umit S. Bititci Heriot-Watt University, UK
Magali Bosch-Mauchand Université de Technologie de Compiègne, France
Xavier Boucher Mines St Etienne, France
Abdelaziz Bouras Qatar University, Qatar
Jim Browne University College Dublin, Ireland
Luis Camarinha-Matos Universidade Nova de Lisboa, Portugal
Olivier Cardin University of Nantes, France
Sergio Cavalieri University of Bergamo, Italy
Stephen Childe Plymouth University, UK
Hyunbo Cho Pohang University of Science and Technology,
South Korea
Chengbin Chu ESIEE Paris, France
Feng Chu Paris-Saclay University, France
Byung Do Chung Yonsei University, South Korea
Catherine Da Cunha Centrale Nantes, France
Yves Dallery CentraleSupélec, France
Xavier Delorme Mines St Etienne, France
Frédéric Demoly Université de Technologie de Belfort-Montbéliard,
France
Mélanie Despeisse Chalmers University of Technology, Sweden
Slavko Dolinšek University of Ljubljana, Slovenia
x Organization
Sang Do Noh Sungkyunkwan University, South Korea

Heidi Carin Dreyer Norwegian University of Science and Technology,
Norway
Eero Eloranta Aalto University, Finland
Soumaya El Kadiri Texelia AG, Switzerland
Christos Emmanouilidis University of Groningen, The Netherlands
Anton Eremeev Siberian Branch of Russian Academy of Sciences,
Russia
Åsa Fasth-Berglund Chalmers University of Technology, Sweden
Rosanna Fornasiero Consiglio Nazionale delle Ricerche, Italy
Xuehao Feng Zhejiang University, China
Yannick Frein INP Grenoble, France
Jan Frick University of Stavanger, Norway
Klaas Gadeyne Flanders Make, Belgium
Paolo Gaiardelli University of Bergamo, Italy
Adriana Giret Boggino Universidad Politécnica de Valencia, Spain
Samuel Gomes Belfort-Montbéliard University of Technology, France
Bernard Grabot INP-Toulouse, ENIT, France
Gerhard Gudergan RWTH Aachen University, Germany
Thomas R. Gulledge Jr. George Mason University, USA
Nikolai Guschinsky National Academy of Sciences, Belarus
Slim Hammadi Centrale Lille, France
Ahmedou Haouba University of Nouakchott Al-Asriya, Mauritania
Soumaya Henchoz Logitech AG, Switzerland
Hironori Hibino Tokyo University of Science, Japan
Hans-Henrik Hvolby Aalborg University, Denmark
Jan Holmström Aalto University, Finland
Dmitry Ivanov Berlin School of Economics and Law, Germany
Harinder Jagdev National University of Ireland at Galway, Ireland
Jayanth Jayaram University of South Carolina, USA
Zhibin Jiang Shanghai Jiao Tong University, China
John Johansen Aalborg University, Denmark
Hong-Bae Jun Hongik University, South Korea
Toshiya Kaihara Kobe University, Japan
Duck Young Kim Pohang University of Science and Technology,
South Korea
Tomasz Koch Wroclaw University of Science and Technology,
Poland
Pisut Koomsap Asian Institute of Technology, Thailand
Vladimir Kotov Belarusian State University, Belarus
Mikhail Kovalyov National Academy of Sciences, Belarus
Gül Kremer Iowa State University, USA
Boonserm Kulvatunyou National Institute of Standards and Technology, USA
Senthilkumaran Indian Institute of Information Technology Design
Kumaraguru and Manufacturing, India
Organization xi
Thomas R. Kurfess Georgia Institute of Technology, USA

Andrew Kusiak University of Iowa, USA
Bojan Lalić University of Novi Sad, Serbia
Samir Lamouri ENSAM Paris, France
Lenka Landryova Technical University of Ostrava, Czech Republic
Alexander Lazarev Russian Academy of Sciences, Moscow, Russia
Jan-Peter Lechner First Global Liaison, Germany
Gyu M. Lee Pusan National University, South Korea
Kangbok Lee Pohang University of Science and Technology,
South Korea
Genrikh Levin National Academy of Sciences, Belarus
Jingshan Li University of Wisconsin-Madison, USA
Ming K. Lim Chongqing University, China
Hermann Lödding Hamburg University of Technology, Germany
Pierre Lopez LAAS-CNRS, France
Marco Macchi Politecnico di Milano, Italy
Ugljesa Marjanovic University of Novi Sad, Serbia
Muthu Mathirajan Indian Institute of Science, India
Gökan May University of North Florida, USA
Khaled Medini Mines St Etienne, France
Jörn Mehnen University of Strathclyde, UK
Vidosav D. Majstorovich University of Belgrade, Serbia
Semyon M. Meerkov University of Michigan, USA
Joao Gilberto Mendes UNIP Paulista University, Brazil
dos Reis
Hajime Mizuyama Aoyama Gakuin University, Japan
Ilkyeong Moon Seoul National University, South Korea
Eiji Morinaga Osaka Prefecture University, Japan
Dimitris Mourtzis University of Patras, Greece
Irenilza de Alencar Naas UNIP Paulista University, Brazil
Masaru Nakano Keio University, Japan
Torbjörn Netland ETH Zürich, Switzerland
Gilles Neubert EMLYON Business School, Saint-Etienne, France
Izabela Nielsen Aalborg University, Denmark
Tomomi Nonaka Ritsumeikan University, Japan
Jinwoo Park Seoul National University, South Korea
François Pérès INP-Toulouse, ENIT, France
Fredrik Persson Linköping Institute of Technology, Sweden
Giuditta Pezzotta University of Bergamo, Italy
Selwyn Piramuthu University of Florida, USA
Alberto Portioli Staudacher Politecnico di Milano, Italy
Daryl Powell Norwegian University of Science and Technology,
Norway
Vittaldas V. Prabhu Pennsylvania State University, USA
Jean-Marie Proth Inria, France
Ricardo José Rabelo Federal University of Santa Catarina, Brazil
xii Organization
Rahul Rai University at Buffalo, USA

Mario Rapaccini Florence University, Italy
Nidhal Rezg University of Lorraine, France
Ralph Riedel Westsächsische Hochschule Zwickau, Germany
Irene Roda Politecnico di Milano, Italy
Asbjörn Rolstadås Norwegian University of Science and Technology,
Norway
Christoph Roser Karlsruhe University of Applied Sciences, Germany
André Rossi Université Paris-Dauphine, France
Martin Rudberg Linköping University, Sweden
Thomas E. Ruppli University of Basel, Switzerland
Krzysztof Santarek Warsaw University of Technology, Poland
Subhash Sarin VirginiaTech, USA
Suresh P. Sethi The University of Texas at Dallas, USA
Fabio Sgarbossa Norwegian University of Science and Technology,
Norway
John P. Shewchuk Virginia Polytechnic Institute and State University,
USA
Dan L. Shunk Arizona State University, USA
Ali Siadat Arts et Métiers ParisTech, France
Riitta Smeds Aalto University, Finland
Boris Sokolov Russian Academy of Sciences, Russia
Vijay Srinivasan National Institute of Standards and Technology, USA
Johan Stahre Chalmers University of Technology, Sweden
Kathryn E. Stecke The University of Texas at Dallas, USA
Kenn Steger-Jensen Aalborg University, Denmark
Volker Stich RWTH Aachen University, Germany
Richard Lee Storch University of Washington, USA
Jan Ola Strandhagen Norwegian University of Science and Technology,
Norway
Stanislaw Strzelczak Warsaw University of Technology, Poland
Nick Szirbik University of Groningen, The Netherlands
Marco Taisch Politecnico di Milano, Italy
Lixin Tang Northeastern University, China
Kari Tanskanen Aalto University School of Science, Finland
Ilias Tatsiopoulos National Technical University of Athens, Greece
Sergio Terzi Politecnico di Milano, Italy
Klaus-Dieter Thoben Universität Bremen, Germany
Manoj Tiwari Indian Institute of Technology, India
Matthias Thüre Jinan University, China
Jacques H. Trienekens Wageningen University, The Netherlands
Mario Tucci Universitá degli Studi di Firenze, Italy
Shigeki Umeda Musashi University, Japan
Bruno Vallespir University of Bordeaux, France
François Vernadat University of Lorraine, France
Organization xiii
Agostino Villa Politecnico di Torino, Italy

Lihui Wang KTH Royal Institute of Technology, Sweden
Sabine Waschull University of Groningen, The Netherlands
Hans-Hermann Wiendahl University of Stuttgart, Germany
Frank Werner University of Magdeburg, Germany
Shaun West Lucerne University of Applied Sciences and Arts,
Switzerland
Joakim Wikner Jönköping University, Sweden
Hans Wortmann University of Groningen, The Netherlands
Desheng Dash Wu University of Chinese Academy of Sciences, China
Thorsten Wuest West Virginia University, USA
Farouk Yalaoui University of Technology of Troyes, France
Noureddine Zerhouni Université Bourgogne Franche-Comte, France
List of Reviewers
Abbou Rosa Batocchio Antonio

Abdeljaouad Mohamed Amine Battaïa Olga
Absi Nabil Battini Daria
Acerbi Federica Behrens Larissa
Aghelinejad Mohsen Ben-Ammar Oussama
Aghezzaf El-Houssaine Benatia Mohamed Amin
Agrawal Rajeev Bentaha M.-Lounes
Agrawal Tarun Kumar Benyoucef Lyes
Alexopoulos Kosmas Beraldi Santos Alexandre
Alix Thecle Bergmann Ulf
Alkhudary Rami Bernus Peter
Altekin F. Tevhide Berrah Lamia-Amel
Alves Anabela Bertnum Aili Biriita
Ameri Farhad Bertoni Marco
Andersen Ann-Louise Bettayeb Belgacem
Andersen Bjorn Bevilacqua Maurizio
Anderson Marc Biennier Frédérique
Anderson Matthew Bititci Umit Sezer
Anholon Rosley Bocanet Vlad
Antosz Katarzyna Bosch-Mauchand Magali
Apostolou Dimitris Boucher Xavier
Arica Emrah Bourguignon Saulo Cabral
Arlinghaus Julia Christine Bousdekis Alexandros
Aubry Alexis Brahimi Nadjib
Baalsrud Hauge Jannicke Bresler Maggie
Badulescu Yvonne Gabrielle Brunoe Thomas Ditlev
Bakhtadze Natalia Brusset Xavier
Barbosa Christiane Lima Burow Kay
Barni Andrea Calado Robisom Damasceno
xiv Organization
Calarge Felipe Dolgui Alexandre

Camarinha-Matos Luis Manuel Dolinsek Slavko
Cameron David Dou Runliang
Cannas Violetta Giada Drei Samuel Martins
Cao Yifan Dreyer Heidi
Castro Eduardo Lorenzo Dreyfus Paul-Arthur
Cattaruzza Diego Dubey Rameshwar
Cerqueus Audrey Dümmel Johannes
Chang Tai-Woo Eloranta Eero
Chaves Sandra Maria do Amaral Emmanouilidis Christos
Chavez Zuhara Ermolova Maria
Chen Jinwei Eslami Yasamin
Cheng Yongxi Fast-Berglund Åsa
Chiacchio Ferdinando Faveto Alberto
Chiari da Silva Ethel Cristina Federico Adrodegari
Childe Steve Feng Xuehao
Cho Hyunbo Finco Serena
Choi SangSu Flores-García Erik
Chou Shuo-Yan Fontaine Pirmin
Christensen Flemming Max Møller Fosso Wamba Samuel
Chung Byung Do Franciosi Chiara
Ciarapica Filippo Emanuele Frank Jana
Cimini Chiara Franke Susanne
Clivillé Vincent Freitag Mike
Cohen Yuval Frick Jan
Converso Giuseppe Fruggiero Fabio
Cosenza Harvey Fu Wenhan
Costa Helder Gomes Fujii Nobutada
Da Cunha Catherine Gahan Padmabati
Daaboul Joanna Gaiardelli Paolo
Dahane Mohammed Gallo Mosè
Dakic Dusanka Ganesan Viswanath Kumar
Das Dyutimoy Nirupam Gaponov Igor
Das Jyotirmoy Nirupam Gayialis Sotiris P.
Das Sayan Gebennini Elisa
Davari Morteza Ghadge Abhijeet
De Arruda Ignacio Paulo Sergio de Ghrairi Zied
De Campos Renato Gianessi Paolo
De Oliveira Costa Neto Pedro Luiz Giret Boggino Adriana
Delorme Xavier Gloeckner Robert
Deroussi Laurent Gogineni Sonika
Despeisse Mélanie Gola Arkadiusz
Di Nardo Mario Goodarzian Fariba
Di Pasquale Valentina Gosling Jon
Dillinger Fabian Gouyon David
Djedidi Oussama Grabot Bernard
Organization xv
Grangeon Nathalie Jones Al

Grassi Andrea Jun Chi-Hyuck
Grenzfurtner Wolfgang Jun Hong-Bae
Guerpinar Tan Jun Sungbum
Guillaume Romain Juned Mohd
Guimarães Neto Abelino Reis Jünge Gabriele
Guizzi Guido Kaasinen Eija
Gupta Sumit Kaihara Toshiya
Gurevsky Evgeny Kalaboukas Kostas
Habibi Muhammad Khoirul Khakim Kang Yong-Shin
Haddou Benderbal Hichem Karampatzakis Dimitris
Halse Lise Lillebrygfjeld Kayikci Yasanur
Hammami Ramzi Kedad-Sidhoum Safia
Hani Yasmina Keepers Makenzie
Hashemi-Petroodi S. Ehsan Keivanpour Samira
Havzi Sara Keshari Anupam
Hazir Oncu Kim Byung-In
Hedayatinia Pooya Kim Duck Young
Hemmati Ahmad Kim Hwa-Joong
Henchoz El Kadiri Soumaya Kim Hyun-Jung
Heuss Lisa Kinra Aseem
Hibino Hironori Kiritsis Dimitris
Himmiche Sara Kitjacharoenchai Patchara
Hnaien Faicel Kjeldgaard Stefan
Hofer Gernot Kjersem Kristina
Holst Lennard Phillip Klimchik Alexandr
Hovelaque Vincent Klymenko Olena
Hrnjica Bahrudin Kollberg Thomassen Maria
Huber Walter Kolyubin Sergey
Husniah Hennie Koomsap Pisut
Hvolby Hans-Henrik Kramer Kathrin
Hwang Gyusun Kulvatunyou Boonserm (Serm)
Irohara Takashi Kumar Ramesh
Islam Md Hasibul Kurata Takeshi
Iung Benoit Kvadsheim Nina Pereira
Ivanov Dmitry Lahaye Sébastien
Jacomino Mireille Lalic Danijela
Jagdev Harinder Lamouri Samir
Jahn Niklas Lamy Damien
Jain Geetika Landryova Lenka
Jain Vipul Lechner Jan-Peter
Jasiulewicz-Kaczmarek Małgorzata Lee Dong-Ho
Jebali Aida Lee Eunji
Jelisic Elena Lee Kangbok
Jeong Yongkuk Lee Kyungsik
Johansen John Lee Minchul
xvi Organization
Lee Seokcheon Marques Melissa

Lee Seokgi Marrazzini Leonardo
Lee Young Hoon Masone Adriano
Lehuédé Fabien Massonnet Guillaume
Leiber Daria Matsuda Michiko
Lemoine David Maxwell Duncan William
Li Haijiao Mazzuto Giovanni
Li Yuanfu Medić Nenad
Lim Dae-Eun Medini Khaled
Lim Ming Mehnen Jorn
Lima Adalberto da Mendes dos Reis João Gilberto
Lima Nilsa Mentzas Gregoris
Lin Chen-ju Metaxa Ifigeneia
Linares Jean-marc Min Li Li
Linnartz Maria Minner Stefan
Listl Franz Georg Mishra Ashutosh
Liu Ming Mitra Rony
Liu Xin Mizuyama Hajime
Liu Zhongzheng Mogale Dnyaneshwar
Lödding Hermann Mohammadi Mehrdad
Lodgaard Eirin Mollo Neto Mario
Loger Benoit Montini Elias
Lorenz Rafael Montoya-Torres Jairo R.
Lu Jinzhi Moon Ilkyeong
Lu Xingwei Moraes Thais De Castro
Lu Xuefei Morinaga Eiji
Lucas Flavien Moser Benedikt
Lüftenegger Egon Moshref-Javadi Mohammad
Luo Dan Mourtzis Dimitris
Ma Junhai Mundt Christopher
Macchi Marco Muši Denis
Machado Brunno Abner Nääs Irenilza De Alencar
Maier Janine Tatjana Naim Mohamed
Maihami Reza Nakade Koichi
Makboul Salma Nakano Masaru
Makris Sotiris Napoleone Alessia
Malaguti Roney Camargo Nayak Ashutosh
Mandal Jasashwi Neroni Mattia
Mandel Alexander Netland Torbjørn
Manier Hervé Neubert Gilles
Manier Marie-Ange Nguyen Du Huu
Marangé Pascale Nguyen Duc-Canh
Marchesano Maria Grazia Nguyen Thi Hien
Marek Svenja Nielsen Izabela
Marjanovic Ugljesa Nielsen Kjeld
Marmolejo Jose Antonio Nishi Tatsushi
Organization xvii
Nogueira Sara Roser Christoph

Noh Sang Do Rossit Daniel Alejandro
Nonaka Tomomi Rudberg Martin
Noran Ovidiu Sabitov Rustem
Norre Sylvie Sachs Anna-Lena
Ortmeier Frank Sahoo Rosalin
Ouazene Yassine Sala Roberto
Ouzrout Yacine Santarek Kszysztof
Özcan Uğur Satolo Eduardo Guilherme
Paes Graciele Oroski Satyro Walter
Pagnoncelli Bernardo Savin Sergei
Panigrahi Sibarama Schneider Daniel
Panigrahi Swayam Sampurna Semolić Brane
Papakostas Nikolaos Shafiq Muhammad
Papcun Peter Sharma Rohit
Pashkevich Anatol Shin Jong-Ho
Pattnaik Monalisha Shukla Mayank
Pels Henk Jan Shunk Dan
Pérès François Siadat Ali
Persson Fredrik Silva Cristovao
Pezzotta Giuditta Singgih Ivan Kristianto
Phan Dinh Anh Singh Sube
Piétrac Laurent Slama Ilhem
Pinto Sergio Crespo Coelho da Smaglichenko Alexander
Pirola Fabiana Smeds Riitta Johanna
Pissardini Paulo Eduardo Soares Paula Metzker
Polenghi Adalberto Softic Selver
Popolo Valentina Sokolov Boris V.
Portioli Staudacher Alberto Soleilhac Gauthier
Powell Daryl Song Byung Duk
Prabhu Vittaldas Song Xiaoxiao
Psarommatis Foivos Souier Mehdi
Rabelo Ricardo Sørensen Daniel Grud Hellerup
Rakic Slavko Spagnol Gabriela
Rapaccini Mario Srinivasan Vijay
Reis Milena Estanislau Diniz Dos Stavrou Vasileios P.
Resanovic Daniel Steger-Jensen Kenn
Rey David Stich Volker
Riedel Ralph Stipp Marluci Andrade Conceição
Rikalović Aleksandar Stoll Oliver
Rinaldi Marta Strandhagen Jan Ola
Roda Irene Suh Eun Suk
Rodriguez Aguilar Roman Suleykin Alexander
Romagnoli Giovanni Suzanne Elodie
Romeo Bandinelli Szirbik Nick B.
Romero David Taghvaeipour Afshin
xviii Organization
Taisch Marco Wang Yingli

Tanimizu Yoshitaka Wang Yuling
Tanizaki Takashi Wang Zhaojie
Tasić Nemanja Wang Zhixin
Tebaldi Letizia Wellsandt Stefan
Telles Renato West Shaun
Thevenin Simon Wiendahl Hans-Hermann
Thoben Klaus-Dieter Wiesner Stefan Alexander
Thurer Matthias Wikner Joakim
Tiedemann Fredrik Wiktorsson Magnus
Tisi Massimo Wimmer Manuel
Torres Luis Fernando Woo Young-Bin
Tortorella Guilherme Luz Wortmann Andreas
Troyanovsky Vladimir Wortmann Johan Casper
Turcin Ioan Wuest Thorsten
Turki Sadok Xu Tiantong
Ulrich Marco Yadegari Ehsan
Unip Solimar Yalaoui Alice
Valdiviezo Viera Luis Enrique Yang Danqin
Vallespir Bruno Yang Guoqing
Vasic Stana Yang Jie
Vaz Paulo Yang Zhaorui
Vespoli Silvestro Yelles Chaouche Abdelkrim Ramzi
Vicente da Silva Ivonaldo Zaeh Michael Friedrich
Villeneuve Eric Zaikin Oleg
Viviani Jean-Laurent Zambetti Michela
Vještica Marko Zeba Gordana
Vo Thi Le Hoa Zhang Guoqing
Voisin Alexandre Zhang Ruiyou
von Cieminski Gregor Zheng Feifeng
Von Stietencron Moritz Zheng Xiaochen
Wagner Sarah Zoitl Alois
Wang Congke Zolotová Iveta
Wang Hongfeng Zouggar Anne
Wang Yin
Contents – Part IV
AI for Resilience in Global Supply Chain Networks in the Context

of Pandemic Disruptions
Modelling COVID-19 Ripple Effect and Global Supply Chain Productivity

Impacts Using a Reaction-Diffusion Time-Space SIS Model . . . . . . . . . . . . . 3
Xavier Brusset, Morteza Davari, Aseem Kinra, and Davide La Torre
A Vector Logistic Dynamical Approach to Epidemic Evolution

on Interacting Social-Contact and Production-Capacity Graphs . . . . . . . . . . . 13
Jan Bart Broekaert and Davide La Torre
Modeling Shock Propagation on Supply Chain Networks:

A Stochastic Logistic-Type Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
Cinzia Colapinto, Davide La Torre, Iside Rita Laganà,
and Danilo Liuzzi
Towards Explainable Artificial Intelligence (XAI) in Supply Chain

Management: A Typology and Research Agenda . . . . . . . . . . . . . . . . . . . . 32
Godfrey Mugurusi and Pross Nagitta Oluka
Distribution of Vaccines During a Pandemic (Covid-19) . . . . . . . . . . . . . . . 39

Vignesh Dhanapal and Subhash C. Sarin
Blockchain in the Operations and Supply Chain Management
Blockchain-Based Master Data Management in Supply Chains:

A Design Science Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Jacob Lohmer, Lasse Bohlen, and Rainer Lasch
Blockchain for Product Authenticity in the Cannabis Supply Chain . . . . . . . . 62

Sven Januszek, Andreas Siegrist, and Torbjørn H. Netland
A Blockchain-Based Manufacturing Service Composition Architecture

for Trust Issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
Qianhang Lyu, Yunqing Rao, Jiawei Wang, and Peng Qi
An Approach for Creating a Blockchain Platform for Labeling

and Tracing Wines and Spirits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
Sotiris P. Gayialis, Evripidis P. Kechagias,
Grigorios D. Konstantakopoulos, Georgios A. Papadopoulos,
and Ilias P. Tatsiopoulos
xx Contents – Part IV
Blockchain Design for Digital Supply Chain Integration . . . . . . . . . . . . . . . 90

Kari Korpela, Petr Novotny, Alevtina Dubovitskay, Tomi Dahlberg,
Mika Lammi, and Jukka Hallikas
Data-Based Services as Key Enablers for Smart Products,

Manufacturing and Assembly
Customer Order Scheduling in an Additive Manufacturing Environment . . . . 101

Benedikt Zipfel, Janis S. Neufeld, and Udo Buscher
A Conceptual Reference Model for Smart Factory Production Data . . . . . . . . 110

Giulia Boniotti, Paola Cocca, Filippo Marciano, Alessandro Marini,
Elena Stefana, and Federico Vernuccio
Generating Synthetic Training Data for Assembly Processes . . . . . . . . . . . . . 119

Johannes Dümmel, Valentin Kostik, and Jan Oellerich
Data Acquisition for Energy Efficient Manufacturing: A Systematic

Literature Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
Henry Ekwaro-Osire, Stefan Wiesner, and Klaus-Dieter Thoben
Review of Factors Influencing Product-Service System Requirements

Along the Life Cycle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
Stefan Wiesner and Jannicke Baalsrud Hauge
Data-Driven Methods for Supply Chain Optimization
Data-Driven Solutions for the Newsvendor Problem: A Systematic

Literature Review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
Thais de Castro Moraes and Xue-Ming Yuan
An Information Sharing Framework for Supply Chain Networks:

What, When, and How to Share . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
Eunji Lee and Stefan Minner
A Robust Data Driven Approach to Supply Planning. . . . . . . . . . . . . . . . . . 169

Benoit Loger, Alexandre Dolgui, Fabien Lehuédé,
and Guillaume Massonnet
Responsible Manufacturing with Information Disclosure Under

Regulatory Inspections. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
Yifan Cao and Bin Shen
Understanding Supply Chain Visibility Through Experts’ Perspective:

A Delphi Based Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
Tarun Kumar Agrawal, Ravi Kalaiarasan, Jan Olhager,
and Magnus Wiktorsson
Contents – Part IV xxi
Digital Twins Based on Systems Engineering and Semantic Modeling
STARdom: An Architecture for Trusted and Secure Human-Centered

Manufacturing Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
Jože M. Rožanec, Patrik Zajec, Klemen Kenda, Inna Novalija,
Blaž Fortuna, Dunja Mladenić, Entso Veliou,
Dimitrios Papamartzivanos, Thanassis Giannetsos,
Sofia Anna Menesidou, Rubén Alonso, Nino Cauli,
Diego Reforgiato Recupero, Dimosthenis Kyriazis,
Georgios Sofianidis, Spyros Theodoropoulos, and John Soldatos
Semantic Modeling Supports the Integration

of Concept-Decision-Knowledge . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
Yili Jin, Jinzhi Lu, Guoxin Wang, Ru Wang, and Kiritsis Dimitris
Model-Based Systems Engineering Supporting Integrated Modeling

and Optimization of Radar Cabin Layout . . . . . . . . . . . . . . . . . . . . . . . . . . 218
Shiyan She, Jinzhi Lu, Guoxin Wang, Jie Ding, and Zixiang Hu
Supporting Digital Twin Integration Using Semantic Modeling

and High-Level Architecture. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
Han Li, Jinzhi Lu, Xiaochen Zheng, Guoxin Wang, and Dimitris Kiritsis
Digital Twin-Driven Approach for Smart City Logistics:

The Case of Freight Parking Management . . . . . . . . . . . . . . . . . . . . . . . . . 237
Yu Liu, Pauline Folz, Shenle Pan, Fano Ramparany, Sébastien Bolle,
Eric Ballot, and Thierry Coupaye
Digital Twins in Companies First Developments and Future Challenges
The Advent of the Digital Twin: A Prospective in Healthcare

in the Next Decade . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
Jorge Luis Rojas-Arce and Eduardo Cassiel Ortega-Maldonado
Reviewing the Application of Data Driven Digital Twins in Manufacturing

Systems: A Business and Management Perspective . . . . . . . . . . . . . . . . . . . 256
Ehsan Badakhshan and Peter Ball
Improving a Manufacturing Process using Recursive Artificial Intelligence. . . 266

Jose Antonio Marmolejo-Saucedo, Roman Rodriguez-Aguilar,
Uriel Abel Romero Perea, Manuel Garrido Vaqueiro,
Regina Robredo Hernandez, Fernando Sanchez Ramirez,
and Ana Paula Martinez
Digital Twin in the Agri-Food Supply Chain: A Literature Review . . . . . . . . 276

Letizia Tebaldi, Giuseppe Vignali, and Eleonora Bottani
xxii Contents – Part IV
A Digital Twin Implementation for Manufacturing Based on Open-Source

Software and Standard Control Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
Christian Dalheim Øien, Håkon Dahl, and Sebastian Dransfeld
Human-Centered Artificial Intelligence in Smart Manufacturing

for the Operator 4.0
Towards Active Learning Based Smart Assistant for Manufacturing . . . . . . . 295

Patrik Zajec, Jože Martin Rožanec, Inna Novalija, Blaž Fortuna,
Dunja Mladenić, and Klemen Kenda
Human-AI Collaboration in Quality Control with Augmented

Manufacturing Analytics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
Alexandros Bousdekis, Stefan Wellsandt, Enrica Bosani,
Katerina Lepenioti, Dimitris Apostolou, Karl Hribernik,
and Gregoris Mentzas
Digital Platform and Operator 4.0 Services for Manufacturing Repurposing

During COVID19 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
John Soldatos, Nikos Kefalakis, Georgios Makantasis,
Angelo Marguglio, and Oscar Lazaro
Anatomy of a Digital Assistant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 321

Stefan Wellsandt, Karl Hribernik, and Klaus-Dieter Thoben
Human in the AI Loop in Production Environments . . . . . . . . . . . . . . . . . . 331

C. Emmanouilidis, S. Waschull, J. A. C. Bokhorst, and J. C. Wortmann
Operations Management in Engineer-to-Order Manufacturing
Value Stream Mapping for Knowledge Work: A Study from Project-Based

Engineering-To-Order Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345
Daria Larsson, Arne Gildseth, and R. M. Chandima Ratnayake
A Literature-Based Exploration of Servitization

in Engineer-to-Order Companies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 354
Antonio Masi, Margherita Pero, and Nizar Abdelkafi
The Unexpected Consequences of the Covid 19 on Managing

ETO Projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363
Kristina Kjersem and Marte F. Giskeødegård
Requirements for Sales and Operations Planning in an Engineer-to-Order

Manufacturing Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371
Swapnil Bhalla, Erlend Alfnes, Hans-Henrik Hvolby,
and Olumide Emmanuel Oluyisola
Contents – Part IV xxiii
A Systematic Approach to Implementing Multi-sourcing Strategy

in Engineer-to-Order Production . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 381
Deodat Mwesiumo, Bella B. Nujen, and Nina Pereira Kvadsheim
Product and Asset Life Cycle Management for Smart and Sustainable
Manufacturing Systems
A Holistic Approach to PLI in Smart Maintenance Towards

Sustainable Manufacturing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 393
Harald Rødseth, Endre Sølvsberg, Anna Steine, Per Schjølberg,
and Espen Henriksen-Polanscak
Sustainable Maintenance Performances and EN 15341:2019:

An Integration Proposal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
Chiara Franciosi, Irene Roda, Alexandre Voisin, Salvatore Miranda,
Marco Macchi, and Benoit Iung
System-Level Overall Equipment Effectiveness for Improving Asset

Management Performance: A Case Study Application . . . . . . . . . . . . . . . . . 410
Alberto Franzini, Adalberto Polenghi, Irene Roda, and Marco Macchi
Semantic Interoperability and Sustainability an Industry 4.0 Product Life

Cycle Issue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 418
Yasamin Eslami, Sahand Ashouri, and Mario Lezoche
The Concept of Sustainable Maintenance Criteria Assessment. . . . . . . . . . . . 427

Małgorzata Jasiulewicz-Kaczmarek and Katarzyna Antosz
Cost Projections for the Product Life Cycle at the Early Stages
of Product Development . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 437
Marcin Relich, Grzegorz Bocewicz, and Zbigniew Banaszak
Robotics Technologies for Control, Smart Manufacturing

and Logistics
Redundancy Resolution in Kinematic Control of Serial Manipulators

in Multi-obstacle Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
Wanda Zhao, Anatol Pashkevich, and Damien Chablat
Automatic Drones for Factory Inspection: The Role of Virtual Simulation . . . 457
Omid Maghazei, Torbjørn H. Netland, Dirk Frauenberger,
and Tobias Thalmann
Geometric Error Modeling and Sensitivity Analysis of a Laser Pipe-Cutting

System Based on Lie Group and Sobol Method . . . . . . . . . . . . . . . . . . . . . 465
Yuze Jiang, Wenyu Yang, Liang Qin, and Tong Ding
xxiv Contents – Part IV
Tensegrity Morphing: Machine Learning-Based Tensegrity Deformation

Predictor for Traversing Cluttered Environments . . . . . . . . . . . . . . . . . . . . . 473
Eduard Zalyaev and Sergei Savin
Seed-and-Prune Approach for Rapid Discovery of Tensegrity-Like

Structures of the Desired Shape . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
Sergei Savin
Serious Games Analytics: Improving Games and Learning Support
Experiencing the Role of Cooperation and Competition in Operations

and Supply Chain Management with a Multiplayer Serious Game . . . . . . . . . 491
Matteo Galli, Davide Mezzogori, Davide Reverberi,
Giovanni Romagnoli, and Francesco Zammori
Towards a Serious Game on Data Sharing in Business Ecosystems . . . . . . . . 500

Ulriikka Järvihaavisto, Mikael Öhman, and Riitta Smeds
Accessibility Considerations in the Design of Serious Games for Production

and Logistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 510
Jannicke Baalsrud Hauge, Ioana Andreea Stefan, Niina Sallinen,
and Jakob A. H. Baalsrud Hauge
Smart and Sustainable Production and Supply Chains
Achieving Circular and Efficient Production Systems: Emerging

Challenges from Industrial Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523
Mélanie Despeisse, Arpita Chari, Clarissa Alejandra González Chávez,
Xiaoxia Chen, Björn Johansson, Víctor Igelmo Garcia, Anna Syberfeldt,
Tarek Abdulfatah, and Alexey Polukeev
Value Stream Mapping (VSM) to Evaluate and Visualize Interrelated

Process-Chains Regarding Circular Economy . . . . . . . . . . . . . . . . . . . . . . . 534
Jeff Mangers, Meysam Minoufekr, and Peter Plapper
Research on a Preannounced Pricing Policy in a Two-Period Dual-Channel

Supply Chain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543
Haijiao Li, Kuan Yang, and Guoqing Zhang
Sustainable and Resilience Improvement Through the Design for Circular

Digital Supply Chain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
Abla Chaouni Benabdellah, Kamar Zekhnini, and Anass Cherrafi
A Literature Review on Smart Technologies and Logistics . . . . . . . . . . . . . . 560

Xingwei Lu, Xianhao Xu, and Yeming Gong
Contents – Part IV xxv
A Robust Optimization Model for a Community Healthcare Service

Network Design Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 568
Congke Wang, Yankui Liu, Jinfeng Li, and Guoqing Yang
A Review of Explainable Artificial Intelligence. . . . . . . . . . . . . . . . . . . . . . 574

Kuo-Yi Lin, Yuguang Liu, Li Li, and Runliang Dou
The Impact of the Number of Regulated Suppliers in Green Supply Chain

Action on Financial Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 585
Xuanchang Qi and Hanhui Hu
Digitalization for Resilience and Sustainability During the Covid-19

Pandemic: An Explorative Event Study . . . . . . . . . . . . . . . . . . . . . . . . . . . 591
Seyoum Eshetu Birkie
Smart Methods and Techniques for Sustainable Supply

Chain Management
Minimising Total Costs of a Two-Echelon Multi-Depot Capacitated

Vehicle Routing Problem (2E-MD-CVRP) that Describes the Utilisation
of the Amsterdam City Canal Network for Last Mile Parcel Delivery . . . . . . 603
Bartje Alewijnse and Alexander Hübl
Evaluating the Deployment of Collaborative Logistics Models

for Local Delivery Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 613
Andrea Bari, Fabio Salassa, Maurizio Arnone, and Tiziana Delmastro
Suppliers Selection Ontology for Viable Digital Supply Chain Performance. . . . 622
Kamar Zekhnini, Anass Cherrafi, Imane Bouhaddou,
and Abla Chaouni Benabdellah
Green Supply Chain Management: A Meta-analysis of Recent Reviews . . . . . 632

Eleonora Bottani and Teresa Murino
Development of an Eco-efficiency Distribution Model:

A Case Study of a Danish Wholesaler . . . . . . . . . . . . . . . . . . . . . . . . . . . . 641
Malte Herold Jeberg, Simon Hummelshøj Sloth, Janus Haslund Løgtved,
Hans-Henrik Hvolby, and Kenn Steger-Jensen
The New Digital Lean Manufacturing Paradigm
The Automation of Lean Practices: Digitalized or Digitally Wasted? . . . . . . . 651

Jamila Alieva and Daryl Powell
Study of the Predictive Mechanism with Big Data-Driven Lean

Manufacturing and Six Sigma Methodology . . . . . . . . . . . . . . . . . . . . . . . . 662
Hong Chen, JianDe Wu, Wei Zhang, Qing Guo, and HuiFeng Lu
xxvi Contents – Part IV
Industry 4.0: Expectations, Impediments and Facilitators . . . . . . . . . . . . . . . 673

Sergio Miele Ruggero, Nilza Aparecida dos Santos,
Antonio Carlos Estender, and Marcia Terra da Silva
Implementation of Digital Tools for Lean Manufacturing:

An Empirical Analysis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 681
Bassel Kassem and Alberto Portioli Staudacher
Reflections from a Hybrid Approach Used to Develop a Specification

of a Shopfloor Platform for Smart Manufacturing in an
Engineered-to-Order SME . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 691
Yann Keiser, Shaun West, and Simon Züst
The Role of Emerging Technologies in Disaster Relief Operations:

Lessons from COVID-19
Shelter Location-Allocation Problem with Vulnerabilities of Network

and Disruption of Shelter During the Response Phase of Disaster . . . . . . . . . 705
Sweety Hansuwa, Usha Mohan, and Viswanath Kumar Ganesan
Technologies Helping Smart Cities to Build Resilience: Focus

on COVID-19. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 714
Helton Almeida dos Santos, Emerson da Silva Santana,
Robson Elias Bueno, and Silvia Helena Bonilla
Key Success Factors for Supply Chain Sustainability in COVID-19

Pandemic: An ISM Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 724
Surajit Bag, Peter Kilbourn, Noleen Pisa, and Mihalis Giannakis
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 735

AI for Resilience in Global Supply
Chain Networks in the Context
of Pandemic Disruptions
Modelling COVID-19 Ripple Effect
and Global Supply Chain Productivity
Impacts Using a Reaction-Diffusion
Time-Space SIS Model
Xavier Brusset1 , Morteza Davari1(B) , Aseem Kinra2 , and Davide La Torre1

1
SKEMA Business School, Université Côte D’Azur, Nice, France
morteza.davari@skema.edu
2
Professorship for Global Supply Chain Management,
Universität Bremen, Bremen, Germany
Abstract. As the COVID pandemic shows, infection spreads widely

across regions, impacting economic activity in unforeseen ways. We rep-
resent here how the geographic spread of the pandemic, by reducing the
workers’ participation to economic life, undermines the ability of firms
and as a result the entire supply networks to satisfy customers’ demands.
We model the spatio-temporal dynamics of the propagation of Covid-19
infection on population, transport networks, facilities and population
flows. The mathematical models will enable prospective analyses to be
performed reliably. Such models will be used in what-if scenarios to sim-
ulate the impact on both populations and supply chain activities in case
of future pandemics. The outcome should be useful tools for policymak-
ers and managers. Results from this research will help in understanding
the impact and the spread of a pandemic in a particular region and on
supply chains. The data will be from European regions and the expected
models will have validity in Europe.
Keywords: Spatial dynamics · Ripple effect · Propagation ·

Disruption · Graph theory · Network evaluation
1 Introduction
Covid-19 is a highly contagious virus-induced communicable disease, transmitted

via droplets and contaminated objects during close unprotected contact between
a healthy and an infected person [6]. As such infected people move away from
the location in which they were contaminated, uncontaminated locations farther
and farther away become centres of infection in their own right.
The Covid-19 pandemic has had huge human and economic consequences.
Thus, understanding how to reduce the spread of the disease and which specific
policies to implement in order to manage the pandemic is paramount
c IFIP International Federation for Information Processing 2021

Published by Springer Nature Switzerland AG 2021
A. Dolgui et al. (Eds.): APMS 2021, IFIP AICT 633, pp. 3–12, 2021.
https://doi.org/10.1007/978-3-030-85910-7_1
4 X. Brusset et al.
As is well understood, the movement of infected people and the evolution of

the virus are fundamental to the spread of the pandemic. The flows of popu-
lations are represented depending on the granularity of the data and the level
of detail of the maps. When such movements are coupled with the incidence of
infection, insights can be obtained about the evolution in time and in space,
and causes may be inferred. As the level of detail increases, provided that the
corresponding data exists, further insights about the causes of the dispersion
of the virus and the corresponding infection intensity in the population can be
obtained. Thus, mapping how the infection spreads can shed light both on the
type of countermeasures and the impact on economic activity.
The European economy is dependent on international cooperation and on
the fact that goods can flow freely. Most of the firms’ supply chains are highly
interconnected, characterised by a high degree of complexity, long distances,
and a large number of intermediaries. According to a study, 75% of European
supply chains have been negatively affected by the crisis. The most important
bottlenecks are the inward flow of goods from suppliers (62%), lack of insight
into customer needs (60%), and the outward flow of goods to customers (50%).
We are therefore now in a largely unknown territory in relation to risk man-
agement in the supply chain. The challenge does not only include sharp fluctu-
ations on the part of customers with unknown and highly fluctuating demand
but also from supplies which can no longer be produced because specific inputs
are produced at slower rates or arrive sporadically.
The purpose of the study is to be able to identify the evolution of the pan-
demic and model its impact on supply chains. Several models approximating the
temporal spread of the pandemic [2] or of the effect of lockdown measures [8]
already exist but do not help in understanding the ripple effect on supply chains.
In the following, we present the state of research on the way a pandemic’s
effects spreads through supply chain networks and the proposed ways for man-
agers to control this impact on their firms’ activity. We then present two epi-
demiological models which explain the infection spread in a homogeneous pop-
ulation and its extension into the spread among various populations. In Sect. 5,
we model the impact of a pandemic on the various nodes of a supply network
in terms of productivity as workers get infected. We draw some conclusions and
present recommendations for future research in Sect. 7.
2 Ripple Effect Visualisation for Global Supply Chains

The phenomenon of the ripple effect has received great research interest in recent
years and more and more contributions have tried to model the dynamics of the
ripple effect through a supply chain network. The ripple effect occurs when a
major disruptive event, such as the lock-downs initiated by Covid-19 virus, trig-
ger a wave of simultaneous disturbances coming from several different directions
[7,12,13,15]. It occurs through the propagation of Low Frequency and High
Impact unforeseen disturbances [14].
Existing work attempts to understand the effects by modelling the ripple
effect [13], and other related supply chain network redesign approaches [22].
Modelling Pandemic Impact on Supply 5
Baghersad and Zobel [3] examine the effects of supply chain disruptions on firms’
performance by applying a new quantitative measure of a disruption’s impact
adapted from the systems resilience literature. Li et al. [20] study and exam-
ine disruption propagations through simulating simple interaction rules of firms
inside the supply chain network by developing an agent-based computational
model.
The literature has thus attempted to understand the effects better by ripple
effect quantification and other related supply chain mapping approaches [16].
However, there is a niche for exploring other Ripple effect approaches, and our
study atemmpts to contribute towards the area of Ripple effect visualization.
3 The Classical SIS Model

The susceptible-infected-susceptible (SIS) epidemiological model represents one
of the simplest frameworks to analyze disease dynamics. The population, N ,
which is assumed to be constant, is composed of two groups: individuals who
are infected, It , and individuals who are not infected but susceptible to infection,
St . Infected individuals spontaneously recover from the disease at a speed δ > 0,
while susceptible individuals contract the disease at a rate α > 0 by interacting
through random matching with infected ones. Unhappily, as we now know [23],
individuals who have recovered from the infection can be re-infected, that is, after
a lapse of time they are susceptible again. This means that we cannot simply
use a SIR model (Susceptible, Infected, Recovered) as presented in [1,5,11,21].
The probability with which matching occurs depends on the actual spread of
the disease across the population [4,9,10,18,19]. The evolution of the number of
infectives and susceptibles is described by the following differential equations:
St It
Ṡt = δIt − α (1)
N
St It
I˙t = α − δIt , (2)
N
It
The above system can be simply recast in terms of the share of infectives, it = N,
and the share of susceptibles, st = SNt , as follows:
ṡt = δit − αit st (3)

i̇t = αit st − δit . (4)
Since 1 = st + it , essentially, the epidemic dynamics can be completely charac-

terized by focusing on one of the two equations as follows:
i̇t = αit (1 − it ) − δit . (5)
The above equation describes the evolution of the disease prevalence in the
entire population. Note that analyzing the equilibria for the above model is
rather straightforward. As discussed in the epidemiology literature, the long run
outcome solely depends on the basic reproduction number, R0 , given by R0 = αδ .
6 X. Brusset et al.
4 A Reaction-Diffusion Time-Space SIS Model

We now focus on an extension of the basic SIS model to allow for geographical
heterogeneities and externalities by introducing a spatial dimension. We denote
with Sx,t and Ix,t , respectively the susceptibles and infectives in the position
x ∈ Ω, where Ω ⊂ R2 is a compact set at date t ∈ R+ .
The epidemic dynamics cannot be fully characterized by focusing only on the
evolution of the portions of infectives and susceptibles (ix,t and sx,t ) rather than
the numbers of infectives and susceptibles (Ix,t and Sx,t ). This is due to the fact
that the population is spatially distributed, N = Ω Nx,t with Nx,t = Sx,t + Ix,t ,
and thus it is not necessarily true that the shares of infectives and susceptibles
sum up to one in each location x (i.e., they do sum up to one over the whole
Ix,t
spatial domain). In particular, the share of infectives, ix,t = N , and the share
Sx,t
of susceptibles, sx,t = N , in each location x jointly determine the share of the
total population residing in that specific location, nx,t with nx,t = sx,t + ix,t ,
while the sum of the shares of the total population residing in all locations is
one, Ω nx,t dx = 1.
Therefore, we need to analyze the evolution of the share of infectives and
susceptibles over time and across space, and the spatial model can be repre-
sented through a system of reaction-diffusion partial differential equations (a
similar approach is used, for instance, in [17,24] to describe pollution diffusion)
as follows:

∂sx,t
= d∇2 sx,t + δix,t − α sx ,t ix ,t ϕx ,x dx , (6)
∂t
Ω
∂ix,t
= d∇2 ix,t + α sx ,t ix ,t ϕx ,x dx − δix,t , (7)
∂t Ω
where the term ϕx,x describes the probability that infected people at the location
x could spread the infection at the location x with x = x .
By recalling that nx,t = sx,t + ix,t , it follows that nx,t solves the summation
∂n
of Eqs. (6) and (7), that is ∂tx,t = d∇2 nx,t with Neumann boundary conditions
and initial conditions directly determined from those related to sx,t and ix,t .
This allows us to consider nx,t as a known exogenous variable, which thus can
be substituted in (6) and (7) by writing sx,t = nx,t − ix,t .
∂nx,t
= d∇2 nx,t (8)
∂t
∂ix,t
= d∇2 ix,t + α (nx ,t − ix ,t )ix ,t ϕx ,x dx − δix,t . (9)
∂t Ω
Notice that the expression of nx,t is known in closed-form once a specific shape
of the set Ω is assumed.
In order to understand the disease dynamics, we can thus analyze the system
of partial differential equations (PDEs) given by (8) and (9), which generalizes
to a spatial dimension SIS model that accounts for population mobility across
locations.
Let us notice that whenever the kernel function ϕx ,x coincides with the
Dirac, the above model boils down to:
∂nx,t
= d∇2 nx,t (10)
∂t
∂ix,t
= d∇2 ix,t + α(nx,t − ix,t )ix,t − δix,t , (11)
∂t
∂n ∂i
with the Neumann boundary conditions ∂nx,t = 0 and ∂n x,t
= 0.
To conclude, once the configuration of the network is known, the number
of infected per node (location) can be evaluated for every location and period
of time. Note that this description is computed directly, contrary to [11] which
requires an algorithm. When comparing this model with the estimation method
in [21], we purport that this one presents numerous advantages as it does not rely
on Bayesian mechanics (including having to evaluate multinomial distributions)
and yet could be applied using the same Baidu-Qianxi database of population
mobility.
5 Supply Chain Network and Total Productivity
The global supply chain is modelled by the means of a graph G = (V, E) with
M nodes, where V denotes the node set and E ⊂ V × V is the edge set. For
simplicity we identify each node v ∈ V of the network with its geographical
coordinates xv .
Given two nodes v, u ∈ V , 0 ≤ φvu ≤ 1 represents the degree of interaction
from node v to node u, summarizing the intensity of their reciprocal trade and
logistic relationships. The network is then described in compact form by the
triplet G = (V, E, φ) where φ is a M × M weighted matrix with the property
that φuv = φvu . The level of infected at each node v ∈ V , is modelled by ixv ,t .
The local evolution of the infection is depending on both the local evolution of
the epidemics as well as the interaction with the adjacent locations.
If Γ (x) describes the per capita productivity at location x, the total pro-
ductivity index Γtot (t) of the supply chain network at time t depends on the
susceptible population at each node v ∈ V of the network and is defined as

Γtot (t) = Γ (xv )sxv ,t = Γ (xv )(nxv ,t − ixv ,t ). (12)
v∈V v∈V
Let us notice that, in absence of epidemics,

Γtot (t) = nxv ,t Γ (xv ). (13)
v∈V
8 X. Brusset et al.
The combination of the dynamics of the epidemic with the definition of the
network productivity leads to the following evolution equation of total Γtot (t):
∂sxv ,t
Γ̇tot (t) = Γ (xv )
v∈V
∂t

= Γ (xv ) d∇2 (nxv ,t − ixv ,t ) − α (nx ,t − ix ,t )ix ,t ϕx ,xv dx + δixv ,t
v∈V Ω

= Γ (xv ) d∇2 sxv ,t − α sx ,t ix ,t ϕx ,xv dx + δixv ,t . (14)
v∈V Ω
6 Numerical Simulation
In this section we present a numerical simulation of the dynamic model:
∂nx,t
= d∇2 nx,t (15)
∂t
∂ix,t
= d∇2 ix,t + α (nx ,t − ix ,t )ix ,t ϕx ,x dx − δix,t . (16)
∂t Ω
For simplicity we suppose that Ω is a 1-dimensional domain and it is nor-

malized to Ω = [0, 1] and that ϕx ,x = δx (x ) is the Dirac at the point x. We also
assume that the diffusion coefficient d is normalized to 1, the initial distribution
of infected people i0 is equal to 0.01x(1 − x) as shown in Fig. 1, and the initial
population nx,0 is homogeneous and normalized to 1. The solution to
∂nx,t ∂ 2 nx,t
=d (17)
∂t ∂x2
subject to the Neumann condition being known, is provided via the Fourier
expansion by: 2
nx,t = An e−(nπ) dt cos (nπx) , (18)
n≥0
where 1
A0 = nx,0 dx = 1, (19)
0
1
An = 2 nx,0 cos (nπx) dx = 0, (20)
0
which implies that nx,t = 1 for any x and t. The above model thus boils down
to
∂ix,t ∂ 2 ix,t
=d + α(1 − ix,t )ix,t − δix,t . (21)
∂t ∂x2
In this case, for any network G, the total productivity evolves accordingly to:

Γtot (t) = Γ (xv )(1 − ixv ,t ). (22)
v∈V
Fig. 1. Initial profile of infected people: i0 (x) = 0.01x(x − 1)
In the first numerical simulation we suppose that the infection rate α is equal
to 0.1328 and the recovery rate δ = 0.0476 (see [18]). The figure shows that after
an initial transition phase of growth, the number of infected people converges
to a long-run endemic and homogeneous equilibrium ix,∞ . In this scenario, the
natural recovery rate δ is not big enough to guarantee a decrease of ix,t over
time.
In this case, let us observe that due to the presence of the pandemic, the
global productivity index Γtot will converge to (see Fig. 2):

lim Γtot (t) = (1 − ixv ,∞ ) Γ (xv ) < Γ (xv ) (23)
t→+∞
v∈V v∈V
.
In the second numerical simulation, we suppose that the infection rate α is
still equal to 0.1328 but the implementation of treatment has raised the recovery
rate δ to 0.1428. In this case, as Fig. 3 shows, the number of infectives decreases
over time and it converges to the disease eradication in the long-run. Of course,
the interesting part is for intermediate periods where the number of infectives
may be non-homogeneous geographically: some locations will be more affected
than others.
Let us observe that in this case, instead, the global productivity index Γtot
will converge to:

lim Γtot (t) = (1 − ixv ,∞ ) Γ (xv ) = Γ (xv ) (24)
t→+∞
v∈V v∈V
.
10 X. Brusset et al.
Fig. 2. Long-run behavior of the disease: d = 1, α = 0.1328, δ = 0.0476
Fig. 3. Long-run behavior of the disease: d = 1, α = 0.1328, δ = 0.1428
7 Conclusion
In conclusion, we see how a pandemic spreads over regions, countries and conti-
nents in continuous time. We have modelled how such a pandemic infects workers
and how this effect slows the production in a supply network, thus impacting
the productivity of single production units and so the whole supply networks.
In this model, we have considered that the effect on production is simply
additive. Of course, in reality, once an upstream partner in a supply network is
impacted, all the downstream partners are also impacted. In a later refinement,
we could look at a model where the effect of a pandemic is exponential in terms of
the position of a node in the network. Another model might take into account the
possibility that the infection rate α has different values across regions, or time.
It is easy to include this in the model described in (9) as αx,t , so accommodating
variants to the original virus.
In contrast to other studies of spatial transmission of the pandemic men-
tioned here, the advantage of the model is to only build from well defined and
understood parameters: the infection rate α, recovery rate δ, the layout of the
network, and population distribution in the various locations. The model takes
into account the fact that people can be re-infected (which means that SIR or
SIRD models are inadequate).
In this way, once a new virus is identified, knowing the characteristics of a
network, a policy maker ( manager) can build a forecasting model to evaluate the
spread of the infection in the regions under her purview (supply chain network).
Armed with such a model, a calibrated set of measures can be implemented
which might impose a lesser burden on populations in the case of public policy
or improve the resilience of the supply chain network.
References
1. Aràndiga, F., et al.: A spatial-temporal model for the evolution of the COVID-19
pandemic in spain including mobility. Mathematics 8(10), 1677 (2020). https://
doi.org/10.3390/math8101677
2. Arenas, A., et al.: A mathematical model for the spatiotemporal epidemic spreading
of covid19. MedRxiv (2020)
3. Baghersad, M., Zobel, C.W.: Assessing the extended impacts of supply chain dis-
ruptions on firms: an empirical study. Int. J. Prod. Econ. 231, 107862 (2021)
4. Capasso, V., Kunze, H.E., Torre, D.L., Vrscay, E.R.: Solving inverse problems for
biological models using the collage method for differential equations. J. Math. Biol.
67(1), 25–38 (2012)
5. Cooper, I., Mondal, A., Antonopoulos, C.G.: A SIR model assumption for the
spread of COVID-19 in different communities. Chaos, Solitons Fractals 139, 110057
(2020). https://doi.org/10.1016/j.chaos.2020.110057
6. World Health Organization: Coronavirus disease (COVID-19), H.i.i.t. (2020).
https://www.who.int/emergencies/diseases/novel-coronavirus-2019/question-
and-answers-hub/q-a-detail/coronavirus-disease-covid-19-how-is-it-transmitted.
Accessed 19 Mar 2020
7. Dolgui, A., Ivanov, D.: Exploring supply chain structural dynamics: new disruptive
technologies and disruption risks. Int. J. Prod. Econ. 229, 107886 (2020)
8. Gatto, M., Bertuzzo, E., Mari, L., Miccoli, S., Carraro, L., Casagrandi, R., Rinaldo,
A.: Spread and dynamics of the covid-19 epidemic in italy: Effects of emergency
containment measures. Proc. Nat. Acad. Sci. 117(19), 10484–10491 (2020)
9. Gersovitz, M., Hammer, J.S.: The economical control of infectious diseases*. Econ.
J. 114(492), 1–27 (2004)
10. Goenka, A., Liu, L., Nguyen, M.H.: Infectious diseases and economic growth. J.
Math. Econ. 50, 34–53 (2014)
11. Gounane, S., Barkouch, Y., Atlas, A., Bendahmane, M., Karami, F., Meskine, D.:
An adaptive social distancing SIR model for COVID-19 disease spreading and fore-
casting. Epidemiologic Methods, vol. 10, no. s1 (2021). https://doi.org/10.1515/
em-2020-0044
12. Ivanov, D.: Predicting the impacts of epidemic outbreaks on global supply chains: a
simulation-based analysis on the coronavirus outbreak (covid-19/sars-cov-2) case.
Transp. Res. Part E: Logistics Transp. Rev. 136, 101922 (2020)
13. Ivanov, D., Dolgui, A.: Viability of intertwined supply networks: extending the
supply chain resilience angles towards survivability. a position paper motivated by
COVID-19 outbreak. Int. J. Prod. Res 58(10), 2904–2915 (2020)
12 X. Brusset et al.
14. Ivanov, D., Sokolov, B., Chen, W., Dolgui, A., Werner, F., Potryasaev, S.: A control
approach to scheduling flexibly configurable jobs with dynamic structural-logical
constraints. IISE Trans. 53(1), 1–18 (2020)
15. Kinra, A., Ivanov, D., Das, A., Dolgui, A.: Ripple effect quantification by supplier
risk exposure assessment. Int. J. Prod. Res. 58(18), 5559–5578 (2020). https://doi.
org/10.1080/00207543.2019.1675919
16. Kinra, A., Ivanov, D., Das, A., Dolgui, A.: Ripple effect quantification by supplier
risk exposure assessment. Int. J. Prod. Res. 58(18), 5559–5578 (2020)
17. La Torre, D., Liuzzi, D., Marsiglio, S.: Pollution diffusion and abatement activities
across space and over time. Math. Soc. Sci. 78, 48–63 (2015)
18. La Torre, D., Liuzzi, D., Marsiglio, S.: Epidemics and macroeconomic outcomes:
Social distancing intensity and duration. J. Math. Econ. 93, 102473 (2021)
19. La Torre, D., Malik, T., Marsiglio, S.: Optimal control of prevention and treatment
in a basic macroeconomic-epidemiological model. Math. Soc. Sci. 108, 100–108
(2020)
20. Li, Y., Chen, K., Collignon, S., Ivanov, D.: Ripple effect in the supply chain net-
work: Forward and backward disruption propagation, network health and firm
vulnerability. European Journal of Operational Research (2020)
21. Oka, T., Wei, W., Zhu, D.: A spatial stochastic sir model for transmission networks
with application to covid-19 epidemic in china (2020)
22. Reich, J., Kinra, A., Kotzab, H., Brusset, X.: Strategic global supply chain network
design - how decision analysis combining MILP and AHP on a Pareto front can
improve decision-making. Int. J. Prod. Res. 0(0), 1–16 (2020)
23. Shayak, B., Sharma, M.M., Gaur, M., Mishra, A.K.: Impact of reproduction num-
ber on the multiwave spreading dynamics of COVID-19 with temporary immunity:
a mathematical model. Int. J. Infect. Dis. 104, 649–654 (2021). https://doi.org/
10.1016/j.ijid.2021.01.018
24. Wang, T.: Dynamics of an epidemic model with spatial diffusion. Phys. A: Stat.
Mech. Appl. 409, 119–129 (2014)
A Vector Logistic Dynamical Approach
to Epidemic Evolution on Interacting
Social-Contact and Production-Capacity
Graphs
Jan Bart Broekaert(B) and Davide La Torre
AI Institute for Business, SKEMA Business School, Sofia Antipolis, France

{jan.broekaert,davide.latorre}@skema.edu
https://www.skema.edu/faculty-and-research/artificial-intelligence
Abstract. Population inhomogeneity, in the variation of the individual

social contact networks and the individual infectious-recovery rates, ren-
ders the dynamics of infectious disease spreading uncertain. As a conse-
quence the overlaying economical production network with its proper col-
laboration components is to extent impacted unpredictably. Our model
proposes a vector logistic dynamical approach to SIS dynamics in a
social contact network interacting with its economic capacity network.
The probabilistic interpretation of the graph state in the vector logistic
description provides a method to assess the effect of mean and variance
of the infected on the production capacity and allows the strategic plan-
ning of social connectivity regulation. The impact of the epidemic mean
effects and fluctuations on the production capacity is assessed according
cumulative, majority and fragility proxy measures.
Keywords: SIS dynamics · Vector logistic equation · Social graph ·

Production capacity
1 Context and Rationale

Compartmental epidemic models, starting with Kermack and McKendrick [11]
and various elaborations reviewed by Hethcote [9], provide a simplified descrip-
tion of the epidemic evolution through transitions between a number of categories
in a population, mainly the Susceptible, Infected, and Receptive (‘Recovered’ or
‘Removed’) - and in further model extensions, the Exposed (latency of onset),
the Deceased (change of population size) and the Maternal (immunity protection
from birth), see e.g. [6]. The aspects of socio-spatial distribution of individuals -
in terms of inhomogeneity of both the infection-recovery rates and the connectiv-
ity of each individual , and the stochastic nature of transition events require an
extension of the basic compartmental approach. To encompass the effect of socio-
spatial structure of the population in the endemic progression, and to cover the
c IFIP International Federation for Information Processing 2021
Published by Springer Nature Switzerland AG 2021
A. Dolgui et al. (Eds.): APMS 2021, IFIP AICT 633, pp. 13–22, 2021.
https://doi.org/10.1007/978-3-030-85910-7_2
14 J. B. Broekaert and D. La Torre
resulting fluctuations, complex graph topologies have been implemented [10,16],

and reformulated as the bond percolation problem [14]. Specific graph topolo-
gies have been related to epidemic extinction time by Ganesh et al. [7] and the
resilience of epidemics related to the diameter of the underlying network (e.g.
in the network structures of Facebook, the Internet, Social networks) by Lu
et al. [12].
Non-deterministic epidemic models including the effects of fluctuations are
based on stochastic diffusion equations, by approximating the continuous time
Markov chain model [1], by matching as an epidemic model with multiple hosts
[13], or by parameter perturbation [8].
Instead, our model develops a description of the epidemic dynamics immedi-
ately at the level of intrinsic infection probability, similar to probabilistic Markov
or ‘quantum-like’ system descriptions, e.g. [3,5,18]. In our model we describe the
interaction of two networks: the social contact network, as the graph union of
all individual ‘ego’ contact networks, and the production capacity network as
the graph union of all production clusters. The nodes spanning both encompass-
ing networks, GA (V, EA ) and GB (V, EB ), are the individuals of the considered
population (filtered for professional activity in the production capacity graph).
We must take care to distinguish the concept of sub graphs - the connected
components which do not share any edge with other such components, either in
GA (V, EA ) or GB (V, EB ), and the interacting graphs which are (two) separate
implementations - or layers - of functional relations on the same population.
While the existence of connected components, or sub graphs, in the social contact
network GA (V, EA ) has an effect on the dynamics of infectious disease spreading,
and can be indirectly influenced by regulated restriction on the degree of social
connectivity, such an intervention is not applicable in the economic capacity
network. The connected components of the production capacity graph remain
fixed over time, since these components represent the economic capacity units of
individual businesses, enterprises or service systems. It has been shown that, for
interdependent networks failures in one network can percolate in another network
on which its optimal performance depends [4]. In this manner, the interaction
of the social graph with the production graph will allow an assessment of the
production capacity attrition and will allow an analysis for the possible planning
of regulatory intervention in the social contact network.
Finally as we have shortly mentioned earlier, in our approach each node of
the graph is characterised by its probability of being infected over time, instead
of attributing to each node a binary status of “infected” or “not-infected” at each
instance of time. The evolution of the node infection probabilities is determined
by the N-dimensional vector logistic equation. A similar probabilistic infection
approach on a graph was proposed by Wang et al. [17], but which applied a
Markov-like dynamics (idem, Eq. 13) instead. The usage of the vector logistic
equation allows i) to regain the limit of the classic scalar logistic equation for
SIS dynamics when the social graph nears the complete graph, GA (V, EA ) = KN
with large N , and ii) a probabilistic interpretation of the graph state vectors
of the nodes, Y, in the unit N -hypercube [0, 1]N . This approach hence allows
the expression of any infection related expectation quantity f t = Et (f ) =

i Yi (t)fi .
Vector Logistic SIS Dynamics on a Social and Production Graphs 15
2 Probabilistic SIS-dynamic on Social Contact Graphs

In the compartmentalised SIS-model the dynamics of the infected fraction i, is
determined by the recovery rate δ over the infected fraction, and the infection
rate β on the product of the susceptible, s, and infected, i, fractions:
i̇ = −δi + β(1 − i)i, (1)
where 1 − i(t) = s(t). Two stationary solutions can occur i∗1 = 0 and i∗2 = 1 − δ/β
(the latter when δ < β). In our model, the possible interaction between the
individuals - represented by nodes - is controlled by the adjacency matrix A
of the graph GA (V, EA ), |V | = N , EA ⊂ V 2 , representing the social contact
network. While the specific realisation of the adjacency matrix in the true social
contact network remains unknown, a number of parameters can be estimated
or assumed [2]. Some of its properties like the average degree can be regulated
as an optimisation parameter, e.g. corresponding with the restricted number of
contacts that are allowed in a personal ‘social bubble’ or ‘support circle’.
In order to retain a detailed description at the level of individual agents and to
assess fluctuations over the network, a probability based infection-recovery model
is constructed on a network. In this approach, a probability Yi of being infected
is attributed to each node i. Conform to the interaction effect by ‘contact’, we
express the exposure of a node i by the product of its proper receptive capacity
1 − Yi and the infective capacity Yj of an adjacent node j, i.e. Aij = 1, weighted
by infection rate βi and moderated by a normalisation factor of the inverse of
the node’s degree d−1i .

Ẏi = −δi Yi + βi d−1
i (1 − Yi ) Aij Yj (2)
j
The dynamical equation of the graph state vectors is written in vector nota-
tion by using δ both for the variable recovery rate vector and likewise β for
the variable infection rate vector and for the state vector Y. We further need
the Hadamard product symbol, ◦, to express the elementwise multiplication of
factors:
Ẏ = −δ ◦ Y + β(1 − Y) ◦ d−1 ◦ A Y (3)
this notation requires that for an isolated node the apparent division ‘0/0’ occur-
ring in AY/d is effectively set equal to 0.
This vector differential equation differs from (the linear form of) the gen-
eralized Lotka-Volterra equation by a term proportional to AY, and from the
Replicator equation by its additionally lacking a third order term Y ◦ (YT AY),
and having a first-order term in Y instead. Essentially the equation differs from
these two typical dynamical systems by the first order derivative of the state
not being a Hadamard product with the state itself. In order to attribute a
probabilistic interpretation to the magnitudes Yi , two observations are made,
– when Yi = 1, the component Yi decays over time at rate δi ,

– when Yi = 0, the component Yi grows at rate βi /di Ai − Y, which is non-
negative.
With an initial state 0 ≤ Y0 ≤ 1 at t = 0, the component values of Yt remain
contained in the [0, 1] range and hence can be considered as event probabilities
(for infection) assigned to the respective nodes of the graph G(V, E). The state
space of the vectors Y is the unit N-hypercube [0, 1]N , allowing each node an
infection probability between 0 and 1. We recall that in contrast, in the Repli-
cator
N system the corresponding state vector Y would remain on the simplex,
i=1 Yi = 1, see e.g. Ohtsuki et al. [15], and in the case of the generalized
N
Lotka-Volterra equation the solution is unconstrained Y ∈ R+ .
It can be easily shown that the vector logistic system reduces to the standard
compartmentalised SIS equation when the graph is complete G(V, E) = KN (all
nodes have grade N − 1), and the recovery and infection rates are considered
constant over the graph. With i = N1 j Yj and AY = N i − Y, where i =
i1, we recover the SIS equation, Eq. (1), after component-wise summation of
Eq. (2), and division by N .
Fig. 1. An illustrative epidemic evolution on a random social contact graph GA (V, EA )

with number of nodes N = 1000, number of initially infected nodes init inf ected = 20,
and average social connectivity N connect A = 40 (left) . The initial number of infected
nodes init inf ected = 10, the variable infection rate β = 0.6(SD0.2), and the variable
recovery rate δ = 0.55(SD0.2). During the confinement, the degree-inducing social
contacts parameter is reduced to N conf inement A = 20. The confinement period,
Δtconf , starts at time 300 and is held on for 300 time steps (right).
Finally, with the factor of the social contact graph included in the SIS dynamics,
Eq. (3), it is now possible to study the effect on the epidemic progression by
changes in the graph structure, see Fig. (2). In particular the effect of diminishing
the social person-person contacts by culling edges in G(V, E), see Fig. 2, while
maintaining the degree vector d, allows the dynamical description of confinement
efforts in diminishing the epidemic progression.
Concurrently the cost impact from production capacity attrition in the inter-
acting economic graph can be monitored. In the next section, Sect. 3, we
Fig. 2. An unconstrained artificial social contact graph (left) and its confinement rendi-
tion (right). In the unconstrained graph (N = 1000, skew = 4, N connect A = 40) the
mean degree is 25.82, the mean cluster coefficient is 0.28, and the graph has 4 connected
components. In the confined graph (N = 1000, skew = 4, N conf inement A = 20) the
mean degree has decreased to 8.04, with 88 connected components resulting.
define graph-based objective functions for economic capacity. In relation to the

social graph, a social cost can be defined proportional to the contact restric-
tions and the duration of the confinement, see Fig. 1, through the quantity
(Nconnect A − Nconf inement A )Δtconf . The epidemic health cost can be defined
proportional to total infection weight on the social graph at each instance of the
T
epidemic through the quantity |Y(t)|1 dt.
3 The Interacting Economic Capacity Network

In our present development of the interacting graphs model we build partially
sorted random graphs to resemble real-world configurations - both in social
connectivity and economic networks. In principle there is no restriction on
Fig. 3. Construction of the random economic capacity graph GB (V, EB ) (right) inter-
acting with the social contact graph GA (V, EA ), Fig. 2. The economic capacity network
inherits the nodes VA of the social contact graph (N = 1000), and is parametrized by
average connectivity parameter N connect B = 20 to obtain a number of economic
capacity units nB = 88 (left).
implementing another topology in either of the interacting graphs. Using the

partially sorted random implementation for the economic capacity graph, the
Laplace matrix associated to the adjacency matrix B of GB (V, EB ) is used to
identify the independent economic units, nB in number. The eigenvectors of the
Laplace matrix δB ◦ 1 − B with 0-eigenvalue correspond to the connected com-
ponents of the graph. With EB i the eigenvector of the i-th economic capacity
unit, a number of proxy measures for production capacity can be formulated.
At each instance of time, the epidemic evolution on the social contact graph
GA (V, EA ) provides the infected states of all individuals Y(t). Using a threshold
value θ in the range [0, 1] on the infection probability, the drop-out of active
individuals can be assessed at all moment of time. Then using the ceiling func-
tion; Yact (t) = |ceil(Y(t) < θ)|1 , is the number of healthy individuals. Similarly
to identify the active individuals of the i-th graph component in optimal situa-
tion (no drop-out), we define its binary vector WB i = ceil(EB i ). The epidemic
repercussions on each of the economic units can be assessed according the nature
of the dependence of the economic output on the active nodes in the economic
unit:
1. cumulative metrics
The drop-out of individuals on the i-th economic component can impact the
capacity of the unit proportionally:
ccum.i = Yact (t)T .WB i
The total cumulative
nB capacity of the full economic network GB (V, EB ) is given
by CcumB = i=1 ccum.i .
2. majority
The drop-out of individuals on the i-th economic component can impact the
integral capacity of the unit by majority support (or other tip-over value):

|Yact (t)T ◦ WB i |1
cmaj i = ceil ≥ .5
|WB i |1
The total majority
nB capacity of the full economic network GB (V, EB ) is given
by Cmaj B = i=1 cmaj. i .
3. fragility
The drop-out of each single individual of the i-th economic component impacts
the integral capacity of the unit:
|W |
cf rag i = Πj=1B i (Yact (t) ∩ WB i )j
where we select by intersection strictly the components corresponding to the
i-th economic component, and multiply each. The total fragile
nB capacity of the
full economic network GB (V, EB ) is given by Cf rag B = i=1 cf rag i .
With the objective functions for economic capacity defined, and a stan-
dard expression for social cost of confinement proportional to (Nconnect A −
T
Nconf inement A )Δtconf and a health cost proportional to |Y(t)|1 dt, an opti-
mization procedure based on parameters Nconf inement A and Δtconf can be devel-
oped.
4 Implementation and Simulation Results

A partially sorted random-based social contact graph was implemented to reflect
more realistic aspects of true person-person networks as reconstructed by e.g. Bar-
rett et al. [2]. In particular the adjacency matrix, A, of a graph on N = 1000 nodes
was designed and parametrized (skew, N connect A) to qualitatively approxi-
mate the degrees distribution, cluster coefficient distribution and template graph
distribution in the communities of Los Angeles, New York City and Seattle [2]. The
upper triangular matrix (diag = +1) of an ascending in-row sorted random N × N
matrix in the range [0, 1] was used to construct a symmetric matrix A sorted with
the max values in the upper triangle aligning the main 0-diagonal. Its unsorted
counterpart A base was retro-fitted by shuffling the row entries right of the main
diagonal and restoring symmetry by fitting the lower triangle with the transposed
upper triangle matrix. Clearly the sorted proto-adjacency matrix A sorted (still
with scalars in the range [0, 1]) amasses long linkage and fosters clique formation
along the diagonal. In order to tweak this architecture, a parameter skew was
used to gradually mix in the sorting effect on the random graph. Finally a degree-
indicative connectivity parameter, N connect A, was used to fix the threshold
(N − N connect A)/N for binary adjacency in A:
A f in = A sorted + (A base − A sorted)/skew
A = (A f in >= (N − N connect A)/N ) × 1
A number of parameter configurations where repeatedly tested to show for

N = 1000 that skew = 4 and N connect A = 40 lead to an average degree
of approximately 26 and an average cluster coefficient of .27 approximately,
and qualitatively approximates the degrees distribution and cluster coefficient
distribution of true social contact graphs [2]. The cluster coefficient distribution
can be easily obtained from the adjacency matrix. It is given by the number
of unique triangular walks from node νi over the number of contacts in the
A3 /2
neighbour sub-graph had it formed a clique: cc(νi ) = iidi . This sorting and
(2)
tweaking procedure to construct the artificial social contact network moreover
produces cycle and clique template graphs of low degrees. E.g., the particular
graph GA (V, EA ) in Fig. 2, counts 111216 of 3-cliques, and 1082464 of 4-cliques.
The number of 3-cycli is of course the same as the number 3-cliques, and the
number of 4-cycli is 4831030.
The node-based perspective of the SIS-dynamics was further deployed to
randomly attribute individual infection and recovery rates along a lognormal
distribution. In particular for the graph GA (V, EA ) in Fig. 2, with infection rate
β of mean log(0.6) and 0.2 standard deviation and, recovery rate δ of mean
log(0.55) and 0.2 standard deviation, see Fig. 5.
Another random document with
no related content on Scribd:
Coke 46 Silver, 644
standard
Clay 125 Tin 455
Earth, loose 95
By means of the foregoing table, the weight of any quantity of the
materials specified (in cubic feet) may readily be found.
MOTION, FORCES, &c.
Body is the mass or quantity of matter in any material substance,

and it is always proportional to its weight, or gravity, whatever its
figure may be.
Density is the proportional weight, or quantity of matter in any
body.
Velocity, or celerity, is an affection of motion by which a body
passes over a certain space in a certain time.
Momentum, or quantity of motion, is the power, or force, in moving
bodies.
Force is a power exerted on a body to move it, or to stop it. If the
force act constantly, it is a permanent force, like pressure, or the
force or gravity; but if it act instantaneously, or for an imperceptibly
short time, it is called impulse, or percussion, like the smart blow of a
hammer.
A motive, or moving force, is the power of an agent to produce
motion.
Accelerative, or retardative force, is that which affects the velocity
only, or it is that by which the velocity is accelerated, or retarded.
The change, or alteration of motion by any external force, is
always proportional to that force, and in the direction of the right line
in which it acts.
If a body be projected in free space, either parallel to the horizon,
or in an oblique direction, by the force of gunpowder, or any other
impulse: it will, by this motion, in conjunction with the action of
gravity, describe the curve line of a parabola.
A parabola is the section formed by cutting a cone, with a plane,
parallel to the side of the cone.
Gravity (vide page 316) is a force of such a nature that all bodies,
whether light or heavy, fall perpendicularly through equal spaces in
the same time, abstracting the resistance of the air; as lead, and a
feather, which, in an exhausted receiver, fall from the top to the
bottom in the same time. The velocities acquired by descending, are
in the exact proportion of the times of descent, and the spaces
descended are proportional to the squares of the times, and,
therefore, to the squares of the velocities. Hence, then, it follows that
the weights, or gravities of bodies near the surface of the earth are
proportional to the quantities of matter contained in them; and that
the spaces, times, and velocities generated by gravity, have the
relations contained in the three general proportions before laid down.
A body in the latitude of London falls nearly 16-1/12 feet in the first
second of time, and consequently, at the end of that time, it has
acquired a velocity double, or of 32⅙ feet.
The times being as the velocities, and the spaces as the squares
of either; therefore,
if the times be as the Nos.
1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
the velocities will also be as
1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
and the spaces as their squares
1, 4, 9, 16, 25, 36, 49, 64, 81, 100;
and the spaces for each time,
1, 3, 5, 7, 9, 11, 13, 15, 17, 19.
Namely, as the series of the odd numbers, which are the

differences of the squares denoting the whole spaces. So that if the
first series of natural numbers be seconds of time,
namely: the times in
1 2 3 4 &c.
seconds
the velocities in feet
32⅙ 64⅓ 96½ 128⅔, &c.
will be
the spaces in the 1
16 12 64⅓ 144¾ 257⅓, &c.
whole times
7
and the space for 1 5 112 12
16 12 48¼ 80 12 &c.
each second ,
of which spaces the common difference is 32⅙ feet, the natural and
obvious measure of the force of gravity.
Thus, a body falling from a state of rest acquires a velocity to pass
through 9 spaces in the fifth second of time; 7 in the fourth; 5 in the
third; 3 in the second; and 1 in the first. Thus it is 9 + 7 + 5 + 3 + 1 =
25, which shows that the whole spaces passed through in 5 seconds
equal the square of 5.
The momentum, or force, of a body falling through the atmosphere
is the mass or weight, multiplied by the square root of the height it
has fallen through, multiplied by 8·021.
Suppose a weight of 10 tons to be raised 9 feet, and to drop
thence suddenly on a bridge; the momentum is 10 × (3 × 8·021) =
240·63 tons. That is, a weight of 10 tons, so falling, would exert as
great a strain to break down the bridge, as the pressure of 240·63
tons of dead weight.
Thus, a one-ounce ball falling from a height of 400 feet, would
strike the earth with a momentum of
oz. feet. oz. lb.

1 × (20 × 8·021) = 160·42 = 10·026.
By experiments to ascertain the effect of Carnot’s vertical fire, it
1
was found that 4-oz. balls only penetrated 20 of an inch into deal
board, and from 2 to 3 inches into meadow ground.
Amplitude signifies the range of a projectile, or the right line upon
the ground, subtending the curvilinear path in which it moves.
The time of flight of different shot, and shells is equal to the time a
heavy body takes to descend freely from the highest point described
by the curve of the projectile.
To find the time of descent:

1
Divide the given height, or altitude, by 16 12 , and the square root of
the quotient will be the time required. Thus, if the altitude is 1200
feet, and the time of descent is required,
1
1200 ÷ 16 12 = 74·61, the square root of which is 8·637, the time
required.
When a body is projected vertically downwards with a given
velocity, the space described is equal to the time multiplied by the
velocity, together with the product of 16-1/12 by the square of the
time; but, if the body is projected upwards, the latter product must be
subtracted from the former.
PRACTICAL GEOMETRY.
DEFINITIONS.[55]
A line is perpendicular to another when it inclines not more on the

one side than on the other, the angles on both sides being equal.
Parallel lines are those which have no inclination to each other,
being everywhere equi-distant, however far produced, or extended.
An angle is the inclination, or opening of two lines, which meet in a
point called the vertex, or angular point: and the two lines are called
the legs, or sides of the angle.
The measure of an angle is estimated by the number of degrees
contained in the arc between its two legs.
A rectilinear angle has its legs or sides, right, or straight lines.
A curvilinear angle has its legs curves.
A right angle is formed by one line perpendicular to another; the
measure of which is an arc of 90°.
An acute angle is less than a right angle, or than 90°.
An obtuse angle is greater than a right angle.
An oblique angle may be either acute, or obtuse.
The circumference, or periphery of a circle is the curved line which
bounds it, being everywhere equally distant from the centre. The
circumference is supposed to be divided into 360 degrees (marked
thus °); each degree into 60 minutes, each minute (′) into 60 seconds
(″).
An arc is any part of the circumference of a circle.
A chord, or subtense, is a right line joining the extremities of an
arc.
The radius of a circle is a right line drawn from the centre to the
circumference.
The diameter of a circle is a right line drawn through the centre,
and terminated by the circumference.
A semicircle (180°) is that part of a circle which is contained
between the diameter, and half the circumference.
A quadrant is the fourth part of a circle, being contained between
two radii, and an arc of 90°.
A segment is that part of a circle which is cut off by a chord.
A sector is that part of a circle contained between two radii, and an
arc.
A secant is a line which cuts a circle, lying partly within, and partly
without it.
A tangent is a line which touches a circle, or curve, without cutting
it.
The point of contact is where a tangent touches an arc.
Triangles are figures having three sides, and three angles.
An equilateral triangle has its three sides equal.
An isosceles triangle has only two equal sides.
A scalene triangle has all its sides unequal.
A rectangular, or right-angled triangle has one of its angles a right
one, or 90°; and the square of the side opposite the right angle is
equal to the sum of the squares of the sides containing that angle;
hence a triangle, having its sides proportional to the numbers 3, 4, 5,
will be right-angled.
The hypothenuse is the side opposite the right angle in a
rectangular triangle.
An obtuse-angled triangle has one of its angles obtuse.
An acute-angled triangle has all its angles acute.
The three angles of any triangle, taken together, are equal to two
right angles, or 180°.
The difference of the squares of two sides of a triangle is equal to
the product of their sum and difference.
The sides of a triangle are proportional to the sines of their
opposite angles.
Quadrangles, or quadrilaterals, are plane figures bounded by four
right lines.
A square is a quadrilateral having all its sides equal, and all its
angles right angles. The diagonal of a square is equal to the square
root of twice the square of its sides: and the side of the square is
equal to the square root of half the square of its diagonal.
The diagonal is a right line drawn across a quadrilateral figure,
from one angle to another. The sum of the squares of the two
diagonals of every parallelogram is equal to the sum of the squares
of the four sides.
A parallelogram is a quadrilateral, whose opposite sides are
parallel.
A rectangle is a parallelogram having four right angles.
A rhomboid is an oblique-angled parallelogram.
A rhombus, or lozenge, is a quadrilateral, whose sides are all
equal but its angles oblique.
A trapezium is a quadrilateral, which has none of its sides parallel
to each other.
A trapezoid is a quadrilateral, which has only two of its sides
parallel.
Polygons are plane figures bounded by more than four sides.
A regular polygon has all its sides, and angles equal.
The perimeter of a figure is the sum of all its sides.
To bisect—is to divide into two equal parts.
To trisect—is to divide into three equal parts.
To inscribe—is to draw one figure within another, so that all the
angles of the inner figure touch either the angles, sides, or planes of
the external figure.
To circumscribe—is to draw a figure round another, so that either
the angles, sides, or planes of the circumscribing figure touch all the
angles of the figure within it.
LINES, ANGLES, AND FIGURES.
To divide a given right line into two equal parts.

From the extremities of the line as centres, and with any opening
in the compasses, greater than half the given line, as a radius,
describe arcs intersecting each other above, and below the given
line. A line being drawn through these intersections will divide the
given line into two equal parts.
An arc of a circle is bisected in the same manner.
To bisect an angle.
From the angular point, measure equal distances on the two lines
(forming the angle), and from these points, with the same distance
as radius, describe arcs intersecting each other. A line drawn from
their intersections to the angular point will bisect the angle.
To erect a perpendicular.
From the point a set off any length 4 times to c; from a as a centre
with 3 of those parts describe an arc at b, and from c with 5 of them
cut the arc at b. Draw a b, which will be the perpendicular required.
Any equimultiples of these numbers, 3, 4, 5, may be used for
erecting a perpendicular. Plate 2, Heights and Distances, and
Practical Geometry, Fig. ½.
To erect a perpendicular.
Set off on each side of the point a, any two equal distances, a d, a
e. From d and e as centres, and with any radius greater than half d
e, describe two arcs intersecting each other in f. Through a, and f
draw the line a f, and it will be the perpendicular required.
Fig. 1.—Plate, Practical Geometry.
To let fall a perpendicular.

From d as a centre, and with any radius, describe an arc
intersecting the given line. From the points of intersection c, and e,
with any radius greater than half, describe two arcs, cutting each
other at f. Through d, and f draw a line, and d f will be the
perpendicular required. Fig. 2.
To draw a line parallel to a given line.

From any point d in the given line with the radius d c, describe the
arc c e, and from c with the same radius describe the arc d f. Take e
c, and set it off from d to f. Through c, and f draw c f for the parallel
required. Fig. 3.
To divide an angle into two equal parts.

From b as a centre with any radius describe an arc a c. From a,
and c with any radius describe arcs intersecting each other in d.
Then draw b d, and it will bisect the angle. Fig. 4.
PRACTICAL GEOMETRY.
Fig. 1-9.
Fig. 10-14.
To divide a right angle into three equal parts.
From b as a centre with any radius describe the arc a c. From a
with the radius a b cut the arc a c in d, and with the same radius
from c cut it in e. Then through the intersections d, and e draw the
lines b d, b e, and they will trisect, or divide the angle into three
equal parts. Fig. 5.
To find the centre of a circle.

Draw any chord a b, and bisect it by the perpendicular c d. Divide
c d into two equal parts, and the point of bisection o will be the
centre required. Fig. 6.
To describe an equilateral triangle.

From the points a, b, as centres, and with a b as radius, describe
arcs intersecting each other in c. Draw c a, c b, and the figure a b c
will be the triangle required. Fig. 7.
To describe a square.
From the point b, draw b c perpendicular, and equal to a b. On a,
and c, with the radius a b, describe arcs cutting each other in d.
Draw the lines d a, d c, and the figure a b c d will be the square
required. Fig. 8.
To inscribe a square in a circle.

Draw the diameters a b, c d perpendicular to each other. Then
draw the lines a d, a c, b d, b c; and a b c d will be the square
required. Fig. 9.
To inscribe an octagon in a circle.

Bisect any two arcs a c, b c of the square a b c d in g, and e.
Through the points g, and e, and the centre o draw lines, which
produce to f, and h. Join a f, f d, d h, &c. and they will form the
octagon required. Fig. 9.
On a line to describe all the several polygons, from the hexagon to
the dodecagon.
Bisect a b by the perpendicular c d. From a as a centre, and with
a b as a radius, describe the arc b e, which divide into six equal
parts; and from e as a centre describe the arcs 5 f, 4 g, 3 h, &c.
Then from the intersection e as a centre, and with e a as a radius,
describe the circle a i d b, which will contain a b six times. From f in
like manner as a centre, and with f a as radius, describe the circle a
k l b, which will contain a b seven times; and so on for the other
polygons. Fig. 10.
To inscribe in a circle an equilateral triangle.

From any point d in the circumference as a centre, and with the
radius d o of the given circle, describe an arc a o b cutting the
circumference in a, and b. Through d, and o draw d c. Then, join a
b, a c, b c; and the figure a b c will be the triangle required. Fig. 11.
To inscribe a hexagon in a circle.

Bisect the arcs a c, b c in e, and f, and join a d, d b, b f, &c.,
which will form the hexagon. Or carry the radius six times round the
circumference, and the hexagon will be obtained. Fig. 11.
To inscribe a dodecagon in a circle.

Bisect the arc a d of the hexagon in g, and a g being carried
twelve times round the circumference, will form the dodecagon. Fig.
11.
To inscribe a pentagon, hexagon, or decagon, in a circle.

Draw the diameter a b, and make the radius d c perpendicular to a
b. Bisect d b in e. From e as a centre, and with e c as radius,
describe an arc cutting a d in f. Join c f, which will be the side of the
pentagon, c d that of the hexagon, and d f that of the decagon. Fig.
12.
To find the angles at the centre, and circumference of a regular
polygon.
Divide 360 by the number of the sides of the given polygon, and
the quotient will be the angle at the centre; and this angle being
subtracted from 180, the difference will be the angle, at the
circumference, required.
Table, showing the angles at the centre, and circumference.
Names. No. of Angles Angles at

sides. at centre. circumference.
Trigon 3 120° 60°
Tetragon 4 90° 90°
Pentagon 5 72° 108°
Hexagon 6 60° 120°
Heptagon 7 51° 25 5′7 128° 34 2′7
Octagon 8 45° 135°
Nonagon 9 40° 140°
Decagon 10 36° 144°
To inscribe any regular polygon in a circle.

From the centre c draw the radii c a, c b, making an angle equal
to that at the centre of the proposed polygon, as contained in the
preceding table. Then the distance a b will be one side of the
polygon, which, being carried round the circumference the proper
number of times, will complete the polygon required. Fig. 13.
Fig. 15-20.
To circumscribe a circle about a triangle.

Bisect any two of the given sides, a b, b c by the perpendiculars e
f, d f. From the intersection f as a centre, and with the distance of
any of the angles, as a radius, describe the circle required. Fig. 14.
To circumscribe a circle about a square.

Draw the two diagonals a c, b d intersecting each other in o. From
o as a centre, and with o a, or o b, as a radius, describe the required
circle. Fig. 15.
To circumscribe a square about a circle.

Draw the two diameters a b, c d perpendicular to each other,
through the points a, c, b, d, draw the tangents e f, e g, g h, f h,
and e g h f will be the square required. Fig. 16.
To reduce a map, or plan, from one scale to another.

Divide the given figure a c by cross lines, forming as many
squares as may be thought necessary. Draw a line e f, on which set
off as many parts from the scale m, as a b contains parts of the scale
n. Draw e h, and f g perpendicular to e f, and each equal to the
proportional parts contained in a d, or b c. Join h g, and divide the
figure e g into the same number of squares as the original a c.
Describe in every square what is contained in the corresponding
square of the given figure; and e f g h will be the reduced plan
required. The same operation will serve either to reduce, or enlarge
any map, plan, drawing, or painting. Fig. 17.
MENSURATION OF PLANES, AND SOLIDS.
Mensuration is of three kinds, viz., lineal, superficial, and solid.

Lineal measure has reference to length only.
Superficial measure (or the surface) includes length, and breadth.
Solid measure (or the content) comprehends length, breadth, and
thickness.
MENSURATION OF PLANES.
The area of any plane figure is the superficial measure contained

within its extremes, or bounds. This area is estimated by the number
of small squares that may be contained in it, the side of these
measuring squares being an inch, a foot, or any other fixed quantity,
and hence the area is said to be so many square inches, square
feet, &c. Vide Table, Square measure. Page 275.
To find the area of a parallelogram, whether a square, rectangle, &c.

Multiply the length by the breadth, or perpendicular height, for the
area required.
Example.—Required the area of a rectangle, whose length is 9
feet, and breadth 4 feet.
9 × 4 = 36 feet. The required area, or surface.
To find the area of a triangle, its base, and perpendicular height

being given.
Multiply the base by the perpendicular height, and half the product
will be the area.
Example.—Required the number of square yards contained in a
triangle, whose base is 20 yards, and perpendicular height 14 yards.
20 × 14
2
= 140 square yards. Area required.
To find the area of a triangle, whose three sides are given.

From half the sum of the three sides, subtract each side severally;
multiply the half sum, and the three remainders together, and the
square root of the product will be the area required.
Example.—Required the area of a triangle, whose sides are 50,
40, and 30 feet.
50 + 40 + 30
2
= 60, half the sum of the three sides.
60 - 30 = 30 First difference.
60 - 40 = 20 Second difference.
60 - 50 = 10 Third difference.
30 × 20 × 10 × 60 = 360000.
Square root of 360000 = 600. Area required.
Two sides of a right-angled triangle being given, to find the third side.
1. When the two sides forming the right angle are given, to find the
hypothenuse, or side opposite the right angle.
Take the square root of the sum of the two sides squared for the
side required.
Example.—Required the length of the interior slope of a rampart,
whose perpendicular height is 17 feet, and the base of the slope 20
feet.
17 × 17 = 289
20 × 20 = 400
The square root of 689 = 26·24. The length required.
2. When the hypothenuse, and one of the perpendicular sides are
given.
From the square of the hypothenuse, subtract the square of the
given side, and the square root of the remainder will be the side
required.
Example.—The hypothenuse being 5 yards, and the base 4 yards,
required the other side.
5 × 5 = 25
4 × 4 = 16
The square root of 9 = 3 yards. The side required.
To find the area of a trapezium, A B C D.

Draw the diagonal a c, upon which let fall from its opposite angles
b, and d, the perpendiculars b f, d e. Find by measurement the
diagonal a c, and the perpendiculars b f, d e, then multiply the sum
of the perpendiculars by the diagonal, and half the product will be the
area of the trapezium. Fig. 18.
Example.—Required the area of the trapezium, whose diagonal a
c is 100 feet, and perpendiculars b f 30 feet, and d e 40 feet.
(30 + 40) × 100
2
= 3500 square feet. Area required.
Or, divide the trapezium into two triangles by a diagonal, then find
the areas of these triangles, and add them together.
To find the area of a trapezoid, A B C D.

Multiply the sum of the parallel sides a b, d c by the perpendicular
distance e c, and half the product will be the area. Fig. 19.
Example.—Required the area of the trapezoid a b c d, of which
the parallel sides a b, d c are 120 feet, and 90 feet, and the
perpendicular distance e c 40 feet.
(120 + 90) × 40
2
= 4200 square feet. Area required.
To find the area of an irregular figure, or polygon.

Draw diagonals dividing the figure into trapeziums, and triangles;
then, having found the area of each, add them together, and the sum
will be the area required.
To find the area of a figure, having a part bounded by a curve.

Draw a right line joining the extremities of the curve, then find the
area of the trapezium. On the right line let fall as many
perpendiculars as the several windings of the curve may require.
Find their lengths, and divide their sum by the number of
perpendiculars, and the quotient will be the mean breadth; which
being multiplied by the length of the right line, will give the area of
the curved part. This area being added to that of the trapezium will
give the area of the required figure.
To measure long irregular figures.

Measure the breadth at both ends, and at several places at equal
distances. Add together all these intermediate breadths, and half the
two extremes, which sum multiply by the length, and divide by the
number of parts for the area. If the perpendiculars, or breadths, be
not at equal distances, compute all the parts separately, as so many
trapezoids, and add them all together for the whole area.
Example.—The breadths of an irregular figure at five equi-distant
places being 8, 2, 7, 9, 4, and the whole length 40, required the area.
8 + 4 = 12 12 ÷ 2 = 6
6 + 2 + 7 + 9 = 24
24 × 40
4
= 240. Area required.
To find the number of square acres in any of the preceding figures.

[56]
Divide the superficial content in feet by 43560, and the quotient

will be the number required.
To bring square chains to acres.

Of square chains strike off two decimal places to the right, and the
rest of the figures will be acres.
To bring square links to acres.

Of square links cut off five of the figures on the right hand, for
decimals, and the rest will be acres; then multiply these decimals by
4, for roods, cutting off five figures as before; and the decimals of
these again by 40, for perches, when five figures are again to be
struck off.
To find the area of a regular polygon.

Multiply the perimeter (or sum of the sides) of the polygon by the
perpendicular drawn from its centre on one of its sides, and take half
the product for the area.

Download full ebook of Advances In Production Management Systems Artificial Intelligence For Sustainable And Resilient Production Systems Ifip Wg 5 7 International Conference Apms 2021 Nantes France September 5 9 2021 Proce online pdf all chapter docx

Uploaded by

Copyright:

Available Formats

You might also like

Download full ebook of Advances In Production Management Systems Artificial Intelligence For Sustainable And Resilient Production Systems Ifip Wg 5 7 International Conference Apms 2021 Nantes France September 5 9 2021 Proce online pdf all chapter docx

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Download full ebook of Advances In Production Management Systems Artificial Intelligence For Sustainable And Resilient Production Systems Ifip Wg 5 7 International Conference Apms 2021 Nantes France September 5 9 2021 Proce online pdf all chapter docx

Uploaded by

Copyright:

Available Formats

Advances in Production Management

Systems Artificial Intelligence for

Advances in Production Management Systems Artificial

Proceedings of 2nd International Conference on

Flexible Query Answering Systems 14th International

Progress in Artificial Intelligence 20th EPIA

Document Analysis and Recognition ICDAR 2021 16th

Electronic Government 21st IFIP WG 8 5 International

Computer Vision Systems 13th International Conference

Machine Learning and Knowledge Extraction 5th IFIP TC 5

IFIP WG 5.7 International Conference, APMS 2021

Kai Rannenberg, Goethe University Frankfurt, Germany

Editorial Board Members

IFIP is a non-proﬁt-making organization, run almost solely by 2500 volunteers. It

More information about this series at http://www.springer.com/series/6102

David Lemoine Gregor von Cieminski

David Romero (Eds.)

ISSN 1868-4238 ISSN 1868-422X (electronic)

© IFIP International Federation for Information Processing 2021

September 2021 Alexandre Dolgui

Conference Honorary Co-chairs

International Advisory Committee

Organizing Committee Chair

Organizing Committee Co-chair

Doctoral Workshop Chairs

Award Committee Chairs

Sang Do Noh Sungkyunkwan University, South Korea

Thomas R. Kurfess Georgia Institute of Technology, USA

Rahul Rai University at Buffalo, USA

Agostino Villa Politecnico di Torino, Italy

Abbou Rosa Batocchio Antonio

Calarge Felipe Dolgui Alexandre

Grangeon Nathalie Jones Al

Lee Seokcheon Marques Melissa

Nogueira Sara Roser Christoph

Taisch Marco Wang Yingli

AI for Resilience in Global Supply Chain Networks in the Context

Modelling COVID-19 Ripple Effect and Global Supply Chain Productivity

A Vector Logistic Dynamical Approach to Epidemic Evolution

Modeling Shock Propagation on Supply Chain Networks:

Towards Explainable Artificial Intelligence (XAI) in Supply Chain

Distribution of Vaccines During a Pandemic (Covid-19) . . . . . . . . . . . . . . . 39

Blockchain in the Operations and Supply Chain Management

Blockchain-Based Master Data Management in Supply Chains:

Blockchain for Product Authenticity in the Cannabis Supply Chain . . . . . . . . 62

A Blockchain-Based Manufacturing Service Composition Architecture

An Approach for Creating a Blockchain Platform for Labeling

Blockchain Design for Digital Supply Chain Integration . . . . . . . . . . . . . . . 90

Data-Based Services as Key Enablers for Smart Products,

Customer Order Scheduling in an Additive Manufacturing Environment . . . . 101

A Conceptual Reference Model for Smart Factory Production Data . . . . . . . . 110

Generating Synthetic Training Data for Assembly Processes . . . . . . . . . . . . . 119

Data Acquisition for Energy Efficient Manufacturing: A Systematic

Review of Factors Influencing Product-Service System Requirements

Data-Driven Methods for Supply Chain Optimization

Data-Driven Solutions for the Newsvendor Problem: A Systematic

An Information Sharing Framework for Supply Chain Networks:

A Robust Data Driven Approach to Supply Planning. . . . . . . . . . . . . . . . . . 169

Responsible Manufacturing with Information Disclosure Under