From 3df2f1b3c9c908206c4f053e7bdcc617e8ea052e Mon Sep 17 00:00:00 2001
From: lrcstdio <316294622@qq.com>
Date: Mon, 14 May 2018 21:21:52 +0800
Subject: [PATCH 1/3] 2.0

---
 crossover.cpp | 76 +++++++++++++++++++++++++++++++++++++++++++++++++++
 decode.cpp    | 29 ++++++++++++++++++++
 evolution.h   | 41 +++++++++++++++++++++++++++
 init.cpp      | 32 ++++++++++++++++++++++
 input.cpp     | 37 +++++++++++++++++++++++++
 lsort.cpp     | 18 ++++++++++++
 main.cpp      | 13 +++++++++
 mutate.cpp    | 11 ++++++++
 output.cpp    | 23 ++++++++++++++++
 test.cpp      | 19 +++++++++----
 10 files changed, 294 insertions(+), 5 deletions(-)
 create mode 100644 crossover.cpp
 create mode 100644 decode.cpp
 create mode 100644 evolution.h
 create mode 100644 init.cpp
 create mode 100644 input.cpp
 create mode 100644 lsort.cpp
 create mode 100644 main.cpp
 create mode 100644 mutate.cpp
 create mode 100644 output.cpp

diff --git a/crossover.cpp b/crossover.cpp
new file mode 100644
index 0000000..1a143a9
--- /dev/null
+++ b/crossover.cpp
@@ -0,0 +1,76 @@
+#include "evolution.h"
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <cstring>
+void jobshop::select(double* _q)
+{
+    _q[0] = r1*exp(r2*decode(genes[0]));
+    for(int i=1;i<ps;i++)  _q[i] = _q[i-1] + r1*exp(r2*decode(genes[i]));
+    double sum = _q[ps-1];
+    for(int i=0;i<ps;i++) _q[i]/=sum;
+}
+
+void jobshop::crossover()
+{
+    double q[ps+1],p1,p2;
+    int n1,n2,m1,m2,cnt=0;
+    int tgenes[15][15*15];
+    srand((unsigned)time(0));
+    bool book1[15*15],book2[15*15];
+    memcpy(tgenes,genes,sizeof(genes));
+
+    select(q);
+
+    while(cnt<ps)
+    {
+        p1=rand()/double(RAND_MAX);
+        p2=rand()/double(RAND_MAX);
+        for(int i=0;i<ps;i++)
+        {
+            if(n1==-1 && q[i]>p1) n1=i;
+            if(n2==-1 && q[i]>p2) n2=i;
+            if(n1!=-1 && n2!=-1) break;
+        }
+
+        do
+        {
+            m1=rand()%len;
+            m2=rand()%len;
+        }while(m1==m2);
+        if(m1>m2) {int t;t=m1;m1=m2;m2=t;}
+
+        memset(book1,false,sizeof(book1));
+        memset(book2,false,sizeof(book2));
+
+        for(int i=m1;i<=m2;i++)
+        {
+            genes[cnt][i]=tgenes[n1][i];
+            for(int j=0;j<len;j++)
+                if(tgenes[n2][j]==tgenes[n1][i]) book2[j]=true;
+            genes[cnt+1][i]=tgenes[n2][i];
+            for(int j=0;j<len;j++)
+                if(tgenes[n2][j]==tgenes[n1][i]) book2[j]=true;
+        }
+
+        int j1=0,j2=0;
+        for(int i=0;i<m1;i++)
+        {
+            while(book2[j2]) j2++;
+            genes[cnt][i]=tgenes[n2][j2];
+            while(book1[j1]) j1++;
+            genes[cnt+1][i]=tgenes[n1][j1];
+        }
+        for(int i=m2+1;i<len;i++)
+        {
+            while(book2[j2]) j2++;
+            genes[cnt][i]=tgenes[n2][j2];
+            while(book1[j1]) j1++;
+            genes[cnt+1][i]=tgenes[n1][j1];
+        }
+
+        lsort(genes[cnt]);
+        lsort(genes[cnt+1]);
+        cnt+=2;
+    }
+}
diff --git a/decode.cpp b/decode.cpp
new file mode 100644
index 0000000..797b689
--- /dev/null
+++ b/decode.cpp
@@ -0,0 +1,29 @@
+//
+// Created by liuren on 18-5-14.
+//
+
+#include "evolution.h"
+#include <cstring>
+
+inline int max(int a, int b){if(a>=b) return a;return b;}
+
+int jobshop::decode(int *g)
+{
+    int d[15],p[15];
+    memset(TT,0,sizeof(TT));
+    memset(d,0,sizeof(d));   //对应机器上的最大完成时间
+    memset(p,0,sizeof(p));   //对应工件上的最大完成时间
+
+    for(int j=0;j<len;j++)
+    {
+        int k=g[j];
+        TT[pc[k].m][k] = max(d[pc[k].m], p[pc[k].i]) + pc[k].t;
+        d[pc[k].m] = p[pc[k].i] = TT[pc[k].m][k];
+    }
+
+    int maxt=0;
+    for(int i=0;i<m;i++)
+        maxt = max(maxt,d[i]);
+    ans = max(ans, maxt);
+    return maxt;
+}
diff --git a/evolution.h b/evolution.h
new file mode 100644
index 0000000..2e41cb8
--- /dev/null
+++ b/evolution.h
@@ -0,0 +1,41 @@
+//
+// Created by liuren on 18-5-14.
+//
+#ifndef JSP_EVOLUTION_H
+#define JSP_EVOLUTION_H
+//交叉概率，变异概率，种群数量，适值函数的两个参数
+const int cr = 0.9;
+const int mr = 0.1;
+const int ps = 20;
+const double r1=1;
+const double r2=-0.5;
+
+struct process{
+    int m,t,i,j;  //分别表示对应机器，所需时间,对应工件，在对应工件中的相对工序
+};
+
+class jobshop
+{
+private:
+    int n,m,len;               //工件数，机器数，工序数
+    int ans;                   //最小完成时间
+    int TMJ[15][15*15],TT[15][15*15];        //解码矩阵
+    process pc[15*15];         //工序数组
+    int genes[51][15*15];     //基因组，下标从0开始
+    int theBestGene[15];      //最优基因
+    int  startpro[15];         //每个工件开始的工序号
+
+public:
+    jobshop(int,int);          //构造函数
+    int decode(int *);    //解码
+    void lsort(int *);
+    void input();     //输入
+    void init();      //初始化种群基因组
+    void select(double *);    //
+    void crossover(); //交叉
+    void mutate();    //变异
+    void output();    //输出
+    void test();      //测试
+};
+
+#endif //JSP_EVOLUTION_H
diff --git a/init.cpp b/init.cpp
new file mode 100644
index 0000000..c18cd86
--- /dev/null
+++ b/init.cpp
@@ -0,0 +1,32 @@
+//
+// Created by liuren on 18-5-14.
+//
+
+#include "evolution.h"
+#include <cstring>
+#include <cstdlib>
+#include <ctime>
+void jobshop::init()
+{
+    int *fa;
+    fa=(int *)malloc(len*sizeof(int));
+    for (int i = 0; i < len; ++i) {
+        fa[i]=i+1;
+    }
+    for(int k=0;k<ps;k++)
+    {
+        memcpy(genes[k],fa,len*sizeof(int));
+        int t=len;
+        srand(time(0));
+        while(t--) {
+            int i = rand() % len;
+            int j = rand() % len;
+            if (pc[genes[k][i]].i!=pc[genes[k][j]].i)
+            {
+                int tmp = genes[k][i];
+                genes[k][i] = genes[k][j];
+                genes[k][j]=tmp;
+            }
+        }
+    }
+}
diff --git a/input.cpp b/input.cpp
new file mode 100644
index 0000000..78546a7
--- /dev/null
+++ b/input.cpp
@@ -0,0 +1,37 @@
+//
+// Created by liuren on 18-5-14.
+//
+
+#include <cstdio>
+#include <cstring>
+#include "evolution.h"
+
+jobshop::jobshop(int nn,int mm)
+{
+    n=nn;
+    m=mm;
+    len=ans=0;
+    memset(TMJ,0,sizeof(TMJ));
+    memset(genes,0,sizeof(genes));
+    memset(pc,0,sizeof(process));
+}
+
+void jobshop::input()
+{
+    int j,k,a,b,cnt=0;               //k��ʾ�����ţ�a��ʾʱ�䣬b��ʾ������
+    while(scanf("%d",&k)&&k!=-1)
+    {
+        j=0;
+        startpro[k]=cnt+1;
+        while(scanf(" (%d,%d)",&a,&b))
+        {
+            pc[++len].t=a;
+            pc[len].m=b;
+            pc[len].i=k;
+            pc[len].j=++j;
+            TMJ[b][len]=a;
+            ++cnt;
+        }
+    }
+
+}
diff --git a/lsort.cpp b/lsort.cpp
new file mode 100644
index 0000000..f7edc85
--- /dev/null
+++ b/lsort.cpp
@@ -0,0 +1,18 @@
+//
+// Created by liuren on 18-5-14.
+//
+#include <cstdio>
+#include <cstring>
+#include "evolution.h"
+#include <cstdlib>
+void jobshop::lsort(int *a)
+{
+    int *b;
+    b=(int *)malloc((n+1)*sizeof(int));
+    memset(b,0,sizeof(b));
+    for(int i=0;i<len;i++)
+    {
+        int t=a[i];
+        a[i]=(b[pc[t].i]++)+startpro[pc[t].i];
+    }
+}
\ No newline at end of file
diff --git a/main.cpp b/main.cpp
new file mode 100644
index 0000000..8040378
--- /dev/null
+++ b/main.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include "evolution.h"
+using namespace std;
+
+int main()
+{
+    int n,m;
+    cin>>n>>m;
+    jobshop js(n,m);
+    js.input();
+    js.test();
+    return 0;
+}
\ No newline at end of file
diff --git a/mutate.cpp b/mutate.cpp
new file mode 100644
index 0000000..2f44078
--- /dev/null
+++ b/mutate.cpp
@@ -0,0 +1,11 @@
+//
+// Created by liuren on 18-5-14.
+//
+
+#include "evolution.h"
+#include <ctime>
+#include <cstdlib>
+
+void jobshop::mutate() {
+    
+}
\ No newline at end of file
diff --git a/output.cpp b/output.cpp
new file mode 100644
index 0000000..ed2eb6f
--- /dev/null
+++ b/output.cpp
@@ -0,0 +1,23 @@
+//
+// Created by liuren on 18-5-14.
+//
+
+#include "evolution.h"
+#include <cstdio>
+
+void jobshop::output()
+{
+    decode(theBestGene);
+    for(int i=0;i<m;i++)
+    {
+        printf("M%d ", i);
+        for(int j=0;j<len;j++)
+        {
+            int k=theBestGene[j];
+            if(pc[k].m == i)
+                printf("(%d,%d-%d,%d)",TT[i][k]-pc[k].t, pc[k].i, pc[k].j, TT[i][k]);
+        }
+        putchar('\n');
+    }
+    printf("End %d\n", ans);
+}
diff --git a/test.cpp b/test.cpp
index 23e0d81..b4f992d 100644
--- a/test.cpp
+++ b/test.cpp
@@ -1,6 +1,15 @@
-#include <iostream>
-int main(int argc, char const *argv[]) {
-  char g[15][15*15];
-  printf("..\n" );
-  return 0;
+//
+// Created by liuren on 18-5-14.
+//
+
+#include "evolution.h"
+#include <cstring>
+
+void jobshop::test()
+{
+    int temp[9];
+    for(int i=0;i<9;i++)
+        temp[i]=i+1;
+    memcpy(theBestGene,temp,9*sizeof(int));
+    output();
 }

From af6caf209a58e33b08b195104452d58c19cb7bcf Mon Sep 17 00:00:00 2001
From: Zachary <34575677+hhuangzhen@users.noreply.github.com>
Date: Mon, 14 May 2018 21:26:29 +0800
Subject: [PATCH 2/3] Delete Record Maintenance.c

---
 Record Maintenance.c | 197 -------------------------------------------
 1 file changed, 197 deletions(-)
 delete mode 100644 Record Maintenance.c

diff --git a/Record Maintenance.c b/Record Maintenance.c
deleted file mode 100644
index b37b64b..0000000
--- a/Record Maintenance.c	
+++ /dev/null
@@ -1,197 +0,0 @@
-#include<stdio.h>
-#include<string.h>
-#include<ctype.h>
-
-typedef struct{
-  int id;
-  char name[40];
-  int num;
-  double price;
-}cd;
-
-void init(FILE *f)
-{
-  cd a[100];
-  memset(a,0,sizeof(a));
-  rewind(f);
-  fwrite(a,sizeof(cd),100,f);
-  printf("100���ռ�¼�������\n\n");
-}
-
-void input(FILE *f)
-{
-  cd a[100];
-  int id[100];
-  int cnt=-1;
-  memset(a,0,sizeof(a));
-  rewind(f);
-  fread(a,sizeof(cd),100,f);
-  while(1)
-  {
-    printf("��������Ʒ��Ϣ[IDΪ-1�����������]\n");
-    printf("��ƷID:");
-    int t;
-    scanf("%d", &t);
-    getchar();
-    if(t==-1) break;
-    a[t].id=t;
-    printf("��Ʒ��:");
-    gets(a[t].name);
-    printf("����:");
-    scanf("%d", &a[t].num);
-    printf("�۸�:");
-    scanf("%lf", &a[t].price);
-
-    id[++cnt]=t;
-  }
-  rewind(f);
-  fwrite(a,sizeof(cd),100,f);
-
-  printf("��Ʒ��Ϣ�������\n��Ʒ��Ϣ����\n");
-  printf("��¼�ţ���ƷID��\t��Ʒ��\t\t����\t�۸�\n");
-
-  for(int i=0;i<=cnt;i++)
-    printf("%-17d\t%-16s%-5d\t%.2lf\n", id[i], a[id[i]].name, a[id[i]].num, a[id[i]].price);
-  putchar('\n');
-}
-
-double read()
-{
-  char ch;
-  double t=0;
-  double r=1;
-  int flag=0;
-  while((ch=getchar())!='\n')
-  {
-    flag=1;
-    if(isdigit(ch))
-    {
-      if(r==1)  t=t*10+(ch-'0');
-      else
-      {
-        t+=(ch-'0')*r;
-        r*=0.1;
-      }
-    }
-    else if(ch=='.')  r=0.1;
-  }
-  if(flag) return t;
-  return -1;
-}
-
-void updata(FILE *f)
-{
-  cd a[100];
-  rewind(f);
-  fread(a,sizeof(cd),100,f);
-
-  while(1)
-  {
-    printf("�������������ƷID[IDΪ-1������������]:\n");
-    int t;
-    scanf("%d", &t);
-    getchar();
-    if(t==-1) break;
-    if(strlen(a[t].name)==0)  printf("�Բ��𣬼�¼��Ϊ%d����Ʒ�����ڣ��޷�����\n", t);
-    else
-    {
-      printf("ԭ��Ʒ��Ϣ����\n");
-      printf("��¼�ţ���ƷID��\t��Ʒ��\t\t����\t�۸�\n");
-      printf("%-17d\t%-16s%-5d\t%.2lf\n", a[t].id, a[t].name, a[t].num, a[t].price);
-      printf("�����������Ϣ[��ij�������ֱ�Ӱ��س���]:\n");
-      printf("��Ʒ��:");
-      int j=0;
-      int flag=0;
-      double temp;
-      char ch;
-      while((ch=getchar())!='\n') flag=1,a[t].name[j++]=ch;
-      if(flag==1) a[t].name[j]='\0';
-      printf("����:");
-      if((temp=read())!=-1) a[t].num=(int)temp;
-      printf("�۸�:");
-      if((temp=read())!=-1) a[t].price=temp;
-      rewind(f);
-      fseek(f,t*sizeof(cd),0);
-      fwrite(&a[t],sizeof(cd),1,f);
-      printf("���º���Ʒ��Ϣ����:\n");
-      printf("��¼�ţ���ƷID��\t��Ʒ��\t\t����\t�۸�\n");
-      printf("%-17d\t%-16s%-5d\t%.2lf\n", a[t].id, a[t].name, a[t].num, a[t].price);
-    }
-  }
-  printf("���¹�������\n\n");
-}
-
-void output(FILE *f)
-{
-  cd a[100];
-  rewind(f);
-  fread(a,sizeof(cd),100,f);
-  printf("��Ʒ��Ϣ����:\n");
-  printf("��¼�ţ���ƷID��\t��Ʒ��\t\t����\t�۸�\n");
-  for(int i=0;i<100;i++)
-  {
-    if(strlen(a[i].name)!=0)
-      printf("%-17d\t%-16s%-5d\t%.2lf\n", a[i].id, a[i].name, a[i].num, a[i].price);
-  }
-  putchar('\n');
-}
-
-void _delete(FILE *f)
-{
-  cd a[100];
-  rewind(f);
-  fread(a,sizeof(cd),100,f);
-  while(1)
-  {
-    printf("�������ɾ����ƷID[��¼��Ϊ-1��������ɾ��]:\n");
-    int t;
-    scanf("%d", &t);
-    getchar();
-    if(t==-1) break;
-    if(strlen(a[t].name)==0) printf("�Բ��𣬼�¼��Ϊ%d����Ʒ�����ڣ��޷�����ɾ������\n", t);
-    else
-    {
-      printf("����Ʒ��Ϣ����:\n");
-      printf("��¼�ţ���ƷID��\t��Ʒ��\t\t����\t�۸�\n");
-      printf("%-17d\t%-16s%-5d\t%.2lf\n", a[t].id, a[t].name, a[t].num, a[t].price);
-      printf("�Ƿ�ȷʵɾ��(ȷ�ϰ�Y��ȡ����N)��\n");
-      if(getchar()=='N') printf("��ѡ��ɾ����¼��Ϊ%d����Ʒ\n", t);
-      else
-      {
-        memset(a[t].name,0,sizeof(a[t].name));
-        a[t].num=0;
-        a[t].price=0;
-        rewind(f);
-        fseek(f,t*sizeof(cd),0);
-        fwrite(&a[t],sizeof(cd),1,f);
-        printf("��¼��Ϊ%d����Ʒ�ɹ�ɾ��\n", t);
-        output(f);
-      }
-    }
-  }
-  printf("ɾ����������\n\n");
-}
-
-int main(int argc, char const *argv[]) {
-  FILE *f = fopen("commodity.dat","rb+");
-  while(1)
-  {
-    printf("����������ѡ��\n");
-    printf("1--����һ��100���ռ�¼���ļ�\n2--������Ʒ��Ϣ\n3--������Ʒ��¼\n4--ɾ����Ʒ��¼\n5--���ȫ����Ʒ��¼\n6--�˳�����\n");
-    printf("[ѡ��]");
-    int q;
-    scanf("%d", &q);
-    if(q==1) init(f);
-    if(q==2) input(f);
-    if(q==3) updata(f);
-    if(q==4) _delete(f);
-    if(q==5) output(f);
-    if(q==6)
-    {
-      printf("�������н������ټ���\n\n");
-      break;
-    }
-  }
-  fclose(f);
-  return 0;
-}

From ce4d57abcebb58080dcf2adf3e3886804fa13fed Mon Sep 17 00:00:00 2001
From: Zachary <34575677+hhuangzhen@users.noreply.github.com>
Date: Mon, 14 May 2018 21:26:41 +0800
Subject: [PATCH 3/3] Delete commodity.dat

---
 commodity.dat | Bin 5600 -> 0 bytes
 1 file changed, 0 insertions(+), 0 deletions(-)
 delete mode 100644 commodity.dat

diff --git a/commodity.dat b/commodity.dat
deleted file mode 100644
index 90d48123bedd99e50badf7d4aea953a343265350..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 5600
zcmZQz7zNlufE6g1lbBn8O%7d594PQjBc}h*S9u3?Ia>2MXl((S`CLGLMq+MmY7v?Q
z7A{CF1ZX(GSfli42#kinXb6mkz-S1JhQMeDjE2By2#kinXb6mkz-S1JhQMeDjE2By
L2#kgR^+EsugM|p>