Assignments
Weekly Research Assignments (Always due by Saturday Noon time)
As part of the class requirements you need to read and summarize an assigned research article each week.
The best guideline I have seen is the instructions by Dr. Jamie Korsmo in WikiHow. We will be using this guideline for our classes this semester. On the right side of the same page you can see links to other useful "How to" instructions including, "How to Review a Journal Article," and "How to Review a Journal Article" which are very useful if you are doing your Senior Design course or doing any graduate class.
About 50% of the article assignments are done by the instructor the remaining one can either be selected by the student (you can use the articles for you Senior Design or Thesis). Students might defer the choice in which case the instructor will make those assignments too.
The summary should not exceed 2-3 pages. Do not just copy and paste from the article. Read the guidelines, see the three samples they have on that page and follow a similar format.
All research article summaries are digital (email) submissions. They should be in PDF format, have a cover page and follow the report writing guidelines described for the class.
WEEK 1: (Due: 02-01-2020)
Application of Operational Research Techniques in Operating Room Scheduling Problems: Literature Overview
Seyda Gur and Tamer Eren
Journal of Healthcare Engineering, Volume 2018, Article ID 5341394, 15 pages
doi: 10.1155/2018/5341394
WEEK 2: (Due: 02-08-2020)
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Peter Brucker, Edmund K. Burke, Tim Curtois, Rong Qu, and Greet Vanden Berghe
Journal of Heuristics (2010) 16: 559–573
doi: 10.1007/s10732-008-9099-6
WEEK 3: (Due: 02-15-2020)
Your selection. Preferably related to your research. The selection must be approved by the instructor at least a week before the due date.
Assignment for those who have not secured an optional article:
Hybrid evolutionary optimisation with learning for production scheduling: state-of-the-art survey on algorithms and applications
Lin Lin & Mitsuo Gen
International Journal of Production Research Volume 56, 2018, Issue 1-2, Pages 193-223
doi: 10.1080/00207543.2018.1437288
WEEK 4: (Due: 02-22-2020)
Optimization of global production scheduling with deep reinforcement learning
Bernd Waschneck, Andre Reichstaller, Lenz Belzner, Thomas Altenmuller, Thomas Bauernhansl, Alexander Knapp, and Andreas Kyek
Procedia CIRP 72 (2018): 1264-1269
doi: 10.1016/j.procir.2018.03.212
WEEK 5: (Due: 02-29-2020)
Three-machine flow shop scheduling with overlapping waiting time constraints
Hyun-Jung Kim and Jun-Ho Lee
Computers & Operations Research Volume 101, January 2019, Pages 93-102
doi: 10.1016/j.cor.2018.06.009
WEEK 6: (Due: 03-07-2020)
Your selection. Preferably related to your research. The selection must be approved by the instructor at least a week before the due date.
Assignment for those who have not secured an optional article:
The Non-Permutation Flow-Shop scheduling problem: A literature review
Daniel Alejandro Rossit, Fernando Tohmé and Mariano Frutos
Omega Volume 77, June 2018, Pages 143-153
doi: 10.1016/j.omega.2017.05.010
Weekly Lecture Assignments (Always due by Thursday noon time)
Assignment 1: 50 points (Due: 01-30-2020)
For the job-shop problem assigned to you, find problem's best completion time.
Assignment 2: 50 Points (Due: 02-06-2020)
For the single machine, 40-job problem given below find two optimal schedules that minimize
average flow time, and average tardiness. For each case calculate how many jobs are tardy and what the total tardiness is.
X: The day of your birth, Y: Your birth year divided by 111 and rounded to nearest integer, and Z: The number of seconds you
can hold your breath divided by 3 and rounded to nearest integer.
Assignment 3: 150 Points (Due: 02-13-2020)
1. Find the optimal schedule for 40/1//Lmax for problem in Assignment 2 that minimizes the number of tardi jobs.
2. Find the optimal schedule for 40/1//Lmax problem 2 with the following precedence constraints:
J7
J11
J3
J19
J28
J5
J19
J8
J4
J17
J10
J2
J30
J4
J15
J14
J36
J23
J30
J8
J1
J22
3. Use Johnson’s algorithm on the 30/3/F/Cmax problem and find Cmax for the following cases of artificial two-machine problem formed by:
Case one: (Pi1+Pi2) and (Pi1+Pi3)
Case two: (Pi1+Pi2) and (Pi2+Pi3)
Case three: (Pi1) and (Pi3)
A random schedule of your choice (explain how)
X and Y: The last two digits of your birth year, and Z: Your height in centimeters divided by 10 and rounded to nearest integer.
Assignment 4: 50 Points (Due: 02-27-2020)
For the three-machine, 30-job problem given below, select the job with smallest (ai+bi) as Jf then apply S3 algorithm for all ++ jobs and
matched +- and -+ jobs that is possible. When no additional job can be added schedule the remaining jobs based on LPT (longest processing times)
on the third machine. Find Cmax. Can you argue whether this Cmax is optimal or not?
Assignment 5: 100 Points (Due: 03-05-2020)
For the two three-machine, 30-job problem given below, calculate Ideal Cmax, Jf and Jl, I2 and I3.
Argue whether the Ideal Cmax is optimal or not? Begin solving the problem using S3 algorithm with working through ++ jobs and matches.
Stop if you cannot schedule any more jobs, even if that job is Jf.