Complexity Theory

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Aim and Objectives
1.2 Description of the Ward
1.3 Automated Scheduler Components
1.4 Problem Formulation
1.4.1 Daily Scheduling Problem
1.4.2 Rescheduling Problem
1.5 Limitations
1.6 Input Parameters
2 Theory 
2.1 Complexity Theory
2.2 Approximative Solutions
2.2.1 Heuristics
2.3 Scheduling Problems for Advanced Health Care at Home
3 Method 
3.1 Testing
4 Results 
4.1 Proof of NP-completeness
4.1.1 Daily Scheduling Problem 2 NP
4.1.2 Daily Scheduling Problem is NP-hard
4.1.3 Daily Scheduling Problem is NP-complete
4.1.4 Rescheduling Problem is NP-complete
4.2 Modeling Data
4.3 Algorithm
4.3.1 Initial Solution of the Daily Scheduling Problem
4.3.2 Mathematical Functions
4.3.3 Local Search Algorithm of the Daily Scheduling Problem
4.3.4 Rescheduling Algorithm
4.4 Evaluation of Algorithms
4.4.1 Complexity
4.4.2 Solution’s Distance from the Optimal Solution
4.5 Testing
4.6 Presentation at the Ward
5 Discussion 
5.1 Improving the Algorithms
5.2 Testing Method
5.3 Condentiality
5.4 Usefulness of the Automated Scheduler
5.5 Risks and Vulnerabilities
6 Conclusion