Scribd
Upload
98 views

Chapter 6 Work Assignment

The document describes methods for assigning work to employees or machines to minimize total time. It defines work assignment and discusses assigning single jobs based on criteria like earliest due date or shortest processing time. It then introduces the Johnson rule for assigning multiple jobs to two machines/employees sequentially. The rule finds the job with the smallest processing time on the first machine/employee and assigns it first or last depending on if it is on the first or second machine/employee. It repeats this process until all jobs are assigned. Finally, it introduces the Hungarian method for assigning multiple jobs to multiple employees, which uses a matrix subtraction approach to assign jobs to minimize

Uploaded by

Nghĩa Ngô
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
98 views

Chapter 6 Work Assignment

The document describes methods for assigning work to employees or machines to minimize total time. It defines work assignment and discusses assigning single jobs based on criteria like earliest due date or shortest processing time. It then introduces the Johnson rule for assigning multiple jobs to two machines/employees sequentially. The rule finds the job with the smallest processing time on the first machine/employee and assigns it first or last depending on if it is on the first or second machine/employee. It repeats this process until all jobs are assigned. Finally, it introduces the Hungarian method for assigning multiple jobs to multiple employees, which uses a matrix subtraction approach to assign jobs to minimize

Uploaded by

Nghĩa Ngô
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Chapter 6

Work assignment
Definition of work assignment

• Work assignment is to assign production tasks and allocate


work to each workplace, department or person, including
determining the time, sequence, and workload at each
workplace in each workplace, each stage
1. Assign to 1 object
• Fist come, Fist service
• Earliest Due Date
• Shorted processing time
• Long processing time
• Principle of important customers (prioritize customers with
long-term relationships)
• Prioritize work with small critical ratio (Critical Ratio)

Ti : Remaining time for job I


Ti
CRi = (Deadline time - Present time)
Ni
Ni : Remaining production time of job i
• For example: Today is the 23rd, in the work assignment
table of company A, there are 3 jobs arranged as follows:

29 − 23
CRA = = 1,5
Job Deadline Number of days 4
time required to
complete the work 30 − 23
CRB = = 0,5
A 29 4 14
B 30 14
C 26 3 26 − 23
CRC = =1
3
1. Assign job to 1 object

For example: There are 5 jobs need to conduct, each job


must be done on machine 1 first, and then transferred to
machine 2. Production time is given as follows:

Job A B C D E
Machine 1 5 3 8 10 7
Machine 2 2 6 4 7 12

Please arrange the order of the jobs so that the total


time to perform the jobs on the 2 machines is the
minimum
For example 1
Job A B C D E
Machine 1 5 3 8 10 7
Machine 2 2 6 4 7 12
A B C D E
0 5 8 16 26 33 45
A=5 B C=8 D= 10 E=7

A B=6 C=4 D=7 E= 12

5 7 8 14 16 20 26 33 45
0
The Johnson method assigns work to two
machines

Conditions for applying the method


• All jobs must be done on both 2 machines
• All jobs are done on machine 1 first, then move
on to work on machine 2
Rules for the implementation of the method
• Step 1: Find a number with the smallest execution
time, following the rule:
• - If the number is on machine 1, it will be assigned
first
• - If that number is on machine 2, it will be arranged as
the last
• Step 2: Remove the arranged tasks
• Step 3: Repeat step 1 and step 2 until all tasks are
sorted
For example 1
Job A B C D E
Machine 1 5 3 8 10 7
Machine 2 2 6 4 7 12
B E D C A
0 3 10 20 28 33 35
B=3 E=7 D=10 C=8 A=5

B=6 E=12 D=7 C=4 A=


2
0 3 9 10 22 29 33 35
Example: There are 6 jobs done on 2 machines with the
production time given as follows
Job A B C D E F
Machine 1 5 3 8 10 6 7
Machine 2 2 6 4 7 6 12
Please arrange the order of the jobs so that the total
time to perform the jobs on the 2 machines is the
minimum
Hungarian algorithm
• The Hungarian method helps to solve the assignment problem for
many object
Example: Company A has 4 employees and all 4 of them can
complete all 4 existing jobs of the company with the
following execution time:

Jobs
Staffs I II III IV
A 70 110 115 130
B 10 105 135 50
C 30 90 75 35
D 55 25 15 65

Let’s assign works to each staff


Step 1: choose the smallest number in each row, and
subtract this number from all the numbers in the row, we
have:

Jobs
Staffs I II III IV
A 70 0 110 40 11545 13060
B 10 0 10595 135 50 40
125
C 30 0 90 60 75 35 5
45
D 55 40 25 10 15 0 65 50
Step 2: From the table after step 1, choose the smallest
number in each column and subtract that number from
the numbers in the column, we have:

Jobs
Staffs I II III IV
A 0 40 35 45 60 55
B 0 95 85 125 40 35
C 0 60 50 45 5 0
D 40 10 0 0 50 45
• Step 4: Create more number zeros,
• Step 3: draw straight lines
then go back to step 3 through the
row or column so that the number of
lines is the minimum

Jobs
Staffs I II III IV
A 0 30
0 45
15 55
B 0 55
85 125
95 35
C 0 50
20 45
15 0

D 40
70 0 0 75
45
Go back to Step 3
Jobs
Staffs I II III IV
A 0 0 15 55
B 0 55 95 35
C 0 20 15 0

D 70 0 0 75
Vậy : Person A will work 2 with a time of 110 days
Person B will work 1 with a time of 10 days
Person C will work 4 with a time of 35 days
Person D will work 3 with a time of 15 days
Total: 170 days
Jobs

Staffs
1 2 3 4 5

A 200 500 300 250 300

B 300 700 450 500 600

C 100 500 100 100 200

D 250 650 300 450 500

E 250 550 200 300 600

You might also like