Operations Management: Topic: Scheduling. DR - Nitin Kubde
Operations Management: Topic: Scheduling. DR - Nitin Kubde
Operations Management: Topic: Scheduling. DR - Nitin Kubde
Topic : Scheduling.
Dr.Nitin Kubde.
How Scheduling
fits the Operations Management
Philosophy
Operations As a Competitive
Weapon
Operations Strategy
Project Management
Process Strategy
Process Analysis
Process Performance and Quality
Constraint Management
Process Layout
Lean Systems
Scheduling
Scheduling: The allocation of resources over time
to accomplish specific tasks.
Demand scheduling: A type of scheduling
whereby customers are assigned to a definite time
for order fulfillment.
Workforce scheduling: A type of scheduling that
determines when employees work.
Operations scheduling: A type of scheduling in
which jobs are assigned to workstations or
employees are assigned to jobs for specified time
periods.
2007 Pearson Education
Scheduling
Customer Demand
Three methods are commonly used to schedule
customer demand:
(1) Appointments assign specific times for service
to customers.
(2) Reservations are used when the customer
actually occupies or uses facilities associated
with the service.
(3) Backlogs:
The customer is given a due date for the
fulfillment a product order, or
Allow a backlog to develop as customers arrive
at the system. Customers may never know
exactly when their orders will be fulfilled
Scheduling Employees
Rotating schedule: A schedule that rotates
employees through a series of workdays or hours.
Fixed schedule: A schedule that calls for each
employee to work the same days and hours each
week.
Constraints: The technical constraints imposed on
the workforce schedule are the resources provided
by the staffing plan and the requirements placed on
the operating system.
Other constraints, including legal and behavioral
considerations, also can be imposed.
2007 Pearson Education
Objectives of Operations
Scheduling
Discussion
Discussion (cont)
Purpose Of Scheduling
Enables a firm to allocate production capacity to
meet customer requirements
Scheduling Methods
Scheduling methods depends on volume of production
and the nature of operation.
Forward Scheduling
Backward Scheduling
Forward Scheduling
When the actual production activities
starts
Determines the start and finish times of
the job
WIP inventory level is high
Backward Scheduling
Schedules according to the due dates
Determines the latest times.
Basically done in service organizations.
SCHEDULING ACTIVITIES
Operations schedules are short-term plans
designed to implement the master production
schedule.
Operations scheduling focuses on how best to use
existing capacity.
Often, several jobs must be processed at one or more
workstations. Typically, a variety of tasks can be
performed at each workstation.
Raw Materials
Shipping Department
Manufacturing Process
Legend:
2007 Pearson Education
Batch of parts
Workstation
Job Shop
Dispatching
Dispatching: A method of generating schedules in job
the time remaining until a jobs due date by the total shop time
remaining for the job.
CR = (Due date Todays date)/Total shop time remaining
Total Shop Time = Setup, processing, move, and expected
waiting times of all remaining operations, including the operation
being scheduled.
Job Shop
Dispatching
Slack per remaining operations (S/RO): A
priority sequencing rule that determines
priority by dividing the slack by the number
of operations that remain, including the one
being scheduled.
S/RO = ((Due date Todays date) Total shop time remaining)
Number of operations remaining
Performance Measures
Job flow time: The amount of time a job spends in the
hand inventories.
Utilization: The percentage of work time that is
productively spent by an employee or machine.
Gantt Charts
Gantt chart: are simple bar charts that can be
used to schedule any type of operation
The chart takes two basic forms: (1) the job or activity
progress chart, and (2) the workstation chart.
Actual progress
4/17 4/18 4/19 4/20 4/21 4/22 4/23 4/24 4/25 4/26
Ford
Plymouth
Pontiac
2007 Pearson Education
Johnsons Rule
Johnsons rule: A procedure that minimizes makespan
when scheduling a group of jobs on two workstations.
Step 1. Find the shortest processing time among the jobs not
yet scheduled. If two or more jobs are tied, choose one job
arbitrarily.
Step 2. If the shortest processing time is on workstation 1,
schedule the corresponding job as early as possible. If the
shortest processing time is on workstation 2, schedule the
corresponding job as late as possible.
Step 3. Eliminate the last job scheduled from further
consideration. Repeat steps 1 and 2 until all jobs have been
scheduled.
2007 Pearson Education
Example 16.5
Johnsons Rule
Time (hr)
Motor
M1
M2
M3
M4
M5
Workstation 1
12
4
5
15
10
Workstation 2
22
5
3
16
8
Eliminate
M3
from
consideration.
The
next
shortest
time
Eliminate
M1
and
the
only
job
remaining
to
be
Eliminate
M5
from
consideration.
The
next
shortest
time
is
Eliminate
M2
from
consideration.
The
next
shortest
time
is
Shortest time is 3 hours at workstation 2, so
isat
M2
at Workstation
1,schedule
so schedule
M2
first.
scheduled
is
M4.
M1
at
workstation
#1,
so
schedule
M1
next.
M5
workstation
#2,
so
M5
next
to last.
schedule job M3 last.
2007 Pearson Education
Sequence = M2
M1
M4
M5
M3
Example 16.5
Johnsons Rule
M1
(12)
Idle M2
(5)
2
0
M4
(15)
M3
(5)
M1
(22)
Idle
10
M5
(10)
15
20
25
Idleavailable
for further work
M4
(16)
30
35
Day
40
45
M5
(8)
50
55
M3
(3)
60
65
Scheduling By Type Of
Operations
Different for different types of operations
Types of Operations
Job Operation
Repetitive Operations
2007 Pearson Education
Labor-limited
Environments
The limiting resource thus far has been the number of
machines or workstations available. A more typical constraint
is the amount of labor available.
Linking Operations
Scheduling to the Supply Chain
Advanced planning and scheduling (APS)
systems: Systems that seek to optimize resources across
1.
2.
3.
4.
Thank You