Job Sequencing With Deadlines

-

 

#include<stdio.h>

#define MAX 100

 

typedef struct {

    int id, profit, deadline;

} Job;

 

void sortJobs(Job jobs[], int n) {

    for (int i = 0; i < n - 1; i++)

        for (int j = 0; j < n - i - 1; j++)

            if (jobs[j].profit < jobs[j + 1].profit) {

                Job temp = jobs[j];

                jobs[j] = jobs[j + 1];

                jobs[j + 1] = temp;

            }

}

void jobSequencing(Job jobs[], int n) {

    int slot[MAX] = {0}, profit = 0;

 

    sortJobs(jobs, n);

 

    printf("The sequence of jobs is: ");

    for (int i = 0; i < n; i++) {

        for (int j = jobs[i].deadline; j > 0; j--) {

            if (!slot[j]) {

                slot[j] = 1;

                profit += jobs[i].profit;

               printf("J%d ", jobs[i].id);

                break;

            }

        }

    }

    printf("\nProfit is %d\n", profit);

}

 

int main() {

    int n;

    Job jobs[MAX];

 

    printf("Enter the number of jobs: ");

    scanf("%d", &n);

    for (int i = 0; i < n; i++) {

        printf("Enter Job ID, profit, and deadline for job %d: ", i + 1);

        scanf("%d %d %d", &jobs[i].id, &jobs[i].profit, &jobs[i].deadline);

    }

 

    jobSequencing(jobs, n);

    return 0;

}

Comments

Post a Comment

Popular posts from this blog

AVL Trees

-
#include <stdio.h> #include <stdlib.h> // Structure to represent a node in the AVL tree struct Node {     int key;     struct Node* left;     struct Node* right;     int height; }; // Function to get the height of the node int height(struct Node* N) {     if (N == NULL)         return 0;     return N->height; } // Function to get the maximum of two integers int max(int a, int b) {     return (a > b) ? a : b; } // Helper function that allocates a new node with the given key struct Node* newNode(int key) {     struct Node* node = (struct Node*)malloc(sizeof(struct Node));     node->key = key;     node->left = NULL;     node->right = NULL;     node->height = 1; // New node is initially added at leaf     return(node); } // Right rotate subtree rooted with y struct Node* rightRotate(struct Node* y) {     ...
Read more

BFS Matrix

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 int adj[MAX][MAX];   int state[MAX];      int queue[MAX], front = -1, rear = -1;  void create_graph(int n, int gtype); void BF_Traversal(int n); void BFS(int v, int n); void insert_queue(int vertex); int delete_queue(); int isEmpty_queue(); int main() {     int n, gtype;          printf("Enter 1 for undirected graph and -1 for directed graph: ");     scanf("%d", &gtype);     printf("Enter the number of vertices: ");     scanf("%d", &n);          create_graph(n, gtype);          BF_Traversal(n);          return 0; } void create_graph(int n, int gtype) {     int max_edges, src, dest;          if (gtype == 1)         max_edges = (n * (n - 1)) /...
Read more

BFS List

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 struct Node { int vertex; struct Node* next; }; int queue[MAX],front=-1,rear=-1; int state[MAX]; struct Node* adj[MAX]; void create_graph(int n,int gtype); void insert_queue(int v); int delete_queue(); int isEmpty_queue(); void BFT(int n); void BFS(int start,int n); void add_edge(int src,int dest); struct Node* create_node(int v); int main() { int gtype,n; printf("Enter 1 for undirected graph and -1 for directed graph:"); scanf("%d",&gtype); printf("Enter the number of vertices:"); scanf("%d",&n); create_graph(n,gtype); BFT(n); return 0; } void create_graph(int n,int gtype) { int max_edges,src,dest; if(gtype==1) max_edges=(n*(n-1))/2; else if(gtype==-1) max_edges=(n*(n-1)); for(int i=0;i<n;i++) adj[i]=NULL; for(int i=0;i<max_edges;i++) { printf("Enter edge %d (press -1 and -1 to quit):...
Read more