Management > QUESTIONS & ANSWERS > University of Houston, Downtown - MGT 3332 Chapter 16. Questions and Answers Listed at the wnd of th (All)

University of Houston, Downtown - MGT 3332 Chapter 16. Questions and Answers Listed at the wnd of the Document.

Document Content and Description Below

16 Student: ___________________________________________________________________________ 1. Flow-shop scheduling is used in high-volume systems. True False 2. Line balancing is a major factor in th... e design and scheduling of low-volume systems because of batch processing. True False 3. Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence. True False 4. When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas. True False 5. When orders exceed our capacity, priority rules are used to select which orders will be accepted. True False 6. The term loading, as used in scheduling, refers to choosing the order in which jobs will be processed in low-volume systems. True False 7. Loading is the determination of which work centers should perform which jobs. True False 8. A Gantt chart is a basic scheduling tool that works best for high-volume systems. True False 9. A Gantt chart is a basic scheduling tool that is most useful in low-volume systems. True False 10. A schedule chart depicts the loading and idle times for a group of machines or departments. True False 11. The output of the system cannot exceed the output of the bottleneck operation(s). True False 12. The elimination of idle time on both bottleneck and non-bottleneck operations must be accomplished to optimize output. True False 13. As long as the bottleneck operations are used effectively, idle time in non-bottleneck operations will not affect the overall productivity of the system. True False 14. The quantity sent to a bottleneck operation could be split into two or more process batches to better utilize a bottleneck resource rather than process the entire batch. True False 15. Splitting a large lot after one operation beyond a bottleneck operation would reduce the overall waiting time of the bottleneck operation. True False 16. Input/output (I/O) control refers to monitoring the productivity changes since productivity is determined by the ratio of output to input. True False 17. Infinite loading and finite loading are two major approaches used to load work centers. True False 18. A schedule chart can be used to monitor job progress. True False 19. The assignment model seeks an optimum matching of tasks and resources. True False 20. Sequencing is concerned with the order in which jobs are done, while loading is concerned with assigning jobs to work centers or workstations. True False 21. Priority rules are widely used to sequence jobs in high-volume systems. True False 22. The assignment method is limited to a maximum of two jobs per resource. True False 23. Priority rules generally assume that job setup cost is independent of processing sequence of jobs. True False 24. In a single work center, makespan improvement can be accomplished by selecting the optimal sequencing rule. True False 25. Priority rules are used in low-volume systems to identify an optimal processing sequence. True False 26. The SPT priority rule always results in the lowest average completion time. True False 27. Bottlenecks may shift with the passage of time, so that different operations become bottleneck operations at different times. True False 28. If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule. True False 29. In the decision-making hierarchy, scheduling decisions are the final step in the transformation process before actual output occurs. True False 30. Makespan is the total time needed to complete a group of jobs. True False 31. The theory of constraints has a goal of maximizing flow through the entire system. True False 32. Similar to that in manufacturing, the service scheduling hierarchy begins with __________ and ends with _________. A. aggregate planning; detailed daily scheduling B. aggregate planning; master scheduling C. master scheduling; detailed material planning D. aggregate planning; detailed material planning E. quarterly planning; monthly planning 33. Which of the following is present in the manufacturing scheduling hierarchy but is absent in the service scheduling hierarchy? A. aggregate planning B. materials planning C. master scheduling D. detailed, short-term scheduling E. detailed, short-term planning 34. In theory of constraints scheduling, the __________ refers to the schedule and the __________ refers to inventory used to ensure that the bottleneck is never idle. A. rope; drum B. drum; rope C. drum; buffer D. buffer; drum E. buffer; rope 35. In theory of constraints scheduling, the synchronization of the sequence of operations is referred to as the: A. buffer. B. bottleneck. C. constraint. D. rope. E. drum. 36. To facilitate utilization of bottleneck operations, in theory of constraints scheduling ________ can be split into __________ to reduce waiting times. A. bottleneck lots; nonbottleneck lots B. transfer batches; process lots C. sized lots; constrained lots D. process batches; transfer batches E. buffer lots; transfer lots 37. Ensuring that the constraining resource is used to its maximum is an example of constraint: A. elevation. B. subordination. C. identification. D. elimination. E. exploitation. 38. Scheduling pertains to: A. hiring workers. B. process selection. C. buying machinery. D. timing the use of specific resources. E. determining the lowest cost. 39. Which of the following is the last step in the capacity/scheduling chain? A. product planning B. process planning C. capacity planning D. aggregate planning E. scheduling 40. Which of the following is not an example of a high-volume system? A. aircraft manufacturing B. magazine printing C. petroleum refining D. waste treatment E. commercial donut baking 41. Which of the following is not usually a characteristic of successful high-volume systems? A. smooth workflow through the system B. customized output C. rapid repair of breakdowns D. minimal quality problems E. reliable supply schedules 42. Primary considerations in scheduling high-volume systems involve: (I) coordinating the flow of inputs. (II) overcoming the disruptions to planned outputs. (III) assigning workers to work centers. A. I and III B. I and II C. II and III D. I, II, and III E. II only 43. Organizations with fixed, perishable capacity can benefit from: A. yield management. B. price increases. C. constraints. D. suboptimization. E. waiting lines. 44. A work center can be a: (I) machine. (II) group of machines. (III) department. (IV) facility. A. I, II, and III only B. II and IV only C. II and III only D. I and III only E. I, II, III, and IV 45. The EDD priority rule usually does well with regard to: A. cost. B. lateness. C. overtime. D. waste. E. makespan. 46. Which of the following is not an assumption of priority rules? A. The set of jobs is known: no new jobs arrive after processing begins. B. Setup time is independent of processing sequence. C. Finite loading is assumed. D. Processing times are deterministic. E. No machine breakdowns are assumed. 47. The two different approaches to load work centers in job-shop scheduling are: A. load charts and schedule charts. B. Gantt charts and assignment method. C. infinite loading and finite loading. D. linear programming and makespan. E. infinite charting and finite charting. 48. The priority rule which will sequence jobs in the order they are received is: A. EDD. B. LIFO. C. SPT. D. CR. E. FCFS. 49. A scheduling technique used to achieve an optimum, one-to-one matching of tasks and resources is: A. the assignment method. B. Johnson's rule. C. the optimum production technology method. D. the appointment method. E. the reservation method. 50. In a task assignment situation, in how many different ways can five jobs be assigned to five machines? A. 1 B. 5 C. 25 D. 120 E. 3,125 51. In an assignment method problem, if it takes Abe 3 hours to build a birdhouse and 4 hours for a doghouse, while Betty takes 4 hours for a birdhouse and 3 hours for a doghouse, what is the reduced cost (in hours) of assigning Abe to build the doghouse? A. 0 hours B. 1 hour C. 2 hours D. 3 hours E. 4 hours 52. The following matrix shows relative costs for various job-machine combinations. Which set of pairs constitutes the minimum-cost solution using the assignment method? A. 1-B, 2-C, 3-A B. 1-B, 2-A, 3-C C. 1-A, 2-C, 3-B D. 1-A, 2-B, 3-C E. 1-C, 2-A, 3-B 53. Based on the cost information given in the following table, which set of job-machine pairs reflects the minimum-cost solution using the Assignment method? A. 1-B, 2-A, 3-C B. 1-A, 2-B, 3-C C. 1-C, 2-A, 3-B D. 1-B, 2-C, 3-A E. 1-C, 2-B, 3-A 54. Effective scheduling cannot: A. yield cost savings and improved productivity. B. reduce the need for expansion of facilities. C. improve customer service. D. eliminate the need to train employees. E. improve patient care in medical settings. 55. The priority rule where jobs are processed according to the smallest ratio of due date to processing time is: A. CR. B. EEDD. C. FCFS. D. S/O. E. SPT. 56. Scheduled due dates are the result of: A. promises to customers. B. MRP processing. C. managerial decisions. D. all of the choices. E. our competitor's promises. 57. Which of the following is not a measure for judging the effectiveness of a schedule sequence? A. average number of jobs at the work center B. total number of jobs at the work center C. average completion (flow) time D. average job tardiness E. total number of work centers per job 58. The purpose of cyclical scheduling is to: A. eliminate weekends and holidays. B. rotate schedules. C. add flexible hours. D. incorporate overtime. E. observe work patterns. 59. Average completion (flow) time for a schedule sequence at a work center is: A. the sum of processing time divided by the number of jobs. B. the sum of jobs' flow times divided by the number of jobs. C. overall flow time divided by total processing time. D. total processing time plus total late time divided by number of jobs. E. the sum of flow time plus total late time divided by number of jobs. 60. The scheduling sequencing rule which always results in the lowest average completion (flow) time is the: A. first come, first served (FCFS) rule. B. shortest processing time first (SPT) rule. C. earliest due date first (EDD) rule. D. least slack per operation first (S/O) rule. E. run until slack happens (RUSH) rule. 61. Which sequencing rule is designed specifically to minimize job tardiness? A. S/O B. EDD C. FCFS D. SPT E. LPT 62. A scheduling rule used for sequencing jobs through two work centers is: A. critical ratio rule. B. Johnson's rule. C. slack per operation rule. D. shortest processing time rule. E. Pareto rule. 63. For the jobs listed below, which processing sequence would result using Johnson's rule? A. c-a-d-b B. b-d-a-c C. a-b-c-d D. d-c-b-a E. c-a-b-d 64. What is the optimum job sequence for the jobs listed below using Johnson's rule? A. e-g-f-d B. d-g-f-e C. d-f-g-e D. e-d-f-g E. f-e-d-g 65. A major difference between manufacturing and service systems in terms of scheduling is: A. variability in arrival and service rates. B. processing cost per unit. C. the number of units to be processed. D. length of processing time. E. output rate. 66. Scheduling in service systems often takes the form of: (I) appointment systems. (II) reservation systems. (III) makespan systems. A. I only B. II only C. I and II only D. III only E. I, II, and III 67. Scheduling in service systems may involve scheduling: (I) the workforce. (II) the equipment. (III) customers. A. II only B. I and II only C. II and III only D. I and III only E. I, II, and III 68. One disadvantage of appointment systems is: A. Capacity can be adjusted by varying hours. B. The customer's desired time may be already taken. C. People generally accept it as fair. D. It can reduce customer waiting time. E. Appointments do not have to be all the same length. 69. In an assignment model where there are fewer jobs than resources: A. dummy jobs are needed to solve the problem. B. dummy resources are needed to solve the problem. C. the problem cannot be solved using an assignment model. D. the problem will have multiple optimum solutions. E. the simplex method must be used to solve the problem. 70. The following table contains information about five jobs waiting to be processed at work center number three. The sequence that would result using the SPT rule is: A. e-b-c-d-a. B. c-a-b-e-d. C. a-d-c-e-b. D. d-e-b-a-c. E. e-d-b-a-c. 71. The following table contains information about five jobs waiting to be processed at work center number three. Using the EDD rule, the sequence of jobs would be: A. d-e-b-a-c. B. a-d-c-b-e. C. e-d-b-a-c. D. a-d-c-e-d. E. e-b-c-d-a. 72. There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: After the row reduction, what is the reduced time for assigning resource 4 to Job D? A. 0 hours B. 2 hours C. 3 hours D. 6 hours E. 9 hours 73. There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: After the row and column reductions, what is the reduced time for assigning resource 4 to job D? A. 0 hours B. 2 hours C. 3 hours D. 6 hours E. 9 hours 74. There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: After the row and column reductions, what is the minimum number of lines needed to cover all of the zeroes? A. 0 lines B. 1 line C. 2 lines D. 3 lines E. 4 lines 75. There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: What is the optimal assignment of resources to jobs? A. 1 to A; 2 to C; 3 to B; 4 to D B. 1 to B; 2 to D; 3 to C; 4 to A C. 1 to C; 2 to B; 3 to A; 4 to D D. 1 to D; 2 to B; 3 to C; 4 to A E. 1 to A; 2 to C; 3 to D; 4 to B 76. There are four resources and four jobs to be done. The time required for each resource to do each job is as follows: For the optimal schedule, what is the total number of hours required to complete these jobs? A. 23 hours B. 22 hours C. 21 hours D. 20 hours E. 19 hours 77. The president of a consulting firm wants to minimize the total number of hours it will take to complete four projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultants—Charlie, Betty, Johnny, and Rick—to complete any of the four projects, as follows: In how many different ways can she assign these consultants to these projects? A. 4 B. 8 C. 16 D. 24 E. 256 78. The president of a consulting firm wants to minimize the total number of hours it will take to complete four projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultants—Charlie, Betty, Johnny, and Rick—to complete any of the four projects, as follows: After the row and column reductions, what is the reduced time for assigning Rick to project D? A. 0 hours B. 8 hours C. 10 hours D. 9 hours E. 22 hours 79. The president of a consulting firm wants to minimize the total number of hours it will take to complete four projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultants—Charlie, Betty, Johnny, and Rick—to complete any of the four projects, as follows: What is the optimal assignment of consultants to projects? A. Charlie to A; Betty to B; Johnny to C; Rick to D B. Charlie to D; Betty to C; Johnny to B; Rick to A C. Charlie to C; Betty to A; Johnny to D; Rick to B D. Charlie to D; Betty to B; Johnny to C; Rick to A E. Charlie to D; Betty to A; Johnny to C; Rick to B 80. The president of a consulting firm wants to minimize the total number of hours it will take to complete four projects for a new client. Accordingly, she has estimated the time it should take for each of her top consultants—Charlie, Betty, Johnny, and Rick—to complete any of the four projects, as follows: For the optimal schedule, what is the total number of hours it will take these consultants to complete these projects? A. 53 hours B. 46 hours C. 50 hours D. 61 hours E. 54 hours 81. The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: If he uses the first come, first served priority rule to schedule these jobs, what will be the average completion time? A. 7.5 hours B. 5 hours C. 3 hours D. 2.5 hours E. 2 hours 82. The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: If he uses the earliest due date first priority rule to schedule these jobs, what will be the average job tardiness? A. 0 hours B. 1.5 hours C. 1.75 hours D. 2 hours E. 2.25 hours 83. The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average completion time? A. 7.5 hours B. 5 hours C. 3 hours D. 2.5 hours E. 2 hours 84. The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness? A. 0 hours B. 1.5 hours C. 1.75 hours D. 2 hours E. 2.25 hours 85. The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in his shop today? A. 0 B. 1 C. 2 D. 3 E. 4 86. Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: If Eva uses the first come, first served priority rule to schedule these jobs, what will be the average completion time? A. 3 hours B. 5 hours C. 7 hours D. 7.2 hours E. 8 hours 87. Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: If Eva uses the earliest due date first (EDD) priority rule to schedule these jobs, what will be the average job tardiness? A. 2 hours B. 2.2 hours C. 2.33 hours D. 2.4 hours E. 3 hours 88. Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average completion time? A. 3 hours B. 5 hours C. 7 hours D. 7.2 hours E. 8 hours 89. Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average job tardiness? A. 2 hours B. 2.2 hours C. 2.33 hours D. 2.4 hours E. 3 hours 90. Eva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: If Eva uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in her shop today? A. 2 jobs B. 2.33 jobs C. 2.4 jobs D. 2.67 jobs E. 3 jobs 91. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body paint work on each are as follows: Where in the optimum sequence should car E be scheduled? A. first B. second C. third D. fourth E. fifth 92. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body paint work on each are as follows: Where in the optimum sequence should car A be scheduled? A. first B. second C. third D. fourth E. fifth 93. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body paint work on each are as follows: What is the optimum sequence (first car to last)? A. A; B; C; D; E B. E; D; C; B; A C. E; B; D; C; A D. E; D; B; C; A E. E; B; D; A; C 94. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body paint work on each are as follows: What is the throughput time for the optimal schedule? A. 24 hours B. 25 hours C. 26 hours D. 28 hours E. 50 hours 95. The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the throughput time to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body paint work on each are as follows: What is the idle time at the paint work center for the optimal schedule? A. 1 hour B. 2 hours C. 4 hours D. 7 hours E. 10 hours 96. Job X, which has a duration of four days, is due by the close of business on Friday, December 23. Without looking at the work already scheduled on X's required resource, the scheduler schedules X to be begun on the morning of Tuesday, December 20. This is an example of: A. infinite scheduling. B. finite scheduling. C. forward scheduling. D. backward scheduling. E. prioritization. 97. Job X, which has a duration of four days, is due by the close of business on Friday, December 23. Without looking at the work already at X's required resource, the scheduler schedules X to be begun immediately and assumes that X will be done four days from now. This is an example of: A. infinite scheduling. B. finite scheduling. C. forward scheduling. D. backward scheduling. E. prioritization. 98. Job X arrived at work center Q at noon. At 2 p.m. that same day X was begun. X left work center Q at 3:15 p.m. that same day. X's flow time, in minutes, was: A. 195. B. 120. C. 75. D. 60. E. Cannot be determined. 99. Which of the following is critical to effective yield management? A. one-price pricing B. forecasting C. capacity flexibility D. constant demand E. trained service personnel 100.Which of the following is least likely to be a consideration when scheduling a high-volume system? A. equipment failures B. material shortages C. accidents D. worker absences E. demand variability 101.There are three jobs to be done and three resources with which to do them. Each resource will take a specific time to do each job, as shown in the following table: What is the result of the row reduction? 102.There are three jobs to be done and three resources with which to do them. Each resource will take a specific time to do each job, as shown in the following table: What is the result of the row and column reductions? 103.There are three jobs to be done and three resources with which to do them. Each resource will take a specific time to do each job, as shown in the following table: Can an optimum assignment be made after the row and column reductions? 104.There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: What is the result of modifying the row and column reductions table? 105.There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: Can an optimum assignment be made after the first modification of the row and column reductions table? 106.There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: What is the optimum assignment of jobs to machines? 107.There are three jobs to be done and three resources with which to do them. Each resource will cost a specific amount to do each job, as shown in the following table: What is the total cost for the optimum assignment of jobs to machines? 108.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the schedule sequence using the first come, first served priority rule? 109.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the average completion time for the first come, first served priority rule schedule? Average job tardiness? Average number of jobs at the center? 110.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the schedule sequence using the earliest due date priority rule? 111.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the average completion time for the earliest due date priority rule schedule? Average job tardiness? Average number of jobs at the center? 112.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): If jobs A, B, and C require two operations each, while jobs D and E require one operation each, what is the schedule sequence using the slack per operation (S/O) priority rule? 113.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the average completion time for the slack per operation (S/O) priority rule schedule? Average job tardiness? Average number of jobs at the center? 114.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the schedule sequence using the shortest processing time priority rule? 115.Refer to the following data for jobs waiting to be processed at a single work center (jobs are shown in order of arrival): What is the average completion time for the shortest processing time priority rule? Average job tardiness? Average number of jobs at the center? 116.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: If these jobs were scheduled in the sequence shown, what would be the throughput time? 117.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: If these jobs were scheduled in the sequence shown, what would be the idle time at machine B? 118.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: If these jobs were scheduled in the sequence shown, when would idle time occur at machine B? 119.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: In developing the sequence which will minimize throughput time, what is the initial job to be placed in the schedule sequence? 120.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: In developing the sequence that will minimize throughput time, where in the schedule sequence should job W be placed? 121.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: In developing the sequence which will minimize throughput time, where should job X be placed? 122.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: What is the sequence which will minimize throughput time? 123.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: What is the throughput time for the optimum schedule? 124.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: What is the idle time at machine B for the optimum schedule? 125.Given the following data for jobs awaiting processing at a manufacturing cell in which jobs are first processed by machine A, then by machine B: When does idle time occur at machine B for the optimum schedule? 126.Using the cost information given in the following table, assign work crews to jobs so that total cost is minimized. 127.The costs to do each of the three jobs on three alternate pieces of equipment are given below. Determine the job-equipment combination that will minimize total cost. 128.A manager must assign four engineers to projects, one to a project. The leader of project C has indicated that he does not want engineer 2 or 3 on his project. Given the following cost figures for each project-engineer combination, and keeping in mind that two combinations are undesirable, determine assignments such that total cost will be minimized. 129.Given the information in the table, determine the following: (A) Processing sequence using (1) SPT and (2) EDD (B) Average completion time and average job tardiness using (1) SPT and (2) EDD 130.Using the information in the table, determine the following: (A) Processing sequence using (1) SPT and (2) EDD rules (B) Average completion time and average job tardiness under each rule 131.Determine the processing sequence for the six jobs shown in the following table using Johnson's rule. Calculate total throughput time. Can the makespan be reduced by splitting the latest job? If so, by how much? 132.Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time. 133.Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? 134.Given the following information concerning jobs awaiting processing at a single work center, what processing sequence will result if the critical ratio rule is used? [Show More]

