Sequencing and Scheduling

(Chapter 15)

Alok Raj
PODS Area
Office: Room No 14, 2nd Floor, Library Building, Tel. 3439
Email: [email protected]

INTRODUCTION
 Physician scheduling
Classroom Scheduling

Airline Scheduling Job Scheduling

Scheduling Approach
🞂 Forward Scheduling- It is a scheduling approach that starts with
the job's or project's start date and schedules tasks or activities in
chronological order, moving forward from the start date. E.g., Hospitals,
clinics, restaurants
🞂 Backward Scheduling-It is a scheduling approach that starts with
the project's or job's end date and schedules tasks or activities in reverse
chronological order, working backward from the end date to determine start
dates for each activity. E.g., Scheduling surgery, Aircraft manufacturing
Different aspect of

Scheduling ❖Inputs

❖Objectives

❖How we will meet these objectives

Objectives of scheduling
🞂 Meet due dates, Minimize lead time, Minimize setup time or
cost, Minimize work-in-process inventory, Maximize machine
 utilization
🞂 In order to achieve these objectives, we do job sequencing
Sequencing
🞂 It is the process of determining the job order on machines or
work centers. It is also known as priority sequencing (Based on
the priority rules of the firm)
Priority rules
🞂 These are the set of rules used in obtaining a job sequence
🞂 It can be simple or complex (depends on the product type)
🞂 It can use one or more pieces of information
Different types of
 Sequencing/Scheduling(Manufacturing) Scheduling/Sequencing

Single Machine processing time m machines Scheduling

Flow shop
Job Shop
(Two machine/Three Johnson’s
Shortest machine) Assigning n jobs on Shift
served (FCFS)
method Gantt Chart
Due date
(SPT) method method method
Assignment
First come first method

Scheduling for service organizations

In many service organizations, scheduling is complicated because service
demand— quantity, type of service, and timing—is often variable and hard to
forecast.
Scheduling Employees
Organizations may not always be able to schedule demand, the alternative is to
manage capacity in the way they schedule employees.
Nurse scheduling problem
❖ The administration of a leading hospital in Bangalore wants to schedule the
duties for nurses under different shifts.
❖ Everyshifts is for three hours duration, a nurse who joins a shift will have to
work for six hours at a stretch.
❖ The hospital administration would like to schedule the nurse duty and for
this they will first like to know the minimum number of nurses to do the
jobs every day.
PERIOD

1 2 3 4 5 6 7 8

Shift 07AM-10 10AM-1 1PM-4 PM 4PM-7 PM 7 PM-10 10 PM-01 AM 1AM-4 AM 4AM-7 AM

AM PM PM

Nurses 80 65 40 45 65 35 25 45
Needed

PERIOD

1 2 3 4 5 6 7 8
 Shift 07AM-10 10AM-1 1PM-4 PM 4PM-7 PM 7 PM-10 10 PM-01 AM 1AM-4 AM 4AM-7 AM
AM PM PM

Nurses 80 65 40 45 65 35 25 45
Needed

N-jobs on 1 Machine or n/1Problem (Single Machine)

N Jobs and single machine problem

Job Time since order Processing time Due Date
arrived (days ago)
 (days) (days from now)

J1 8 4 6

J2 5 8 12

J3 4 3 18

J4 2 7 10

J5 6 2 3

Job Time Processing Due D SPT Makes Averag Average

since Time (days) (days f pan e flow tardiness
order now time Time
arrived
(days ago) 4.2
24 16.2
J1 8 4 6
EDD 24 18.2 3.6
J5 6 2 3
J2 5 8 12 FCFS 24 18 3.8
J3 4 3 18
J4 2 7 10
 N-Jobs on 2 Machines or n/2 Problem(Flow shop)
Assumptions: completed at the first work centre

Jobs M1 (hours) a) All jobs must follow the same two before

M2 (hours) Due dates step work sequence b) A job must be

J1 10 6 40 J2 6 12 18 J3 8 9 32 J4 8 10 30 M1 M2
J5 12 5 51

The rule can be explained by the following steps: 1. List

the operation time for each job on both machines 2. Select
Johnson’s Rule: Minimize the makespan of the shortest operation time (across both the machines) 3. If
jobs the shortest time is for the first machine, do the job first. 4.
If the shortest time is for the second machine, do the job
the jobs moves on the second work centre last. 5. Tie-Breaker Rule: In the case of a tie, do the job on
the first machine
6. Repeat Steps 2 –5 for each remaining job until the
schedule is complete.
J1, J2, J3, J4, J5
Jobs M1 (hours) M2 (hours) Due dates

J1 10 6 40 J2 6 12 18 J3 8 9 32 J4 8

10 30 J5 12 5 51

Scheduling n-Jobs on n-Machines or

n/n Problem (Assignment problem)
🞂 There
are 5 jobs and they can be performed in any 5 machines.
The cost of completion is given in the following table for each
job-machine combination. Design allocation of jobs for
minimum cost criterion. The processing time is as follows:
M1 M2 M3 M4 M5

J1 5 6 4 8 3

J2 6 4 9 8 5

J3 4 3 2 5 4

J4 7 2 4 5 3

J5 3 6 4 5 5
The Assignment Problem (General

formulation)
 The assignment model can be expressed
mathematically as follows:
Xij= 0, if the job j is not assigned to machine i
1, if the job j is assigned to machine i
Exercise
Samual engineering company is based at Trivandrum. It has received orders from a
large public-orders from a large public sector company to manufacture five
components (J1-J5) to be used in Aircraft.
The processing time of the various jobs on the machines from past experience are
given in below

Table. Assign the jobs to be machines such that the total processing time is
minimum. Also find the minimum total processing time of the Jobs

M1 M2 M3 M4 J1-M1
J2-M3
J1 12 18 11 22 J3-M5
J2 10 10 8 7 J4-M2
J5-M4
J3 17 5 16 18

J4 9 7 19 21
The optimal processing time=
J5 13 12 20 4 12+8+10+7+4=41

Job shop Scheduling

Job Route Due date

J1 M1(7)→M3(8)→M2(10) 33

J2 M2(6) →M1(4) →M3(12) 26

J3 M1(8) →M2(8) →M3(7) 22