Repository navigation
Expand file tree
/
Copy pathsim_Job_Sequencing.cpp
More file actions
65 lines (53 loc) · 1.93 KB
/
Copy pathsim_Job_Sequencing.cpp
File metadata and controls
65 lines (53 loc) · 1.93 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
struct Job {
int id;
int processingTime;
int waitingTime;
int turnaroundTime;
Job(int id, int processingTime)
: id(id), processingTime(processingTime), waitingTime(0), turnaroundTime(0) {}
};
bool compareProcessingTime(const Job& a, const Job& b) {
return a.processingTime < b.processingTime;
}
void processJobs(std::vector<Job>& jobs) {
int currentTime = 0;
for (Job& job : jobs) {
job.waitingTime = currentTime;
currentTime += job.processingTime;
job.turnaroundTime = currentTime;
}
}
int main() {
int n = 6; // Number of jobs
int m = 3; // Number of machines
std::vector<Job> jobs = {
Job(1, 15),
Job(2, 5),
Job(3, 25),
Job(4, 12),
Job(5, 30),
Job(6, 10),
};
// Sort jobs based on processing time using the SJF rule
std::sort(jobs.begin(), jobs.end(), compareProcessingTime);
// Process the jobs
processJobs(jobs);
// Calculate the average waiting time and average turnaround time
double avgWaitingTime = std::accumulate(jobs.begin(), jobs.end(), 0.0,
[](double sum, const Job& job) { return sum + job.waitingTime; }) / n;
double avgTurnaroundTime = std::accumulate(jobs.begin(), jobs.end(), 0.0,
[](double sum, const Job& job) { return sum + job.turnaroundTime; }) / n;
// Display the results
std::cout << "Job\tProcessing Time\tWaiting Time\tTurnaround Time" << std::endl;
for (const Job& job : jobs) {
std::cout << job.id << "\t" << job.processingTime << "\t\t" << job.waitingTime
<< "\t\t" << job.turnaroundTime << std::endl;
}
std::cout << "Average waiting time: " << avgWaitingTime << std::endl;
std::cout << "Average turnaround time: " << avgTurnaroundTime << std::endl;
return 0;
}