Mr. Elf owns a show store. Currently, he has 10 pairs of shoes that require resoling and polishing. He has a machine that can resole one pair of shoes at a time, and the time required for the operation varies with the type and condition of the shoe and the type of sole that is used. Shoes are polished on a machine dedicated to this purpose as well, and polishing is always done after resoling. His assistant generally does the polishing while Mr. Elf does the resoling. The resoling and polishing times (in minutes) are: Shoes 1 Resoling Time 14 Polishing Time 3 2 28 1 3 12 2 4 6 5 5 10 10 6 14 6 7 4 12 8 25 8 9 10 15 10 5 5 Determine the sequence in which these shoes should be repaired to minimize the total makespan for these 10 jobs, and answer the following questions. Based on the optimal sequence: (Enter integer only) 1. The first job to be processed is Job 2. The third job to be processed is Job 3. The fourth job to be processed is Job 4. The fifth job to be processed is Job 5. The seventh job to be processed is Job 6. The ninth job to be processed is Job 7. The last job to be processed is Job

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter4: Linear Programming Models
Section: Chapter Questions
Problem 111P
icon
Related questions
Question
Mr. Elf owns a show store. Currently, he has 10 pairs of shoes that require resoling and polishing. He has a machine that can resole one pair of shoes at a time, and the time required for
the operation varies with the type and condition of the shoe and the type of sole that is used. Shoes are polished on a machine dedicated to this purpose as well, and polishing is always
done after resoling. His assistant generally does the polishing while Mr. Elf does the resoling. The resoling and polishing times (in minutes) are:
Shoes
1
Resoling Time
14
Polishing Time
3
2
28
1
3
12
2
4
6
5
5
10
10
6
14
6
7
4
12
8
25
8
9
10
15
10
5
5
Determine the sequence in which these shoes should be repaired to minimize the total makespan for these 10 jobs, and answer the following questions.
Based on the optimal sequence: (Enter integer only)
1. The first job to be processed is Job
2. The third job to be processed is Job
3. The fourth job to be processed is Job
4. The fifth job to be processed is Job
5. The seventh job to be processed is Job
6. The ninth job to be processed is Job
7. The last job to be processed is Job
Transcribed Image Text:Mr. Elf owns a show store. Currently, he has 10 pairs of shoes that require resoling and polishing. He has a machine that can resole one pair of shoes at a time, and the time required for the operation varies with the type and condition of the shoe and the type of sole that is used. Shoes are polished on a machine dedicated to this purpose as well, and polishing is always done after resoling. His assistant generally does the polishing while Mr. Elf does the resoling. The resoling and polishing times (in minutes) are: Shoes 1 Resoling Time 14 Polishing Time 3 2 28 1 3 12 2 4 6 5 5 10 10 6 14 6 7 4 12 8 25 8 9 10 15 10 5 5 Determine the sequence in which these shoes should be repaired to minimize the total makespan for these 10 jobs, and answer the following questions. Based on the optimal sequence: (Enter integer only) 1. The first job to be processed is Job 2. The third job to be processed is Job 3. The fourth job to be processed is Job 4. The fifth job to be processed is Job 5. The seventh job to be processed is Job 6. The ninth job to be processed is Job 7. The last job to be processed is Job
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,