Last updated: 1 year ago

Preview 1 out of 39 pages

Reviews( 0 )

Recommended For You

 Data Mining> QUESTIONS & ANSWERS > University of Houston, Downtown - CS 5310290223213-Quiz-Data-Mining (All)

preview
University of Houston, Downtown - CS 5310290223213-Quiz-Data-Mining

Decision Trees are built using: Select one: a. heuristics b. greedy algorithms c. dynamic programming d. divide and conquer strategy The problem of Curse of Dimensionality is associated with:...

By QuizMaster , Uploaded: Jan 19, 2021

$9.5

 Operations Management> QUESTIONS & ANSWERS > University of Houston, Downtown - MGT 3332. Chapter16 Solutions. All Answers Provided. See Questions in the Description. (All)

preview
University of Houston, Downtown - MGT 3332. Chapter16 Solutions. All Answers Provided. See Questions in the Description.

Chapter16 Solutions 6. Given: The following table contains information on four jobs waiting for processing at a work center (the jobs are listed in the order of their arrival): a. Determine job...

By Kirsch , Uploaded: Feb 17, 2021

$13

 Management> QUESTIONS & ANSWERS > University of Houston, Downtown - MGT 3332 Chapter 18. Contains 81 Questions with the answers provided at the end. (All)

preview
University of Houston, Downtown - MGT 3332 Chapter 18. Contains 81 Questions with the answers provided at the end.

