# Assignments

Assignment 1

For the three single machine, 30-job problem given below find three optimal schedules that minimize: (1) average flow time, (2) average tardiness, and (3) the number of tardy jobs.

Assignment 2

1. Find the optimal schedule for 30/1//Lmax problem 1 with the following precedence constraints:

J_{7}
J_{11}
J_{3}
J_{19}
J_{28}
J_{5}

J_{19}
J_{8}
J_{4}

J_{17}
J_{10}
J_{2}
J_{30}
J_{4}
J_{15}

J_{14}
J_{6}
J_{23}
J_{30}
J_{8}
J_{1}
J_{22}

2. Use Johnson’s algorithm on the 30/3/F/Cmax problem and find C_{max} for the following cases of artificial
two-machine problem formed by:

Case one: (P_{i1}+P_{i2}) and (P_{i1}+P_{i3})

Case two: (P_{i1}+P_{i2}) and (P_{i2}+P_{i3})

Case three: (P_{i1}) and (P_{i3})

A random schedule of your choice (explain how)

Assignment 3

1. Develop an EXCEL sheet that does the calculations of all possible schedules for the problem worked out in the class for Van Wassenhove and Gelders algorithm. Plot all pairs and identify the efficient schedule among them. The plot, and a table showing all calculated values should be included in your report. Do not include copies of EXCEL sheet.

2. Apply Van Wassenhove and Gelders algorithm to find all efficient schedules for the following problem (n/1//F-bar subject to Tmax ≤ Δ. Use Sum (Fi) instead of F-bar. Also find the best schedule with respect to: 12*(Sum Fi) + 21*(Tmax) .

3. Solve the 30/3/F/Cmax problem below using S3 algorithm. Is the solution optimal? Why or why not?

Assignment 4

Under Construction

Assignment 5

Under Construction

Assignment 6

Under Construction