Skip to content

CCDV2/jobshop-schedule

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Jobshop Schedule

collaborated with yzy and yzq

This program has turned out to be with very poor performance, and very poor grade(myself)...


About Input

The standard input contains n + 1 lines. The first line contains 2 numbers n and m, which represents job number and machine number.
The next following n lines elaborates n jobs. Each line contains some pairs of numbers, which means the required machine and the duration.
job number ranges from 0 to n - 1
machine number ranges from 0 to m - 1
Sample:
15 10
8 14 4 75 3 12 2 38 0 76 5 97 9 12 1 29 7 44 6 66
5 38 3 82 2 85 4 58 6 87 9 89 0 43 1 80 7 69 8 92
9 5 1 84 0 43 6 48 4 8 7 7 3 41 5 61 8 66 2 14
2 42 1 8 0 96 5 19 4 59 7 97 9 73 8 43 3 74 6 41
6 55 2 70 3 75 8 42 4 37 7 23 1 48 5 5 9 38 0 7
8 9 2 72 7 31 0 79 5 73 3 95 4 25 6 43 9 60 1 56
0 97 2 64 3 78 5 21 4 94 9 31 8 53 6 16 7 86 1 7
3 86 7 85 9 63 0 61 2 65 4 30 5 32 1 33 8 44 6 59
2 44 3 16 4 11 6 45 1 30 9 84 8 93 0 60 5 61 7 90
7 36 8 31 4 47 6 52 0 32 5 11 2 28 9 35 3 20 1 49
8 20 6 49 7 74 4 10 5 17 3 34 0 85 2 77 9 68 1 84
1 85 5 7 8 71 6 59 4 76 0 17 3 29 2 17 7 48 9 13
2 15 6 87 7 11 1 39 4 39 8 43 0 19 3 32 9 16 5 64
6 32 2 92 5 33 8 82 1 83 7 57 9 99 4 91 3 99 0 8
4 88 7 7 8 27 1 38 3 91 2 69 6 21 9 62 5 39 0 48

About

solve jop shop problem based on tabu search

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published