#include<stdio.h>
#include<alloc.h>
#include<conio.h>
#include<stdlib.h>

typedef struct {
                int id;
                long int SetT,
                         ProcT,
                         OpT,
                         StartT,
                         EndT,
                         D,
                         L;
                }T_JOB;

typedef struct {
               long Tmax,
                    Csum; /* legnagyobb keses, bef. idok osszege*/
               }T_OBJF;    /*celfuggvenyek*/

void simulation(T_JOB* job, int* sch, int NJ, long t);
void evaluation(T_JOB* job, int NJ, T_OBJF* objf);
void print_objf(T_OBJF* objf);
void print_Gantt(T_JOB* job, int* sch, int NJ);

int main(int argc, char* argv[])
{
  int NJ; /* munkak szama*/
  int i, j;
  T_JOB* job; /* munkak strvektre mutato*/
  int* sch; /* utemterv */
  T_OBJF objf;
  /* modellepites, utemezes, szimulacio, ertekeles*/

  /*modellepites*/
  printf("\n Kerem a munkak aktualis szamat:");
  scanf("%d", &NJ);

  job = calloc(sizeof(T_JOB), NJ);
  randomize();
  for (i=0; i<NJ; i++)
   {
    job[i].id = i;
    job[i].SetT = 1 + random(10);
    job[i].ProcT = 1 + random(100);
    job[i].OpT = job[i].SetT + job[i].ProcT;
    job[i].D = 1 + random(50) + job[i].OpT*random(5);
   }

  /*utemezes*/
  sch = calloc(sizeof(int), NJ);
  for (i=0; i<NJ; i++) sch[i]=i;

  /*szimulacio*/
  simulation(job, sch, NJ, 0);

  /*ertekeles*/
  evaluation(job, NJ, &objf);

  print_Gantt(job, sch, NJ);

  print_objf(&objf);
  getch();

  free(sch);
  free(job);
 return 0;
}
//---------------------------------------------------------------------------

void simulation(T_JOB* job, int* sch, int NJ, long t)
{
  int i;

  i=0;
  job[ sch[i] ].StartT = t;
  job[ sch[i] ].EndT = job[ sch[i] ].StartT + job[ sch[i] ].OpT;

  for (i=1; i<NJ; i++)
  {
    job[ sch[i] ].StartT = job[ sch[i-1] ].EndT;
    job[ sch[i] ].EndT = job[ sch[i] ].StartT + job[ sch[i] ].OpT;
  }
}

void evaluation(T_JOB* job, int NJ, T_OBJF* objf)
{
 int i;
 long Ti;
 objf->Csum = 0;
 objf->Tmax = 0;

 for (i=0; i<NJ; i++ )
 {
  objf->Csum += job[i].EndT;

  job[i].L = job[i].EndT - job[i].D; /*keses*/
  Ti = max(0, job[i].L); /*csuszas*/

  if (i==0) objf->Tmax = Ti;
  else if ( objf->Tmax < Ti ) objf->Tmax = Ti;

 }
}

void print_objf(T_OBJF* objf)
{
 printf("\n Csum= %ld", objf->Csum);
 printf("\n Tmax= %ld", objf->Tmax);
}

void print_Gantt(T_JOB* job, int* sch, int NJ)
{
 int i;
 printf("\n n: job_id \t StarT \t OpT \t EndT \t D \t L");

 for ( i=0; i<NJ; i++)
 {
  printf("\n %d: job_%d \t %ld \t %ld \t %ld \t %ld \t %ld",
  i,
  sch[i],
  job[ sch[i]].StartT,
  job[ sch[i]].OpT,
  job[ sch[i]].EndT,
  job[ sch[i]].D,
  job[ sch[i]].L);

 }

}