Chapter 15: Multiple Choice Questions 1.Which of the following is true regarding forward scheduling? Forward schedulin
Views 90 Downloads 13 File size 80KB
DOWNLOAD FILE
Recommend Stories
You are watching: A scheduling technique used to achieve an optimum, one-to-one matching of tasks and resources is:
Chap15-17 New Print
CHAPTER 15 SPATIAL INTERPOLATION1.0INTRODUCTIONGIS users work with all sorts of surfaces such as land terrain. How
28 9 315KBRead more
Chap15 Tax Pbms
Problem 15.1 Texmanchester”s Foreign-Source IncomeTexManchester is a textile manufacturing firm based in Manchester, U
67 7 101KBRead more
See more: Identify The Appropriate Way(S) To Dispose Of Under- Or Overallocated Overhead Costs.
Retail Book Chap15
CHAPTER 15 PRICING ONLINE LEARNING CENTERPricing The pricing module contains four sections that complement this chapte
58 43 201KBRead more
MC
Selamat pagi dan salam sejahtera bagi kita semua. Yang terhormat Bapak Camat, Bapak Kepala seksi Kesling Dinas kesehatan
22 2 54KBRead more
AME-Chap15-Rice Milling Equipment
AGRICULTURAL MACHINERY AND EQUIPMENTRevised 2017Introduction RICE MILLING EQUIPMENT byn Rice milling is the proces
3 0 4MBRead more
See more: How To Open Ds_Store File In Windows ? Simple Tips How To Open The Ds_Store File
MC – Capitol
1CapitolAutore: Bill King Sviluppo: Henrik Strandberg, Nils Gulliksson Editore: Matt Forbeck, Henrik Strandberg Dir
31 3 3MBRead more
Citation preview
Chapter 15: Multiple Choice Questions 1. Which of the following is true regarding forward scheduling? Forward scheduling is the scheduling of a. the end items or finished products b. jobs as soon as the requirements are known c. the start items or component parts d. the final operation first beginning with the due date 2. Which of the following best describes how short-term schedules are prepared? Short-term schedules are prepared a. directly from the aggregate plans b. directly from the capacity plans c. from inventory records for items that have been used up d. from master schedules which are derived from aggregate plans 3. Which scheduling technique should be employed when due dates are important for a job order? a. forward scheduling b. loading c. dispatching d. backward scheduling e. master scheduling 4. Which of the following is not an effectiveness criterion for scheduling? a. maximizing flow time b. minimizing completion time c. minimizing WIP inventory d. maximizing utilization 5. Forward scheduling a. begins with a delivery date, then each operation is offset one at a time, in reverse order b. is well suited where the supplier is usually able to meet precise delivery dates c. tends to minimize in-process inventory d. assumes that procurement of material and operations start as soon as requirements are known 6. Which file contains important information regarding an item”s flow through the shop? a. routing file b. work center master file c. control files d. item master file 7. Which of these is not part of the planning files of a production planning and control system? a. a progress file b. a work center master file c. an item master file d. a routing file 8. Which of the following files tracks work order progress? a. work center master files b. routing files c. item master files d. control files 9. The production database containing information about each of the components that a firm produces or purchases is the a. routing file b. work center master file c. control file d. item master file 10. The short-term scheduling activity called loading a. assigns dates to specific jobs or operations steps b. specifies the order in which jobs should be done at each center c. assigns jobs to work centers d. assigns workers to jobs 11. The assignment method is a. a method to highlight overloads in a given work center b. a computerized method of determining appropriate tasks for an operation c. a form of linear programming for optimally assigning tasks or jobs to resources d. the same thing as the Gantt schedule chart 12. A scheduling technique used to achieve optimum, one-to-one matching of tasks and resources is a. the assignment method b. Johnson”s rule c. the CDS Algorithm d. the appointment method 13. Which of the following is an aid used to monitor jobs in process? a. a Gantt load chart b. the assignment method c. a Gantt schedule chart d. Johnson”s Rule 14. If an assignment problem consists of 6 workers and 7 projects, a. one worker will not get a project assignment b. one worker will be assigned two projects c. each worker will contribute work toward the seventh project d. one project will not get a worker assigned 15. Orders are processed in the sequence in which they arrive if (the) ______ rule sequences the jobs. a. earliest due date b. slack time remaining c. first come, first serve d. critical ratio 16. Which of the following dispatching rules ordinarily gives the best results when the criterion is lowest time for completion of the full sequence of jobs? a. shortest processing time (SPT) b. critical ratio (CR) c. first in, first out (FIFO) d. first come, first serve (FCFS) 17. Sequencing (or dispatching) a. assigns dates to specific jobs or operations steps b. assigns jobs to work centers c. specifies the order in which jobs should be done at each center d. assigns workers to jobs 18. Five jobs (A, B, C, D, E) are waiting to be processed. Their processing times and due dates are given below. Using the shortest processing time dispatching rule, in which order should the jobs be processed? Job A B C D E a. b. c. d. 19. Processing Time (days) 4 7 8 3 5 Job due date (days) 7 4 11 5 8 A, B, C, D, E C, E, A, D, B B, D, A, E, C D, A, E, B, C Five jobs are waiting to be processed. Their processing times and due dates are given below. Using the earliest due date dispatching rule, in which order should the jobs be processed? Job A B C D E a. b. c. d. Processing Time (days) 4 2 8 3 5 Job due date (days) 7 4 11 5 8 C, E, A, D, B A, B, C, D, E B, D, A, E, C C, B, A, E, D 20. Flow time represents the time a. an order spends waiting for processing at a work center b. an order spends being processed at a work center c. an order spends moving from one work center to another d. to complete an order, including time spent in processing and in waiting 21. Which of the following dispatching rules tends to minimize job flow time? a. FCFS: first come, first served b. SPT: shortest processing time c. EDD: earliest due date d. LPT: longest processing time 22. Average completion time for a schedule sequence at a work center is total a. processing time divided by the number of jobs b. flow time divided by total processing time c. flow time divided by the number of jobs d. processing time plus total late time divided by number of jobs 23. Five welding jobs are waiting to be processed. Their processing times and due dates are given below. Using the critical ratio dispatching rule, in which order should the jobs be processed? Job A B C D E a. b. c. d. Processing Time (days) 4 2 8 3 5 B, D, A, E, C C, D, A, B, E C, E, A, D, B E, B, A, D, C Job due date (days) 7 4 11 5 11 24. Which of the following dispatching rules allows easy updates? a. FCFS: first come, first served b. SPT: shortest processing time c. EDD: earliest due date d. CR: critical ratio 25. The priority rule which processes jobs according to the smallest ratio of due date to processing time is: a. critical ratio b. earliest due date c. first come, first serve d. longest processing time 26. Which of the following is an advantage of the FCFS dispatching rule when used in services? a. FCFS seems fair to customers b. FCFS minimizes the average number of jobs in the system c. FCFS minimizes the average lateness of all jobs d. FCFS maximizes the number of jobs completed on time 27. The most appropriate sequencing rule to use if the goal is to dynamically track the progress of jobs and establish relative priority on a common basis is a. shortest processing time b. earliest due date c. critical ratio d. Johnson”s rule 28. Use of the sequencing rule Shortest Processing Time generally results in a. minimum average lateness b. maximum utilization c. maximum effectiveness d. minimum average flow time 29. When a set of jobs must pass through two workstations whose sequence is fixed, ______ is the rule most commonly applied. a. Johnson”s Rule b. earliest due date rule c. first come, first serve rule d. slack time remaining 30. A recent advance in short-term scheduling that makes use of expert systems and simulation in solving dynamic scheduling problems is a. forward scheduling b. backward scheduling c. infinite scheduling d. finite scheduling 31. Which of the following techniques does not contribute to increasing throughput at a bottleneck? a. schedule throughput to match capacity of the bottleneck b. increase capacity of constraint c. have cross-trained employees available to operate the constraint d. develop alternate routings 32. An appliance manufacturer assembles icemakers in large batches. The operations manager would like to significantly reduce the batch size. What would you suggest? a. use the SPT rule b. use forward scheduling c. use finite scheduling d. develop level material use schedules 33. A firm wants to develop a level material use schedule based on the following data. What should be the setup cost? desired lot size: 60 annual demand: 40,000 holding cost: $20 per unit per year daily production rate: 320 # of work days per year: 250 a. b. c. d. $0.45 $4.50 $45 $450 34. Factory X is trying to use level use scheduling. If their first target were to cut the current lot size in half, by what proportion must setup cost change? a. Setup cost must be cut to one-fourth its current value. b. Setup cost must also be cut in half from its current value. c. Setup cost must double from its current value. d. Cannot be determined. 35. Which of the following is true regarding services scheduling? a. The Critical Ratio sequencing rule is widely used for fairness to customers. b. The emphasis is on staffing levels, not materials. c. Reservation systems are often used a means of manipulating the supply of services. d. Labor use can be intensive, and labor demand is usually stable. Chapter 15: Multiple Choice Answers 13. 1. b 14. 2. d 15. 3. d 16. 4. a 17. 5. d 18. 6. a 19. 7. a 20. 8. d 21. 9. d 22. 10. c 23. 11. c 24. 12. a c d c a c d c d b c b d 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. a a c d a d a d a a b
