#include <iostream>
#include <iomanip>
#include <fstream>
#include <cctype>

using namespace std;

static char *help = "jseq stages rule inputfile \n\
   stages = 1 or 2, the number of work centers or process stages\n\
   rule   = job sequencing rule:\n\
            F (first-come, first served, 1-stage)\n\
            S (shortest processing time first, 1-stage)\n\
            E (earliest due date, 1-stage)\n\
            C (critical ratio, 1-stage)\n\
            R (slack time remaining, 1-stage)\n\
            A all rules for 1-stage problem\n\
            J (Johnson's rule, 2-stage)\n\
            P (Palmer's method, multi-stage)\n\
   file   = name of text input file, one job per line, in form:\n\
            jobname processTime dueDate    (1-stage problems)\n\
            jobname stage1time stage2time  (2-stage problems)\n\
jobnames are 1-8 characters (no blanks), integer times and due dates.";


//functions
float input(char [], float [], float[], float, char* []);
void output(char [], float [], float [], float, char);
void header(char);
void first(char [], float [], float [], float &, float &, float &, float &, float &, float &);
void shortest(char [], float [], float [], float &, float &, float &, float &, float &, float &);
void earliest(char [], float [], float [], float &, float &, float &, float &, float &, float &);
void critical(char [], float [], float [], float &, float &, float &, float &, float &, float &);
void slack(char [], float [], float [], float &, float &, float &, float &, float &, float &);


//main module
int main(int argc, char *argv[])
{
	char name[50];
	float time[50];
	float due[50];
	float n;
	char choice;
	int stages;
	
	//Check to see if there are four arguments
	if (argc != 4)
	{cout<<help<<endl;
	// cout<<argc<<endl;
	exit(1);
	}

	//Get stages, rule, and number of jobs
	stages= atoi(argv[1]);
	choice= *argv[2];
	n=input(name, time, due, n, argv);	

	//Print stages, jobs, and rule
	cout<<endl<<"==================="<<endl;
	cout<<"JOB SHOP Scheduling"<<endl;
	cout<<"==================="<<endl;
	cout<<"Stages:"<<setw(5)<<stages<<endl;;
	cout<<"Jobs:"<<setw(7)<<n<<endl;
	cout<<"Rule:      ";
	if(toupper(choice)=='F')
		cout<<"First Come, First Served"<<endl<<endl;
	else if(toupper(choice)=='S')
		cout<<"Shortest Processing Time"<<endl<<endl;
	else if(toupper(choice)=='E')
		cout<<"Earliest Due Date"<<endl<<endl;
	else if(toupper(choice)=='C')
		cout<<"Critical Ratio Rule"<<endl<<endl;
	else if(toupper(choice)=='R')
		cout<<"Slack Time Remaining"<<endl<<endl;
	else
		{cout<<"\nERROR: The job should be one of the following:"<<endl;
		cout<<"F= First Come, First Served"<<endl;
		cout<<"S= Shortest Processing Time"<<endl;
		cout<<"E= Earliest Due Date"<<endl;
		cout<<"C= Critical Ratio Rule"<<endl;
		cout<<"R= Slack Time Remaining"<<endl;
		exit(1);
		}		

	//Call output function
	output(name, time, due, n, choice);

	return 0;
}


//Input function
float input(char n[], float t[], float d[], float count, char *argv[])
{

	//Declare count
	count=0;
		
	//Declare infile as an ifstream and open it
	ifstream infile;
	infile.open(argv[3]);
	
	//Check to see if infile exists
	if(infile.fail())
	{cout<< "Error opening file!"<<endl;
	exit(1);
	}

	//Get initial data from file
	infile >> n[0];
	infile >> t[0];
	infile >> d[0];
		
	int x=0;

	//Get the rest of the data from file
	while(!infile.eof())
	{
		
		x++;		
		infile >> n[x];
		infile >> t[x];
		infile >> d[x];

		//Keep track of how many jobs are in the file
		count++;		
	}

	//Close the file and return count
	infile.close();
	return count;

}



