Q&A Hero

Q: 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

Q: 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.

Q: Which sequencing rule is designed specifically to minimize job tardiness? A. S/O B. EDD C. FCFS D. SPT E. LPT

Q: 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.

Q: 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.

Q: 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.

Q: 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

Q: 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.

Q: 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.

Q: 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.

Q: 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

Q: 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

Q: 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

Q: 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

Q: 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.

Q: The priority rule which will sequence jobs in the order they are received is: A. EDD. B. LIFO. C. SPT. D. CR. E. FCFS.

Q: 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.

Q: 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.

Q: The EDD priority rule usually does well with regard to: A. cost. B. lateness. C. overtime. D. waste. E. makespan.

Q: 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

Q: Organizations with fixed, perishable capacity can benefit from: A. yield management. B. price increases. C. constraints. D. suboptimization. E. waiting lines.

Q: 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

Q: 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

Q: 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

Q: 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

Q: Scheduling pertains to: A. hiring workers. B. process selection. C. buying machinery. D. timing the use of specific resources. E. determining the lowest cost.

Q: 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.

Q: 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

Q: 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.

Q: 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

Q: 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

Q: 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

Q: The theory of constraints has a goal of maximizing flow through the entire system.

Q: Makespan is the total time needed to complete a group of jobs.

Q: In the decision-making hierarchy, scheduling decisions are the final step in the transformation process before actual output occurs.

Q: If optimal sequencing through three work centers is desired, Johnson's rule II is used rather than Johnson's rule.

Q: Bottlenecks may shift with the passage of time, so that different operations become bottleneck operations at different times.

Q: The SPT priority rule always results in the lowest average completion time.

Q: Priority rules are used in low-volume systems to identify an optimal processing sequence.

Q: In a single work center, makespan improvement can be accomplished by selecting the optimal sequencing rule.

Q: Priority rules generally assume that job setup cost is independent of processing sequence of jobs.

Q: The assignment method is limited to a maximum of two jobs per resource.

Q: Priority rules are widely used to sequence jobs in high-volume systems.

Q: Sequencing is concerned with the order in which jobs are done, while loading is concerned with assigning jobs to work centers or workstations.

Q: The assignment model seeks an optimum matching of tasks and resources.

Q: A schedule chart can be used to monitor job progress.

Q: Infinite loading and finite loading are two major approaches used to load work centers.

Q: Input/output (I/O) control refers to monitoring the productivity changes since productivity is determined by the ratio of output to input.

Q: Splitting a large lot after one operation beyond a bottleneck operation would reduce the overall waiting time of the bottleneck operation.

Q: 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.

Q: As long as the bottleneck operations are used effectively, idle time in non-bottleneck operations will not affect the overall productivity of the system.

Q: The elimination of idle time on both bottleneck and non-bottleneck operations must be accomplished to optimize output.

Q: The output of the system cannot exceed the output of the bottleneck operation(s).

Q: A schedule chart depicts the loading and idle times for a group of machines or departments.

Q: A Gantt chart is a basic scheduling tool that is most useful in low-volume systems.

Q: A Gantt chart is a basic scheduling tool that works best for high-volume systems.

Q: Loading is the determination of which work centers should perform which jobs.

Q: The term loading, as used in scheduling, refers to choosing the order in which jobs will be processed in low-volume systems.

Q: When orders exceed our capacity, priority rules are used to select which orders will be accepted.

Q: When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas.

Q: Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

Q: Line balancing is a major factor in the design and scheduling of low-volume systems because of batch processing.

Q: Flow-shop scheduling is used in high-volume systems.

Q: 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?

Q: Use Johnson's rule to determine the optimum processing sequence for the jobs listed in the following table. Chart total throughput time.

Q: 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?

Q: 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

Q: 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

Q: 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.

Q: 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.

Q: Using the cost information given in the following table, assign work crews to jobs so that total cost is minimized.

Q: 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?

Q: 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?

Q: 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?

Q: 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

Q: 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

Q: 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.

Q: 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.

Q: 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.

Q: 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