problem 16-8
1.
value:
5.00 points
5.00 points
Problem 16-8
The following table shows orders to be processed at a machine shop as of 8:00 a.m. Monday. The jobs have different operations they must go through. Processing times are in days. Jobs are listed in order of arrival. |
| Job | Processing Time (Days) | Due Date (Days) | Remaining Number of Operations |
| A | 8 | 20 | 2 |
| B | 10 | 18 | 4 |
| C | 5 | 25 | 5 |
| D | 11 | 17 | 3 |
| E | 9 | 35 | 4 |
| a. | Determine the processing sequence at the first work center using each of these rules: (1) First come, first served, (2) Slack per operation. |
| Sequence for First come, first served | |
| Sequence for Slack per operation | |
| b. | Compute the effectiveness of each rule using each of these measures: (1) average completion time, (2) average number of jobs at the work center. (Round your answers to 2 decimal places.) |
| First Come, First Served | Slack per Operation | ||
| Average completion time | [removed] | [removed] | |
| Average number of jobs | [removed] | [removed] | |
10 years ago
3
Answer(3)![blurred-text]()
![]()
![blurred-text]()
![]()
![blurred-text]()
![]()
Purchase the answer to view it

- problem_16-8__.docx
Purchase the answer to view it

NOT RATED
- problem_16.8.docx
Purchase the answer to view it

NOT RATED
Bids(0)

