Scribd
Upload
82 views3 pages

Midterm Scheduling - International University - Sample Test

This document contains 4 questions related to operations research modeling and algorithms: 1. Defines a network with precedence constraints and jobs with processing times, asking to find the critical path and calculate earliest/latest start/finish times. 2. Presents a project scheduling problem to maximize profit by assigning labor types to jobs based on skill requirements, defining decision variables and parameters to develop a mathematical model. 3. Applies the shifting bottleneck algorithm to a job shop scheduling problem with processing times on 3 machines over 2 iterations. 4. Formulates an assignment problem to minimize changes from an original solution by linearizing an objective to minimize the difference between new and old assignment variables.

Uploaded by

Duyen Nguyen Thuy Hanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
82 views3 pages

Midterm Scheduling - International University - Sample Test

This document contains 4 questions related to operations research modeling and algorithms: 1. Defines a network with precedence constraints and jobs with processing times, asking to find the critical path and calculate earliest/latest start/finish times. 2. Presents a project scheduling problem to maximize profit by assigning labor types to jobs based on skill requirements, defining decision variables and parameters to develop a mathematical model. 3. Applies the shifting bottleneck algorithm to a job shop scheduling problem with processing times on 3 machines over 2 iterations. 4. Formulates an assignment problem to minimize changes from an original solution by linearizing an objective to minimize the difference between new and old assignment variables.

Uploaded by

Duyen Nguyen Thuy Hanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Question 1: (25 points)

Given the following network with precedence constraint as the graph below:
The processing time of each job is given as

Job 1 2 3 4 5 6 7 8
Processing Time 5 4 6 10 8 5 11 7

a) Find the Critical Path of this network (10pts)


b) For each job, find the earliest starting time, earliest completion time, latest starting time, latest completion
time. (15pts)
Question 2: (25 points)
A company ABC receives 5 Jobs, J1, J2, J3, J4 and J5. The data for each project are given as follows:

Project Income Skill A Skill B Skill C


J1 40 5 3 3
J2 45 4 5 2
J3 35 3 3 3
J4 48 4 4 6
J5 52 3 3 8

For example, the job J1 gives the income of 40 and requires 5 people to work in the field A, 3 in field B, and 3 in
field C. One people can only work in one field. The company has 5 types of labors with the information given as
follows:

Labour Available Unit Cost Skill A Skill B Skill C


Type 1 9Number 2 ✓ ✓
Type 2 10 1.9 ✓ ✓
Type 3 12 3 ✓ ✓
Type 4 15 1.7 ✓
Type 5 15 1 ✓
For Type 1, the labors can work in either field A or field B and the unit cost for using type 1 labor is 2/labor. The
objective function is to maximize the profit, i.e., profit=total income-total labor cost. Assume that all jobs have the
same starting time and finishing time and the company can discard some jobs if they do not have enough labors.
Let
Zi be the binary variable. Zi =1 if job Ji is adopted; otherwise, Zi =0
Xijk be the number of labor type j with using ability k in the job i
a) Define other parameters and make the mathematical model for this problem (15pts)
b) Convert the math model in question a to the CPLEX code. (10pts)
Question 3: (30 points)
Given the job shop system as below:

Job Sequence pij: processing time on machine i of job j

1 1,2,3 𝑝11 = 4, 𝑝21 = 5, 𝑝31 = 8

2 2,1,3 𝑝22 = 7, 𝑝12 = 7, 𝑝32 = 9

3 1,3,2 𝑝13 = 4, 𝑝33 = 4, 𝑝23 = 4

Assume that the sequence on the machine 1 is already determined as broken arcs. Apply the Shifting Bottle Neck
Algorithm for 2 next iterations (30pts)
Question 3: (20 points)
Consider the assignment problem as
Size of the problem

i : index of the worker

j : index of the job
Parameters
𝐸𝑖𝑗 = 1: if the worker i is able to be assigned to job j otherwise; 𝐸𝑖𝑗 = 0
𝐵𝑖𝑗 : the benefit if the worker i is assigned to job j

Decision variables

Xij : binary variable , Xij = 1 if the worker i is assigned to the job j otherwise Xij = 0.
Objective:
𝐼 𝐽

𝑚𝑎𝑥 𝑍 = ∑ ∑ 𝐵𝑖𝑗 𝑋𝑖𝑗


𝑖=1 𝑗=1
Constrainst:
𝐼

∑ 𝑋𝑖𝑗 = 1, ∀𝑗
𝑖=1
𝐽

∑ 𝑋𝑖𝑗 = 1, ∀𝑖
𝑗=1

Assume that all 𝑋𝑖𝑗 have been found, but some worker is replaced by other worker so the matrix 𝐸𝑖𝑗 is updated. Now
it is required to reschedule the problem but the objective function is changed to minimize the change.
Let 𝑌𝑖𝑗 be the solution of the new schedule,
Let 𝑆𝑖𝑗 be the solution of old schedule and already found in the 1st step 𝑆𝑖𝑗 = 𝑋𝑖𝑗
The 2nd problem now changes to
𝐼 𝐽

𝑚𝑖𝑛 𝑍 = ∑ ∑|𝑌𝑖𝑗 − 𝑆𝑖𝑗 |


𝑖=1 𝑗=1
Make the mathematical model for this problem and linearize this problem. (Hint: Using the guide of building
constraints)

You might also like