-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJobScheduling1.cpp
More file actions
153 lines (143 loc) · 3.9 KB
/
JobScheduling1.cpp
File metadata and controls
153 lines (143 loc) · 3.9 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include<bits/stdc++.h>
using namespace std;
int profit[100],deadline[100],position[100],job[100];
int solution_asign[100],selected_job[100],selected_Deadline[100],selected_profit[100];
int solution_vector[100];
int Job_Scheduling(int n)
{
/// Using for Swapping
for(int i=1;i<n;i++)
{
int mx = i;
for(int j=i+1;j<=n;j++)
{
if(profit[j]>profit[mx])
mx = j;
}
swap(profit[i],profit[mx]);
swap(deadline[i],deadline[mx]);
swap(position[i],position[mx]);
}
int k=0;
for(int i=1;i<=n;i++)
{
if(job[deadline[i]]==0)
{
k++;
job[deadline[i]] = i;
solution_asign[k]=deadline[i];
selected_job[k] = position[i];
selected_Deadline[k] = deadline[i];
selected_profit[k] = profit[i];
solution_vector[position[i]]=1;
}
else
{
for(int j=deadline[i];j>=1;j--)
{
if(job[j] == 0)
{
k++;
job[j]=i;
solution_asign[k]=j;
selected_job[k] = position[i];
selected_Deadline[k] = deadline[i];
selected_profit[k] = profit[i];
solution_vector[position[i]]=1;
break;
}
}
}
}
return k;
}
int main()
{
freopen("in.txt","r",stdin);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>profit[i];
cin>>deadline[i];
position[i] = i;
}
cout<<"Index Number : ";
for(int i=1;i<=n;i++)
cout<<position[i]<<" ";
cout<<endl;
cout<<"Given Profit : ";
for(int i=1;i<=n;i++)
cout<<profit[i]<<" ";
cout<<endl;
cout<<"Given Deadline : ";
for(int i=1;i<=n;i++)
cout<<deadline[i]<<" ";
cout<<endl;
int ans = Job_Scheduling(n);
cout<<endl;
cout<<"After Sorting"<<endl;
cout<<"Index Number : ";
for(int i=1;i<=n;i++)
cout<<position[i]<<" ";
cout<<endl;
cout<<"Sorted Profit : ";
for(int i=1;i<=n;i++)
cout<<profit[i]<<" ";
cout<<endl;
cout<<"Sorted Deadline: ";
for(int i=1;i<=n;i++)
cout<<deadline[i]<<" ";
cout<<endl;
cout<<endl;
cout<<"Selected Profit Position (Order by Selected Job): ";
for(int i=1;i<=ans;i++)
cout<<job[i]<<" ";
cout<<endl;
cout<<"Selected Profit Position (Order by Given Index) : ";
for(int i=1;i<=ans;i++)
cout<<position[job[i]]<<" ";
cout<<endl;
cout<<endl;
int total_profit = 0;
cout<<"Selected Best Profit : ";
for(int i=1;i<=ans;i++)
{
cout<<profit[job[i]]<<" ";
total_profit+=profit[job[i]];
}
cout<<endl<<"Total Profit is : "<<total_profit<<endl;
cout<<endl;
cout<<"Solution Vector : ";
for(int i=1;i<=n;i++)
cout<<solution_vector[i]<<" ";
cout<<endl;
cout<<endl;
/// Display Job Scheduling Table
total_profit = 0;
cout<<"Job Considers \t Deadline Slot Assign \t\t\t\tSolution Profit"<<endl;
for(int i=1;i<=ans;i++)
{
cout<<"\tA"<<selected_job[i]<<"\t";
cout<<" "<<selected_Deadline[i]<<"\t ";
for(int j = 1;j<=i;j++)
{
int tmp = solution_asign[j];
cout<<"["<<tmp-1<<","<<tmp<<"] , ";
}
cout<<"\t";
for(int j=1;j<=ans-i;j++)
cout<<"\t";
for(int j = 1;j<=i;j++)
{
int tmp = selected_job[j];
cout<<"A"<<tmp<<", ";
}
//cout<<"\t";
for(int j=1;j<=ans-i;j++)
cout<<" ";
total_profit+=selected_profit[i];
cout<<total_profit<<endl;
}
return 0;
}