18 Student: ___________________________________________________________________________ 1. Waiting lines occur even in underloaded systems because of variability in service rates and/or arrival rat...

By Kirsch , Uploaded: Feb 17, 2021

$14

 Management> QUESTIONS & ANSWERS > University of Houston, Downtown - MGT 3332. Chapter 17. Contains 137 Questions and Answers. Answer Key provided at the end of the document. (All)

preview
University of Houston, Downtown - MGT 3332. Chapter 17. Contains 137 Questions and Answers. Answer Key provided at the end of the document.

17 Student: ___________________________________________________________________________ 1. Good project management is especially important with virtual teams. True False 2. One way that project ma...

By Kirsch , Uploaded: Feb 17, 2021

$15

 *NURSING> QUESTIONS & ANSWERS > NR565 Week 4 Study Guide Chapter 8. An Introduction to Pharmacogenomics. Questions and Answers listed at the end. Best for the quick, near exam study. (All)

preview
NR565 Week 4 Study Guide Chapter 8. An Introduction to Pharmacogenomics. Questions and Answers listed at the end. Best for the quick, near exam study.

NR565 Week 4 Study Guide Chapter 8. An Introduction to Pharmacogenomics Multiple Choice Identify the choice that best completes the statement or answers the question. ____ 1. Genetic polymorp...