//Output function
void output(char name[], float time[], float due[], float n, char choice)
{
	float flow=0;
	float tardy=0;
	float totalflow=0;
	float totaltardy=0;
	float numtardy=0;

	//Call job function according to choice
	if(toupper(choice)=='F')
		first(name, time, due, n, flow, tardy, totalflow, totaltardy, numtardy);
	else if(toupper(choice)=='S')
		shortest(name, time, due, n, flow, tardy, totalflow, totaltardy, numtardy);
	else if(toupper(choice)=='E')
		earliest(name, time, due, n, flow, tardy, totalflow, totaltardy, numtardy);
	else if(toupper(choice)=='C')	
		critical(name, time, due, n, flow, tardy, totalflow, totaltardy, numtardy);
	else if(toupper(choice)=='R')
		slack(name, time, due, n, flow, tardy, totalflow, totaltardy, numtardy);
	
	cout<<"---    ----    ----    ----    ---------";
	
	if(toupper(choice)=='C')
		cout<<"    -----";
	else if(toupper(choice)=='R')
		cout<<"    ---------";
	cout<<endl;
	
	//Display the sum of the flow time and sum of the tardy jobs
	cout<<setw(19)<<totalflow<<setw(21)<<totaltardy<<endl<<endl<<endl;

	//Calculate the percentage of jobs that are tardy
	float percenttardy=(numtardy/n)*100;

	//Display totals
	cout<<"Number of Jobs:"<<setprecision(2)<<fixed<<showpoint<<setw(16)<<n<<endl;
	cout<<"Total Flow Time:"<<setw(15)<<totalflow<<endl;
	cout<<"Average Flow Time:"<<setw(13)<<(totalflow/n)<<endl;
	cout<<"Makespan:"<<setw(22)<<flow<<endl;
	cout<<"Average Jobs in System:"<<setw(8)<<(totalflow/flow)<<endl;
	cout<<"Number of Tardy Jobs:"<<setw(10)<<numtardy<<setw(5)<<"("<<percenttardy<<"%)"<<endl;
	cout<<"Average Lateness:"<<setw(14)<<(totaltardy/n)<<endl;
}



//Header Function
void header(char choice)
{
	//Display header information
	cout<<"       Proc    Flow    Due";
	if(toupper(choice)=='C')
		cout<<"                  Critical";
	else if(toupper(choice)=='R')
		cout<<"                  Slack Time";

	cout<<endl<<"Job    Time    Time    Date    Tardiness";
	if(toupper(choice)=='C')
		cout<<"    Ratio";
	else if(toupper(choice)=='R')
		cout<<"    Remaining";

	cout<<endl<<"---    ----    ----    ----    ---------";
	if(toupper(choice)=='C')
		cout<<"    -----";
	else if(toupper(choice)=='R')
		cout<<"    ---------";

	cout<<endl;
}



//First Come, First Served Function
void first(char name[], float time[], float due[], float &count, float &flow, float &tardy, float &totalflow, float &totaltardy, float &numtardy)
{
	
	header('F');
for(int x=0; x<count; x++)
{
	//Display information for each job
	cout<<setw(3)<<name[x];
	cout<<setw(8)<<time[x];
	cout<<setw(8)<<(flow+=time[x]);
	cout<<setw(8)<<due[x];
	cout<<setw(13);
	
	//Calculate the number of tardy jobs
	tardy=flow-due[x];
	if(tardy>0)
		{cout<<tardy<<endl;
		numtardy++;
		}
	else
		{tardy=0;
		cout<<tardy<<endl;
		}

	//Calculate the sum of the flow time and the sum of the tardy jobs
	totalflow+=flow;
	totaltardy+=tardy;
}
}



//Shortest processing time function
void shortest(char name[], float time[], float due[], float &count, float &flow, float &tardy, float &totalflow, 
float &totaltardy, float &numtardy)
{
	
	
	header('S');
	bool swap;
	float tempTime;
	char tempName;
	float tempDue;

	//Bubble Sort data to arrange information from shortest processing time to longest
	do{
		swap=false;
		for(int c=0; c<(count-1); c++)
		{
			if(time[c] > time[c+1])
			{
			tempTime=time[c];
			time[c]=time[c+1];
			time[c+1]=tempTime;
		
			tempName=name[c];
			name[c]=name[c+1];
			name[c+1]=tempName;
			
			tempDue=due[c];
			due[c]=due[c+1];
			due[c+1]=tempDue;

			swap=true;
			}
		}
	}while(swap);

//Display information for each job
for(int x=0; x<count; x++)
{	cout<<setw(3)<<name[x];
	cout<<setw(8)<<time[x];
	cout<<setw(8)<<(flow+=time[x]);
	cout<<setw(8)<<due[x];
	cout<<setw(13);
	tardy=flow-due[x];
	if(tardy>0)
		{cout<<tardy<<endl;
		numtardy++;
		}
	else
		{tardy=0;
		cout<<tardy<<endl;
		}
	totalflow+=flow;
	totaltardy+=tardy;
}
}




