PROGRAMMING OF

THE OPERATIONS
 DEFINITION
Operations programming is a technique that
it consists of identifying, organizing and ordering in sequence
logic, all the activities derived from a project,
production program or plan and place them at the height of the
time in which they are carried out, within the total time of
project.
The above implies preserving relationships of
interdependence of activities, as well as to assign
times, responsible for execution and verification of
resources for each of the activities.
To program the operations in a company, it is
It is necessary to have at least the following variables.
• Activities
• Time
• Responsible
 ACTIONS
Considering these variables, we must
proceed to perform the following actions:
• Check the time when the project should be executed.
• Identify the type of product or service that will be provided
• Obtain the complete list of activities and tasks of the project
• Organize activities by work areas
(departments, sections, job positions)
• Arrange all activities in logical sequence
• Establish the interdependence of activities to
carry out and determine those that are simultaneous with others
• Define the start and end date of each activity
time allocation
 ACTIONS
• Create the graphs that show the schedule
established
• Verify the allocation of resources to each activity
• Execute and control the operations management.
 OBJECTIVES OF THE
PROGRAMMING OF
OPERATIONS

GENERAL OBJECTIVE
Achieve uniform movement and
rhythmic of the products through
the stages of production.
 SPECIFIC OBJECTIVES

•Anticipate time losses or the

overloads among the centers of
production.
•Keep the workforce occupied.
•Meet the deadlines of
established delivery.
•Facilitate daily and periodic control
of the tasks.
 TERMINOLOGY

The production scheduling is

affected by:
•Materials
•Staff capacity
•Production capacity of the
machinery
•Production systems
 TERMINOLOGY
In programming, terms will be handled.
of measurement thus seeking to minimize the
costs or maximize profit, these
son
• WORK
• MACHINE
• MEASUREMENTS IN TIME
• SEQUENCE
 Importance
It allows us to organize work more rationally.
to carry out as well as to know the right moment,
when an activity should start and when it should
to conclude, what relationship does it have with other activities and
who is responsible. This decreases the
uncertainty about what needs to be done and in what
what remains to be done is to know how to distribute time and resources
to achieve the objectives.
 Techniques
• Pert Technique
cpm
cost
• Gantt technique
• other techniques
ABC bar chart, Roy
 Types of programming
Programming is classified in two ways:

By methods:
• Forward programming.
• Backward programming.
By type of production system:
• Programming a machine.
• Parallel machine scheduling.
• Intermittent programming.
• Continuous programming.
 Types of programming
Forward programming:
Forward programming consists of programming
all available jobs to get started so
as soon as the requirements are known. This
Immediate execution may result in termination
early work at the cost of more jobs in
process and higher costs of carrying more inventory of
necessary.
 Forward programming
Forward programming starts the program
as soon as the needs are known:
• The work is done at the request of the client.
• The program can be carried out even if it means not
meet the delivery date.
• It often leads to an inventory accumulation of
work in progress.
 Backward programming

Backward programming uses the same logic of

eliminate waiting time of PRM. The components
they are delivered "more is needed" than "as soon as"
as possible.
Backward programming starts with the date of
delivery, programming the last operation first. The
stages of the work are scheduled, one by one, in
reverse order
• It is usually used by the majority of the
producer companies of goods
 Objectives
• It takes into account the time of the operations.
• Short-term bases: weekly, daily or hourly.
• Minimize the completion time.
• Maximize utilization (what makes effective use of
personal and equipment.
• Minimize the work in progress inventory (keeps the
low inventory levels)
• Minimize customer wait time.
Forward programming
and backwards

Program forward Backward Program

B E B E

Today Date Today Date

Awake Awake
HEURISTIC ALGORITHM
A heuristic algorithm is an algorithm
that is based on knowledge
expert or external information for
draw conclusions about the problem
what occupies you. Generally not.
they guarantee optimal solutions but
allow them to be approximated in a manner
efficient.
 PERT
While PERT is a system
probabilistic, since it takes into account the
statistical possibility of three times
optimistic, probable, and pessimistic, the CPM is
a deterministic system, since the
estimation of the duration times of
the activities are carried out on the basis of the
experience.
 PERT
PERT is useful when activities can be
carried out in parallel instead of sequentially.
Reasons for using a PERT diagram in
Gantt place:
The easy identification of the order of precedence.
The easy identification of the critical path.
3) The easy determination of the slack time.
The PERT allows considering three possible occurrences of the
time:
1. Optimistic deadline (to). Time needed to
carry out the activity if no difficulties arise or
any unforeseen event. It is the least possible time in which it
you can carry out the activity.
2. Most probable deadline (tn). Most probable time for it to happen
I need for the completion of the activity.
3. Pessimistic duration (tp). It is the maximum time needed.
to carry out the activity if difficulties arise
unexpected.
Of course, there are greater probabilities that the
project to be completed in the normal time as in the
optimistic or pessimistic time. Therefore, to time
normal should be given a value greater than the one that will be given
the optimistic and pessimistic time.
This will give a single time for each activity called time
dear and is represented by the letter 'Te':
Te = (To + 4Tn + Tp) / 6
The deviation, represented by the letter 'o', will give us
an idea of the probability of reducing or expanding
the estimated time for each activity. The PERT formula
to determine the standard deviation derived from the
pessimistic and optimistic times are the following:
o = (tp - to)/6
Variation is to describe the uncertainty associated with the
activity.
The symbol to indicate variation is o2 and the equation for
to calculate it is:
o2 = ((tp-to)/6)2
What gives us a clear idea of the average of
negative or positive dispersion of the estimated time.
 PROGRAMMING IN
