SCHEDULING AND SEQUENCING – SEMESTER 02 – 2024-2025
HOMEWORK 2
INSTRUCTIONS
1) The deadline for this assignment is 11:59 PM – Friday, June 6th, 2025.
2) All homework assignments must be completed individually and independently. Cheating is strictly
forbidden. Therefore, students will receive zero points where cheating occurred.
3) Remember to write down your name, student ID and class (i.e., G01_Tue_456, G02_Thu_456,
G03_Fri_123 or G04_Fri_456).
4) Your homework must be hand-written and well readable with provision of detailed formula,
explanation, and conclusion. Answer without calculation steps will not receive credit. Kindly sort
your answers in the same order as in the announced homework problem list.
5) The homework must be scanned (by CamScanner, Microsoft Lens, etc.), compiled into a single
PDF file (other file formats like DOCX, etc. will NOT be accepted) and submitted on Blackboard.
You can use tablets to write the answers and export to a PDF file. Each student will have TWO
attempts of submission. The file name will follow the given format: SS-HW2-[FullName]-
[StudentID].
Here is an example: SS-HW2-NguyenVanAn-IELSIU21021.
6) Students must follow the deadline. Late submissions will not be accepted.
7) We will strictly follow the above policy and there will be no exceptions.
8) Solutions will be uploaded towards the end of Week 18.
Notes: You can use Excel or Python/CPLEX code to re-check the results after finishing the assignment.
However, it is strongly advised to do it on paper first and calculate using the scientific calculator; this is a
good chance for you to practice at home and become well-prepared for the upcoming exam. For your
information, during the midterm and final exams, students are not allowed to bring laptops, mobile phones
or electronic devices into the examination room, meaning that you will write your answers on the answer
sheets and solve all problems with your calculator only.
1
SCHEDULING AND SEQUENCING – SEMESTER 02 – 2024-2025
PROBLEM SET
Q1. (25 pts)
Apply profile fitting heuristic, find the sequence for this flow shop problem.
Job 1 2 3 4
Machine 1 3 6 4 4
Machine 2 5 6 4 4
Machine 3 5 5 5 3
Machine 4 5 4 3 3
Q2. (25 pts)
Given the following job shop problem, apply the 1st iteration of the shifting bottle neck algorithm to find
the sequence on the machine.
Job Sequence Processing Time
1 1,2,3 𝑝𝑝1,1 = 4, 𝑝𝑝2,1 = 4, 𝑝𝑝3,1 = 5
2 2,1,3 𝑝𝑝2,2 = 3, 𝑝𝑝1,2 = 4, 𝑝𝑝3,2 = 5
3 3,1,2 𝑝𝑝3,3 = 4, 𝑝𝑝1,3 = 2, 𝑝𝑝2,3 = 4
Q3. (25 pts)
Apply the graph coloring algorithm to find the schedule for the following problem
Job 1 2 3 4 5 6 7 8
Res 1 1 0 1 0 0 0 1 0
Res 2 0 1 0 0 1 1 0 1
Res 3 1 0 0 1 0 0 1 0
Res 4 0 1 1 1 1 1 0 1
a) Find the conflict matrix and degree of each job.
b) Apply the graph coloring algorithm to find the schedule.
Q4. (25 pts)
Given the following data
Job 1 2 3 4
𝑤𝑤𝑖𝑖 2 3 2 5
2
SCHEDULING AND SEQUENCING – SEMESTER 02 – 2024-2025
𝑝𝑝𝑖𝑖 1 2 2 2
𝑟𝑟𝑖𝑖 0 2 4 0
𝑑𝑑𝑖𝑖 7 6 7 6
Machine 1,2 1 2 2
The number of both machine type 1 and type 2 are 1.
a) Calculate the priority of each job.
b) Write down the summary table of possible resource usage when no job is assigned.
c) Assign the 1st job with the highest priority then write down the table of the update resources and
possible resource usage.
– THE END –
