lingo-optimization

IE 318 Project

Students should submit their solution via Kodiak dropbox using a technical report

This is not a group project; you are only to work on this as an individual. There are 2.433(10)18 potential solutions and therefore unless you have the optimal solution it is unlikely any students solution will match any other students solution.

Please submit you solution in a clear and concise word document. You should clearly explain your solution; how you arrived at the solution (methodology); and all details necessary to support your solution. Be sure to include a final schedule that clearly identifies the starting and ending time of each job and the penalty each are charged.

Sequence and schedule 20 jobs to minimize total schedule cost as described by Table 1 below:

Table 1: Job Parameters

Job	Per Unit Earliness Penalty	Per Unit Lateness Penalty	Required Processing Time	Due Date
1	3	4	8	192
2	4	4	9	109
3	2	3	14	155
4	2	4	16	61
5	2	3	11	112
6	5	5	11	116
7	4	5	16	163
8	2	6	6	122
9	2	4	14	61
10	5	5	18	54
11	3	4	11	111
12	4	2	9	102
13	1	2	11	44
14	4	2	16	35
15	5	3	13	67
16	2	3	10	35
17	1	5	13	41
18	2	3	7	27
19	3	3	8	44
20	3	4	10	90

Bonus:

(10 points) If you solution is feasible and is within 10% of my solution.

(10 points) If your solution is feasible and superior to my solution.