The document discusses scheduling concepts and their applications in manufacturing and service industries. It aims to provide students with the necessary elements to design task scheduling strategies for any type of company considering competitiveness goals. Key concepts covered include: - Scheduling deals with allocating resources to tasks over time periods to optimize objectives like throughput or lateness. - Common scheduling problems involve a finite number of jobs and machines. Notation is introduced for processing times, release dates, due dates, weights. - Classes of schedules are defined including sequences, schedules, and policies. Common policies discussed are FIFO, SPT, EDD, and priority-based scheduling. - Examples are provided to illustrate scheduling different numbers of jobs on one,

1. SCHEDULING
Ing. JUAN ANGEL CHICA URZOLA, Esp. Ms.C.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
1

2. OBJETIVOS
• Identificar los conceptos de relacionados con scheduling y su
ámbito.
• Proporcionar al estudiante los elementos necesarios para que
diseñe una estrategia de programación de tareas en cualquier
tipo de empresa considerando sus expectativas de
competitividad.
• Mostrar las diferentes decisiones estratégicas y tácticas que
existen en el ámbito de la programación de la producción y las
operaciones para alcanzar la competitividad de las empresas.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
2

3. PREGUNTAS
• ¿Qué entendemos por Scheduling?
• ¿Cuáles son los principales elementos presentes en el
Scheduling?
• ¿Qué aplicaciones tiene en el mundo actual empresarial?
• Cuáles son los casos esenciales que conforman el scheduling?
• ¿Cuáles son los tipos de estructuras y modelos?
• ¿Qué impacto tienen en la gestión empresarial?
• ¿Qué aplicaciones puede tener el scheduling en la gestión de
las operaciones de una organización y la futura vida
profesional del estudiante?
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
3

4. ¿QUÉ ES?
Scheduling is a decision-making process that is used on a
regular basis in many manufacturing and services industries.
It deals with the Allocation of resources to tasks over given
time periods and its goal is to optimize one or more
objectives.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
4

5. Framework
• In all the scheduling problems considered the number of jobs
and the number of machines are assumed to be finite. The
number of jobs is denoted by n and the number of machines
by m.
• Usually, the subscript j refers to a job while the subscript i
refers to a machine.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
5

6. • 1st case: n jobs 1 machine
• 2nd case: n jobs 2 machines
• 3th case: n jobs m machines (⩝ n≥ 3)
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
6

7. Notation
• Processing time (pij) The pij represents the processing time of
job j on machine i.
• Release date (rj ) The release date rj of job j may also be referred
to as the ready date. It is the time the job arrives at the system,
i.e., the earliest time at which job j can start its processing.
• Due date (dj) The due date dj of job j represents the committed
shipping or completion date (i.e., the date the job is promised to
the customer). Completion of a job after its due date is allowed,
but then a penalty is incurred.
• Weight (wj) The weight wj of job j is basically a priority factor,
denoting the importance of job j relative to the other jobs in the
system.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
7

8. Classes of Schedules
In scheduling terminology a distinction is often made between a
sequence, a schedule and a scheduling policy.
• A sequence usually corresponds to a permutation of the n jobs or
the order in which jobs are to be processed on a given machine.
• A schedule usually refers to an allocation of jobs within a more
complicated setting of machines, allowing possibly for
preemptions of jobs by other jobs that are released at later
points in time.
• The concept of a scheduling policy is often used in stochastic
settings: a policy prescribes an appropriate action for any one of
the states the system may be in. In deterministic models usually
only sequences or schedules are of importance.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
8

9. Classes of Schedules
• FIFO: First In First Out
• LIFO: Last In First Out
• SPT: Shortest Processing Time
• EDD: Earliest Due Date
• PS: Priority Scheduling
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
9

10. EXAMPLE
• INPUT DATA
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
10
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8

11. FIRST CASE: n Jobs 1 Machines
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
11

12. • FIFO:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
12
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij
nj in out

13. • LIFO:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
13
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij
nj in out

14. • SPT:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
14
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij
nj in out

15. • EDD:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
15
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij
nj in out

16. • PS:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
16
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij
nj in out

17. SECOND CASE: n Jobs 2 Machines
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
17

18. • FIFO:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
18
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2)
nj in out in out

19. • LIFO:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
19
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2)
nj in out in out

20. • SPT:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
20
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2)
nj in out in out

21. • EDD:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
21
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2)
nj in out in out

22. • PS:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
22
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2)
nj in out in out

23. THIRD CASE: n Jobs m Machines
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
23

24. • SPT:
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
24
Ptij
nj Rj DDj Wj m1 m2 m3
A 1 08-abr-13 2 11 1 12
B 2 12-feb-13 1 12 14 11
C 3 08-dic-12 4 15 9 9
D 4 24-abr-13 3 10 13 8
Order j
1 2 3 4
PTij (M1) PTij (M2) PTij (M3)
nj in out in out in out

25. ACTIVITY
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
25

26. Ing.JuanAngelChicaUrzola,Esp,
Ms.C
26

27. Independent Homework
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
27

28. Ing.JuanAngelChicaUrzola,Esp,
Ms.C
28

29. Ing.JuanAngelChicaUrzola,Esp,
Ms.C
29

30. Additional Reading
• PINEDO, Michael L. Scheduling
Theory, Algorithms, and Systems.
Ed. Springer.
Or Select National and International
Journals such as:
1. International Journal of
Production Research,
2. International Journal of
Production Economics,
3. International Journal of Supply
Chain Management,
4. International Journal of Quality &
Reliability Management,
5. International Journal of Computers
Integrated Manufacturing
6. European Journal of Industrial
Engineering,
7. Journal of Advances in
Management Research,
8. Asian Academy of anagement
Journal,
9. Computers & Industrial
Engineering,
10. Journal of Engineering
Manufacture,
11. Logistics Information
Management.
Ing.JuanAngelChicaUrzola,Esp,
Ms.C
30