CONTINUOUS PRODUCTION OR
FLOW SHOP
In this workshop, the machines are arranged in such a way that the
the flow of all products that are processed in them is
unidirectional. There are machines and there may be jobs that
have fewer burning operations.
 PROGRAMMING IN
CONTINUOUS PRODUCTION OR
FLOW SHOP
This problem is very complicated due to its
combinatorial character. If the jobs are processed
in the machines, there are (n!)m alternatives for
programming. For example, if it is necessary to plan
5 jobs on 3 machines are available for 1,728,000.
different alternatives. So far, there is only
the static case of the flow is optimally resolved
shop of two machines. The algorithm that minimizes the
manufacturing interval is Johnson's Algorithm.
 THE JOHNSON ALGORITHM
PASO 1. Formar una lista con todos los trabajos y dos listas más
(one for
each machine). The list of the first machine is completed by
left to right; that of the second from right to left.
STEP 2. Find the job with the shortest processing time
(pi).
Ties can be broken randomly.
STEP 3. If the time corresponds to the first machine, put the
work
on the list of the first machine. If it is from the second, put the
I am working on the list of the second machine.
STEP 4. Repeat until the job list is empty.
The algorithm aims for machines to be idle for the least amount of time possible.
detained.
 PROGRAMMING IN
CONTINUOUS PRODUCTION OR
FLOW SHOP

In addition to the Johnson algorithm, there are

methods for this programming like the
permutation program, the algorithm
CDS and approaches such as branching and
demarcation, among others.
 Program a single machine
In this type, the jobs consist of a single
operation that is
performed on a single machine. In this case, it is
possible to obtain an optimal sequence
from the jobs that minimized a characteristic
chosen by the planner, as it
you will see later.
 Program a single machine
Static case

In this case, n jobs must be planned and all of them are

available at the initial moment. The processing times are
constants and knowns.

Minimize the average flow time

Se deben ordenar los trabajos según la regla de despacho SPT

(time of
minor processing), that is to say,

p1 < p2 < p3 < ... < pn

It is intuitively verified that, by assigning in this way the

jobs, the time each of them spends in the workshop (at
depends on the jobs that are processed before it) is reduced
if those with less are processed first time of
processing.
 Program a single machine
Minimize the maximum delay

The maximum delay corresponds to the most delayed work. In this case, the rule
EDD (earliest due date) optimizes the sequence.

Detailed planning

d1<d2<d3<…<dn

This sequence suggests doing first those tasks that need to be submitted.
before

Logically, this ordering will have a higher value of the average flow of time.
It is practically impossible to obtain a sequence that optimizes two criteria.
at the same time and, almost always, it will be necessary to establish priorities to decide the
better planning.
 Program a single machine
Minimize the number of delayed jobs

To minimize the number of delayed jobs, it is necessary to apply the

Moore's algorithm, which consists of 4 steps.

STEP 1. Sort the jobs according to the EDD rule, such that d1 < d2 < d3 < … < dn

STEP 2. Find the first delayed job in the list (job i).

STEP 3. In the sequence 1,2,...,i find the job with the longest time.
of processing.

Remove that job and return to STEP 2.

STEP 4. Complete the sequence by adding in any order the

rejected jobs in STEP 3.

The only delayed jobs will be those added at the end of the
planning, and they are the smallest number possible.
 Program a single machine
Dynamic case

In the workshop, n tasks that are not available must be planned.

they
at the initial moment. The processing times are constant and
known.

Minimize the average flow time

In the event that it is not allowed to stop the ongoing work

processing the SPT dispatch rule (shortest processing time)
it is still the one that minimizes the average flow of time, that is,

p1<p2<p3<…<pn (of the assignable tasks)

In this second case, it is important to take into account the increase in cost.
what
would imply increasing the number of changes and the duration of the change of
article that is being processed, since on numerous occasions when
to resume work on the machine, the change must be repeated.
Sometimes it is possible to stop the
manufacturing of an item, process a
new job and then continue with the
previous work. In the case that yes, it
allow stopping the work that is being done
processing the SRPT dispatch rule
remaining processing time
lower) minimizes the average time flow.
This rule assumes that, upon receiving a new job,
the processing time that is compared
stay at work that is in the machine and the
processing time for incoming work.
The work of shorter duration will be planned.
remainder.

In this case, the duration of the change times.

it is crucial, as the machine must prepare itself
for the new job and to prepare again for
the previous product, preparation that has already been done
at the right time and must be repeated.
Minimize the maximum delay

It only makes sense to pose this problem in the

caso en que se permita posponer y reanudar.
In this case, the EDD rule (delivery date
latest) continues optimizing the sequence.

d1 < d2 < d3 < … < dn (of the jobs)

assignable)