Download - English scheduling microclase
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
SCHEDULINGIng. JUAN ANGEL CHICA URZOLA, Esp. Ms.C.
1
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
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.
2
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
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?
3
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
¿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.
4
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
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.
5
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• 1st case: n jobs 1 machine
• 2nd case: n jobs 2 machines
• 3th case: n jobs m machines ( n≥⩝ 3)
6
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
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.
7
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
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.
8
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
Classes of Schedules• FIFO: First In First Out
• LIFO: Last In First Out
• SPT: Shortest Processing Time
• EDD: Earliest Due Date
• PS: Priority Scheduling
9
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
EXAMPLE• INPUT DATA
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
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
FIRST CASE: n Jobs 1 Machines
11
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• FIFO:
12
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTijnj in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• LIFO:
13
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTijnj in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• SPT:
14
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTijnj in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• EDD:
15
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTijnj in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• PS:
16
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTijnj in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
SECOND CASE: n Jobs 2 Machines
17
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• FIFO:
18
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2)
nj in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• LIFO:
19
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2)
nj in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• SPT:
20
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2)
nj in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• EDD:
21
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2)
nj in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• PS:
22
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2)
nj in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
THIRD CASE: n Jobs m Machines
23
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
• SPT:
24
Ptijnj Rj DDj Wj m1 m2 m3A 1 08-abr-13 2 11 1 12B 2 12-feb-13 1 12 14 11C 3 08-dic-12 4 15 9 9D 4 24-abr-13 3 10 13 8
Order j1 2 3 4
PTij (M1) PTij (M2) PTij (M3)
nj in out in out in out
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
ACTIVITY
25
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
26
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
Independent Homework
27
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
28
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
29
Ing.
Juan
Ang
el C
hica
Urz
ola,
Esp
, M
s.C
Additional Reading
• PINEDO, Michael L. Scheduling Theory, Algorithms, and Systems. Ed. Springer.
Or Select National and InternationalJournals 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 Manufacturing6. 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.
30