SCHEDULING

Scheduling
Scheduling
encompasses
allocating
workloads to specific workcenters and
determining the sequence in which
operations are to be performed
Effective Scheduling can increase cost
savings and increase productivity
The objective of scheduling jobs could be
minimization of lateness, minimization of
total processing time etc.

Job Shop Processing

The activities included in
Processing includes:
Customized Products
Low Product Volume
Labor Intensive Operations
Interrupted Product Flow
Large Product Mix
High skill of workers required

Job

Shop

Job Sequencing
Workstations: An area where a group of
machines/workers perform similar work
Job Time: Sum of Setup and Processing time
Makespan: The total time needed to
complete a group of jobs from the beginning
of the first job to the last job.
Job Flow Time: The length of time a job
spends at the workstation and is the sum
processing time and waiting time
Job Lateness=Max(Comp._Dt-Due_Dt,0)
Avg.
No.
of
Jobs=Total
Flow
Time/Makespan

Priority Rules for Job Sequencing

FCFS
SOT (Shortest Operating Time)
EDD (Earliest Due Date)
STR (Slack Time Remaining)
STR/OP (Slack Time Remaining per
Operation)
CR (Critical Ratio)= (Due Date-Current
Date)/No. of working days remaining
LCFS
Random
5

Example (n Jobs on One Machine)

Calculate Average Flow Time, Average
Tardiness, Average no. of jobs at a work
center
Jobs

Processing Time

Due Date

15

21

19

12

26

31
6

n Jobs on Two Machines (Johnsons Rule)

Jobs

WC1

WC2

Assignment Problem
A Linear Programming Model for optimal
assignment of tasks and resources
Examples assigning jobs to machines or
workers, assigning areas to salespersons etc.
We will use Hungarian Method to solve the
assignment problem

Assignment Problem
Solve the following assignment problem
using Hungarian Method

Machines
Jobs