By SuperSolutions© , Uploaded: Nov 19, 2020

$8

 Management> QUESTIONS & ANSWERS > MGT 322 Chapter 16. Questions and Answers. (All)

preview
MGT 322 Chapter 16. Questions and Answers.

MGT 322 Chapter 16 Chapter 16 1 - Use the assignment method to determine the best way to assign workers to jobs, given the following cost information. Compute the total cost for your assignment pl...

By QuizMaster , Uploaded: Sep 19, 2020

$9

 Financial Accounting> QUESTIONS & ANSWERS > ACCT 2102 Principles of Accounting II - University Of Georgia. Test 2 combined multiple choice (answers listed at end of file) (All)

preview
ACCT 2102 Principles of Accounting II - University Of Georgia. Test 2 combined multiple choice (answers listed at end of file)

ACCT 2102 Principles of Accounting II - University Of Georgia. Test 2 combined multiple choice (answers listed at end of file)ACCT2102 Farmer Test 2 combined multiple choice practice (answers liste...

By PAPERS UNLIMITED™ , Uploaded: Apr 03, 2023

$9.5

 Management> QUESTIONS & ANSWERS > Global Logistics and Supply Chain Management, 4th Edition by Mangan 4th edition Quiz - Answers (All)

preview
Global Logistics and Supply Chain Management, 4th Edition by Mangan 4th edition Quiz - Answers

Test Bank for Global Logistics and Supply Chain Management, 4th Edition, 4e by Mangan, Lalwani, Calatayud TEST BANK ISBN-13: 9781119702993 Full chapters included (This book has combined Test Bank-Ch...

By Test-Bank Lounge , Uploaded: Sep 29, 2022

$10

 *NURSING> QUESTIONS & ANSWERS > NURSING NR 228 Nutrition Week 7 edapt - Nutrition and Biliary Health- nutrition for gastrointestinal health - Chamberlain College of Nursing (All)

preview
NURSING NR 228 Nutrition Week 7 edapt - Nutrition and Biliary Health- nutrition for gastrointestinal health - Chamberlain College of Nursing

NURSING NR 228 Nutrition Week 7 edapt - Nutrition and Biliary Health- nutrition for gastrointestinal health - Chamberlain College of Nursing

By QuizMaster , Uploaded: Mar 29, 2023

$10.5

 *NURSING> QUESTIONS & ANSWERS > NURSING NR 228 Nutrition- Week 3 nutrition edapt - Introduction to Energy - Chamberlain College of Nursing (All)

preview
NURSING NR 228 Nutrition- Week 3 nutrition edapt - Introduction to Energy - Chamberlain College of Nursing

NURSING NR 228 Nutrition- Week 3 nutrition edapt - Introduction to Energy - Chamberlain College of Nursing

By QuizMaster , Uploaded: Mar 29, 2023

$3

$13.00

Add to cart

Instant download

Can't find what you want? Try our AI powered Search

OR

GET ASSIGNMENT HELP
88
0

Document information


Connected school, study & course



About the document


Uploaded On

Feb 17, 2021

Number of pages

39

Written in

Seller


seller-icon
Kirsch

Member since 4 years

881 Documents Sold


Additional information

This document has been written for:

Uploaded

Feb 17, 2021

Downloads

 0

Views

 88

Document Keyword Tags

THE BEST STUDY GUIDES

Avoid resits and achieve higher grades with the best study guides, textbook notes, and class notes written by your fellow students

custom preview

Avoid examination resits

Your fellow students know the appropriate material to use to deliver high quality content. With this great service and assistance from fellow students, you can become well prepared and avoid having to resits exams.

custom preview

Get the best grades

Your fellow student knows the best materials to research on and use. This guarantee you the best grades in your examination. Your fellow students use high quality materials, textbooks and notes to ensure high quality

custom preview

Earn from your notes

Get paid by selling your notes and study materials to other students. Earn alot of cash and help other students in study by providing them with appropriate and high quality study materials.


$13.00

WHAT STUDENTS SAY ABOUT US


What is Browsegrades

In Browsegrades, a student can earn by offering help to other student. Students can help other students with materials by upploading their notes and earn money.

We are here to help

We're available through e-mail, Twitter, Facebook, and live chat.
 FAQ
 Questions? Leave a message!

Follow us on
 Twitter

Copyright © Browsegrades · High quality services·