Performance Evaluation Models for Distributed Service Networks (Studies in Systems, Decision and Control, 343)

✍ Scribed by Grzegorz Bocewicz (editor), Jarosław Pempera (editor), Victor Toporkov (editor)

• Publisher: Springer
• Year: 2021
• Tongue: English
• Leaves: 195
• Category: Library

✦ Synopsis

This book presents novel approaches to formulate, analyze, and solve problems in the area of distributed service networks, notably based on AI-related methods (parallel/cloud computing, declarative modeling, fuzzy methods). Distributed service networks are an important area of research and applications. The methods presented are meant to integrate both emerging and existing concepts and approaches for different types of production flows through synchronizations. An integration of logistics services (e.g., supply chains and projects portfolios), public and multimodal transport, traffic flow congestion management in ad hoc networks, design of high-performance cloud data centers, and milk-run distribution networks are shown as illustrations for the methods proposed. The book is of interest to researchers and practitioners in computer science, operations management, production control, and related fields.

✦ Table of Contents

Preface
Contents
Editors and Contributors
Parallel Computing for the Non-permutation Flow Shop Scheduling Problem with Time Couplings Using Floyd-Warshall Algorithm
1 Introduction
2 Problem Formulation
3 Graph Representation
4 Problem Properties
5 Discussion
6 Conclusions
References
Parallel Neighborhood Search for the Permutation Flow Shop Scheduling Problem
1 Introduction
2 Permutation Flowshop Problem
3 Adjacent Pair Interchange Neighborhood
4 Insert Neighborhood
5 Non-adjacent Pair Interchange Neighborhood
6 Conclusions
References
Distributed Manufacturing as a Scheduling Problem
1 Introduction
2 Mathematical Model
3 Application of the Graph
4 Optimization Algorithm
5 Experimental Results
6 Conclusions
References
Rerouting and Rescheduling of In-Plant Milk Run Based Delivery Subject to Supply Reconfigurability Constraints
1 Introduction
2 Related Work
3 Motivating Example
4 Declarative Model
4.1 Assumptions
4.2 Model
4.3 Sufficient Conditions
4.4 Constraint Satisfaction Approach
5 Experiments
6 Conclusions
References
Micro-Scheduling for Dependable Resources Allocation
1 Introduction
2 Related Works
2.1 Resources Selection Algorithms and Approaches
2.2 Job-Flow Scheduling and Backfilling
3 General Resource Co-allocation Algorithm
3.1 Problem Statement
3.2 Window Search Procedure
3.3 Optimal Slot Subset Allocation
4 Dependable Job Placement
4.1 Job Placement Problem
4.2 Simulation Environment Setup
4.3 Analysis of Dependable Resources Allocation
5 Micro-Scheduling and Coordinated Resources Allocation
5.1 Micro-Scheduling in Resources Allocation
5.2 Coordinated Placement Algorithms
5.3 Simulation Results
6 Advanced Simulation and Hindsight Job-Flow Scheduling
6.1 Hindsight Scheduling
6.2 Simulation Setup and Analysis
7 Preference-Based Resources Coordination
7.1 Preference-Based Criteria Design
7.2 Preference-Based Scheduling Algorithms and Analysis
8 Conclusion and Future Work
References
Cyclic Dynamic Evaluation of Logistics Services Stakeholders Based on System with OFN Model
1 Introduction
2 Background
2.1 Stakeholders of a Logistics Service
2.2 The Concept of Ordered Fuzzy Numbers
3 Proposed Method of Dynamic Evaluation of Logistics Services Stakeholders
3.1 Problem Statement
3.2 Dedicated System with OFN Model
3.3 Ordered Fuzzy Inference Mechanism
4 Dynamic Evaluation Based on OFN Inference Mechanism with Simple Ordered Fuzzy Rule—A Case Study
5 Dynamic Evaluation Based on OFN Inference Mechanism with Complex Ordered Fuzzy Rule—A Case Study
6 Knowledge Base for Dynamic Evaluation of Logistics Services Stakeholders—A Case Study
7 Conclusions
References
The Interleaved Memory Efficiency for Multithread Memory Calls Processing
1 Introduction
2 Problem Statement
3 Mean Number of Occupied MBK per Memory Access Cycle
4 The Standard Deviation of the Number of Occupied MBK per Memory Access Cycle
4.1 The Number of Threads Is 2
4.2 Number of Threads Is 3
4.3 Number of Threads Is 4
5 Conclusions
References
On HPC and Cloud Environments Integration
1 Introduction
2 Problem Description
3 Proposed Solution
4 MC2E Architecture: Federates
4.1 Related Works
4.2 Problem Description
4.3 Experiments
4.4 Execution Specifics in HPC-C and in HPC-S Environment
5 MC2E Architecture: CoD Service
5.1 Route Aggregation
5.2 Flow Distribution
5.3 The CoD Service Problem in Linear Programming Form
6 MC2E Architecture: Heterogeneous Platform
6.1 Meta-Cloud
6.2 Interface
6.3 Networking
6.4 Monitoring
6.5 Quality of Service, Administration Control and Management
7 Future Works
7.1 Basic Notions
7.2 Task Execution Time Estimating
7.3 Permutation Problem
7.4 Reassessing Task Execution Time
8 Conclusion
References
Index