Scribd
Upload
8 views

Chapter 3. Parallel Machine Model

The document discusses parallel machine models and heuristics algorithms for scheduling jobs on parallel machines. It provides examples and exercises for students to determine optimal job sequences and minimize completion time using different rules.

Uploaded by

learn2grow.khaile
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Chapter 3. Parallel Machine Model

The document discusses parallel machine models and heuristics algorithms for scheduling jobs on parallel machines. It provides examples and exercises for students to determine optimal job sequences and minimize completion time using different rules.

Uploaded by

learn2grow.khaile
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

08/01/2024

CHAPTER 3:
PARALLEL MACHINE MODEL

Assoc. Prof. Dr. DO NGOC HIEN


Department of Industrial Systems Engineering (ISE )
Faculty of Mechanical Engineering (FME)
HoChiMinh City University of Technology (HCMUT)

1 Phone:
Email: [email protected]

PARALLEL MACHINE MODELS

1
08/01/2024

PARALLEL MACHINE MODEL

WHERE CAN YOU RECOGNIZE THE


PARALLEL MACHINES MODELS?

2
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

PARALLEL MACHINES
HEURISTICS ALGORITHMS

3
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

PARALLEL MACHINES
HEURISTICS ALGORITHMS

4
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

PARALLEL MACHINES
HEURISTICS ALGORITHMS

10

5
08/01/2024

PARALLEL MACHINES: MINIMISING CMAX

11

PARALLEL MACHINES

12

6
08/01/2024

PARALLEL MACHINES
Note: Job 1 does not have preemtion property

13

PARALLEL MACHINES

14

7
08/01/2024

PARALLEL MACHINES: DISPATCHING RULES

15

PARALLEL MACHINES
AIC! 5 MINUTES: P3|PMTN|CMAX
Jobs Processing time (pj)
1 3  Determine the optimum
2 5 sequence of the jobs on
3 4 the machines.
4 7
 Identify the Cmax Value!
5 21
6 6 a) All the jobs have
7 4 preemtion property
8 2
b) Except Job 5, other jobs
have preemtion
9 8
property,
10 3
11 7 16

8
08/01/2024

PARALLEL MACHINES
AIC! 5 MINUTES: P3||CMAX
Jobs Processing time (pj)
1 3  Determine the sequence
2 5 of the jobs on the
3 4 machines following the
SPT & LPT rules
4 7
5 21  Identify the Cmax Value!
6 6
7 4
8 2
9 8
10 3
11 7 17

PARALLEL MACHINES
HEURISTICS ALGORITHMS: LRPT RULE

18

9
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS: LRPT RULE

19

PARALLEL MACHINES
HEURISTICS ALGORITHMS: LRPT RULE

20

10
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS: LRPT RULE

21

PARALLEL MACHINES
HEURISTICS ALGORITHMS

AIC! 5 minutes
Machines 1 2 3
Vi 2 1 4

Jobs 1 2 3 4 5 6 7
pi 16 8 24 42 28 18 20

 Find out the schedule with the LRPT-FM rule


 Identify the Objective value
22

11
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

23

PARALLEL MACHINES
HEURISTICS ALGORITHMS

24

12
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

25

PARALLEL MACHINES
HEURISTICS ALGORITHMS

26

13
08/01/2024

PARALLEL MACHINES
HEURISTICS ALGORITHMS

27

PARALLEL MACHINES
HEURISTICS ALGORITHMS

AIC! 5 minutes
Machines 1 2 3
Vi 2 1 4

Jobs 1 2 3 4 5 6 7
pi 16 8 24 42 28 18 20

 Find out the optimum schedule


 Calculate the Objective value
28

14
08/01/2024

29

15

You might also like