//Earliest Due Date function
void earliest(char name[], float time[], float due[], float &count, float &flow, float &tardy, float &totalflow, float &totaltardy, float &numtardy)
{
	
	header('E');
	bool swap;
	float tempTime;
	char tempName;
	float tempDue;

	//Bubble Sort data: Earliest to Latest due date
	do{
		swap=false;
		for(int a=0; a<(count-1); a++)
		{
			if(due[a] > due [a+1])
			{
			tempTime=time[a];
			time[a]=time[a+1];
			time[a+1]=tempTime;
		
			tempName=name[a];
			name[a]=name[a+1];
			name[a+1]=tempName;
		
			tempDue=due[a];
			due[a]=due[a+1];
			due[a+1]=tempDue;

			swap=true;
			}
		}
	}while(swap);


//Display information for each job
for(int b=0; b<count; b++)
{	cout<<setw(3)<<name[b];
	cout<<setw(8)<<time[b];
	cout<<setw(8)<<(flow+=time[b]);
	cout<<setw(8)<<due[b];
	cout<<setw(13);
	tardy=flow-due[b];
	if(tardy>0)
		{cout<<tardy<<endl;
		numtardy++;
		}
	else
		{tardy=0;
		cout<<tardy<<endl;
		}
	totalflow+=flow;
	totaltardy+=tardy;
}
}


//Critical Ratio Rule Function
void critical(char name[], float time[], float due[], float &count, float &flow, float &tardy, float &totalflow, float &totaltardy, float &numtardy)
{
	header('C');
	bool swap;
	float tempTime;
	char tempName;
	float tempDue;
	float cRatio[static_cast<int>(count)];
	float tempRatio;

	//Calculate CR for each job and store in cRatio
	for(int x=0; x<count; x++)
	{
		cRatio[x]=(due[x]/time[x]);
	}


	//Bubble Sort data: smallest to largest Critical Ratio
	do{
		swap=false;
		for(int m=0; m<(count-1); m++)
		{
			if(cRatio[m] > cRatio[m+1])
			{
			tempRatio=cRatio[m];
			cRatio[m]=cRatio[m+1];
			cRatio[m+1]=tempRatio;

			tempTime=time[m];
			time[m]=time[m+1];
			time[m+1]=tempTime;

			tempName=name[m];
			name[m]=name[m+1];
			name[m+1]=tempName;
			
			tempDue=due[m];
			due[m]=due[m+1];
			due[m+1]=tempDue;

			swap=true;
			}
		}
	}while(swap);


//Display information for each job
for(int b=0; b<count; b++)
{	cout<<setw(3)<<name[b];
	cout<<setw(8)<<time[b];
	cout<<setw(8)<<(flow+=time[b]);
	cout<<setw(8)<<due[b];
	cout<<setw(13);
	tardy=flow-due[b];
	if(tardy>0)
		{cout<<tardy;
		numtardy++;
		}
	else
		{tardy=0;
		cout<<tardy;
		}
	cout<<setw(8)<<cRatio[b];
	cout<<endl;
	totalflow+=flow;
	totaltardy+=tardy;
}
}



//Slack Time Remaining Function
void slack(char name[], float time[], float due[], float &count, float &flow, float &tardy, float &totalflow, float &totaltardy, float &numtardy)
{
	header('R');
	bool swap;
	float tempTime;
	char tempName;
	float tempDue;
	float slack[static_cast<int>(count)];
	float tempSlack;

	//Calculate slack time remaining for each job
	for(int n=0; n<count; n++)
	{
		slack[n]=(due[n]-time[n]);
	}

	//Bubble Sort data: least to most slack time remaining
	do{
		swap=false;
		for(int a=0; a<(count-1); a++)
		{
			if(slack[a] > slack[a+1])
			{
			tempSlack=slack[a];
			slack[a]=slack[a+1];
			slack[a+1]=tempSlack;

			tempTime=time[a];
			time[a]=time[a+1];
			time[a+1]=tempTime;

			tempName=name[a];
			name[a]=name[a+1];
			name[a+1]=tempName;

			tempDue=due[a];
			due[a]=due[a+1];
			due[a+1]=tempDue;

			swap=true;
			}
		}
	}while(swap);

//Display information for each job
for(int z=0; z<count; z++)
{	cout<<setw(3)<<name[z];
	cout<<setw(8)<<time[z];
	cout<<setw(8)<<(flow+=time[z]);
	cout<<setw(8)<<due[z];
	cout<<setw(13);
	tardy=flow-due[z];
	if(tardy>0)
		{cout<<tardy;
		numtardy++;
		}
	else
		{tardy=0;
		cout<<tardy;
		}
	cout<<setw(13)<<slack[z];
	cout<<endl;
	totalflow+=flow;
	totaltardy+=tardy;
}
}