Production And Operations Management 1st Edition McGraw-Hill Education India - Solutions

Looking for comprehensive solutions to the "Production and Operations Management, 1st Edition" textbook by McGraw-Hill Education India? Our platform offers an extensive collection of online resources, including the answers key and detailed solutions manual, available as a convenient solutions PDF. Dive into solved problems and test your understanding with our test bank and chapter solutions. Benefit from step-by-step answers that provide clarity and enhance learning. Whether you're a student or an instructor, our instructor manual and textbook resources are tailored to meet your needs. Enjoy the convenience of free download options to support your academic journey.

Johnson's rule gives the sequence of jobs with the optimal makespan for flow shop scheduling problem with machines and jobs.(a) 1, n (b) 2, n(c) 4, n (d) None of the above AppendixLO1
In scheduling, there will be n jobs, each requiring processing on m different machines and the process sequences of the jobs are the same.(a) Single machine (b) Flow shop(c) Job shop (d) None of the above AppendixLO1
Consider the following n jobs parallel identical machines problem.Job —j 1 2 3 4 5 6 7 8 Processing time tf 4 6 3 7 2 1 5 9 Find the schedule which will minimize the mean flow time, if the number of parallel identical machines is 2.AppendixLO1
Assume a single machine scheduling problem with two parallel identical processors. Then formulate an integer programming model to minimize the makespan.AppendixLO1
Explain the application of McNaughton's algorithm to minimize the makespan in single machine scheduling problem with parallel processors.AppendixLO1
A consulting company is under contract to carry out six projects, all with deadlines assured in days from now. The consultants are a small group and they work together on each project, so that the project will be started and completed sequentially. Under the terms of contract, the consultants will
Consider the following problem in single machine scheduling with independent jobs.Job — j 1 2 3 4 5 5 12 8 10 3 10 16 11 16 6 Find the optimal sequence which minimizes the mean tardiness.AppendixLO1
Consider the following single machine scheduling problem.Job — 1 2 3 4 5 Processing time (t1) 5 8 7 8 10 Due date (d1) 12 14 12 9 20 Determine the optimal sequence which will minimize the mean tardiness using branch and bound algorithm.AppendixLO1
Consider the following single machine scheduling problem.Job — j 1 2 3 4 5 tJ 10 7 10 8 15 di 15 20 25 22 30 Find the optimal sequence of jobs to minimize mean tardiness using branch and bound technique.AppendixLO1
Consider the following single machine scheduling problem.Job — 1 2 3 4 5 6 Processing time (t1) 8 9 7 8 10 14 Due date dj 14 12 10 14 20 28 Determine the sequence which will minimize the maximum lateness (Linax). Also, determine the Lmax with respect to the optimal sequence.AppendixLO1
Consider the following single machine scheduling problem with weights.Job —j 1 2 3 4 5 Processing time (t1) 15 4 5 14 8 Weight (w1) 1 2 1 2 3 Determine the sequence which will minimize the weighted mean flow time of the above problem.Also find the weighted mean flow time.AppendixLO1
Consider the following single machine scheduling problem.Job —j 1 2 3 4 5 Processing time (t1) (hrs) 20 8 7 10 9 Find the optimal sequence which will minimize the mean flow time and also obtain the minimum mean flow time.AppendixLO1
Consider the following problem in single machine scheduling with independent jobs.Job —j 1 2 3 4 5 6 7 8 t. 5 12 8 10 3 15 8 6 di 10 16 11 16 6 25 12 14 W. 2 1 1 2 3 4 2 3 Obtain the optimal schedule for each of the following performance measures:(a) To minimize mean flow time.(b) To minimize the
Briefly discuss different measure of performances in single machine scheduling problem with independent jobs.AppendixLO1
In the notation of a sub-problem P of the branch and bound method applied to minimizing the total tardiness in the single machine scheduling problem, represents the jobs. (a) The full sequence (b) A partial sequence (c) Compliment of a partial sequence (d) None of the above.AppendixLO1
EDD rule means rule. (a) Earliest due date (b) Eddy dead delay (c) Exponential double decay. (d) None of the above AppendixLO1
SPT rule means rule. (a) Similar pattern of thread (c) Shortest processing time (b) C; < dj (d) None of the above (b) Super polynomial theory (d) None of the above AppendixLO1
The job j is said to be tardy, if (a) C; > dj (c) Cj = d;AppendixLO1
The formula for tardiness of the job j is(a) 7 = Cj — d1, if C1 > dj; = 0, otherwise (b) T = cl•J — C.' if C. > d1• = 0,otherwise(c) Tj = CC — d1, if Cj > dj; = co, otherwise (d) None of the above.AppendixLO1
In the single machine scheduling problem with single processor, while using weighted SPT rule, the processing times of the jobs are their respective weights to obtain weighted processing times.(a) Multiplied by (b) Divided by(c) Subtracted from (d) None of the above AppendixLO1
Pre-emptive scheduling is generally applied to the single machine scheduling problem with(a) Single processor (b) Parallel processors(c) Both (a) and (b) (d) None of the above AppendixLO1
In the McNaughton's algorithm to minimize the makespan in the single machine scheduling problem with parallel processors, of the jobs is assumed.(a) Pre-emption (b) Non-pre-emption(c) Dependency (d) None of the above.AppendixLO1
In the algorithm to minimize the mean flow time of the single machine scheduling problem with parallel processors, the first step uses rule to form ordered job list.(a) LPT (b) EDD(c) SPT (d) None of the above AppendixLO1
McNaughton's algorithm to minimize the makespan is applied to(a) Single machine scheduling problem with single processor(b) Single machine scheduling problem with parallel processors(c) Flow shop problem(d) Job shop problem AppendixLO1
In Hodgson's algorithm to minimize the number of tardy jobs of the single machine scheduling problem, the first step uses(a) SPT(c) EDD rule to arrange the jobs.(b) LPT(d) None of the above AppendixLO1
The stopping condition of the branch and bound method applied to single machine scheduling problem for minimizing the total tardiness is that the level at which the least of the lower bound values occurs, is , where n is the total number of jobs.(a) n (b) n — 1(c) n — 2 (d) n — 4 AppendixLO1
In the branch and bound method applied to minimize the total tardiness of the single machine scheduling problem, as per dominance property, the condition to be satisfied for at least one unassigned job is(a) di < q, (b) qa(c) di > qa (d) None of the above AppendixLO1
In the branch and bound method applied to maximization problem, bounding determines(a) Upper bound (b) Lower bound(c) Boundary (d) None of the above AppendixLO1
In the branch and bound method applied to minimization problem, bounding determines(a) Upper bound (b) Lower bound(c) Boundary (d) None of the above AppendixLO1
In the branch and bound method,(a) Branching(c) Both (a) and (b)creates a sub-problem.(b) Bounding(d) None of the above AppendixLO1
In the branch and bound method applied to minimize the total tardiness of the single machine scheduling problem, the sequence is constructed from the of the sequence.(a) Beginning (b) Middle(c) End (d) None of the above AppendixLO1
The single machine scheduling problem with the objective of minimizing the is a combinatorial problem. (a) Mean flow time (c) Number of tardy jobs (b) Mean tardiness (d) None of the above. of the jobs.AppendixLO1
is a curtailed enumeration method. (a) Dynamic programming (c) Branch and Bound method (b) Mathematical model (d) None of the above AppendixLO1
Hodgson's algorithm minimizes (a) Mean tardiness (b) Mean flow time (d) None of the above (b) Number of tardy jobs (d) None of the above (c) Maximum lateness AppendixLO1
In single machine scheduling problem, EDD rule minimizes (a) Mean tardiness (c) Maximum lateness.AppendixLO1
In single machine scheduling problem, SPT rule minimizes (a) Mean tardiness (c) Makespan (b) Mean flow time (d) None of the above AppendixLO1
Minimization of minimizes in-process inventory.(a) Mean flow time.(b) Total tardiness(c) Number of tardy jobs(d) None of the above.AppendixLO1
In single machine scheduling problem with single processor, will be constant.(a) Mean flow time (b) Mean tardiness(c) Makespan (d) None of the above.AppendixLO1
is the allocation of start and finish time to each particular order/job.(a) Materials control (b) Scheduling(c) Quality control (d) None of the above AppendixLO1
What do you mean by control phase? What are activities under this phase? Explain them in brief.AppendixLO1
Explain the significance of scheduling in the action phase. What are the types of scheduling?AppendixLO1
List and briefly discuss different phases of production planning and control.AppendixLO1
Expediting means taking action if the set targets.(a) Progress reporting(c) Prior planning(b) Progress reporting(d) None of the above indicates deviations from the original(b) Corrective action(d) None of the above.AppendixLO1
Collection and analysis of equipment failures is under(a) Corrective action(c) Both (a) and (b)AppendixLO1
Capacity modification is a part of(a) Progress reporting (b) Corrective action(c) Both (a) and (b) (d) None of the above AppendixLO1
Production control phase has modules.(a) Two (b) Three(c) Four (d) None of the above AppendixLO1
is the transition from planning phase to action phase.(a) Dispatching (b) Scheduling(c) Materials planning (d) None of the above AppendixLO1
Dispatching is major step of phase.(a) Planning (b) Action(c) Production control (d) None of the above AppendixLO1
Process planning is a part of planning.(a) Prior (b) Active(c) Post (d) None of the above AppendixLO1
Product development and design is a part of planning.(a) Prior (b) Active(c) Post (d) None of the above AppendixLO1
Planning phase has(a) Prior planning, active planning and post planning(b) Prior planning and active planning(c) Prior planning and post planning(d) None of the above.AppendixLO1
phase provides guidelines for implementing all the plans into practice.(a) Production control (b) Action(c) Planning (d) None of the above AppendixLO1
determines the optimal schedule and sequence of operations, economic batch quantity, machine assignment and dispatching priorities for sequencing.(a) LOB (b) Production planning(c) Line balancing (d) None of the above AppendixLO1
Production planning and control has phases.(a) Two (b) Three(c) Four (d) None of the above AppendixLO1
Design of sampling plan is a decision.(a) Strategic (b) Tactical(c) Operational (d) None of the above AppendixLO1
Project scheduling is a decision.(a) Strategic (b) Tactical(c) Operational (d) None of the above AppendixLO1
R&D planning is a decision.(a) Strategic (b) Tactical(c) Operational (d) None of the above AppendixLO1
List and explain the steps of implementation design of MRP II.AppendixLO1
Give the framework of MRP II and explain it.AppendixLO1
What is MRP II?AppendixLO1
List and explain the guidelines to overcome the overload condition s.AppendixLO1
List and explain the inputs of CRP.AppendixLO1
What is capacity requirement planning?AppendixLO1
Consider the Question 6 with the ordering cost per order as 210,000. Find MRP solution using Part Period Balancing (PPB) method.AppendixLO1
Consider the Question 6 with the ordering cost per order as 210,000. Find MRP solution using Least Unit Cost (LUC) method and total relevant cost.AppendixLO1
Consider the Question 6 with the ordering cost per order as 210,000. Find MRP solution using Period Order Quantity (POQ) method.AppendixLO1
Consider the Question 6 with stock-on-hand as 0 and ordering cost per order as 210,000. Find MRP solution using the Minimum Cost Per Period (MCP) Method and calculate the total relevant cost.AppendixLO1
A company manufactures Iron Box. The MPS of the final assembly is as shown below.Month 1 2 3 4 5 6 7 8 Projected Requirement — 3500 3000 4500 — 1000 4000 5500 The initial stock on hand is 1150 units. The carrying cost is Z 2.5 per unit/month and the lead time is one month. The ordering cost per
A firm producing hand trolley has the following master production schedule (MPS).Week 1 2 3 4 5 6 7 8 Demand 200 — — 240 — 240 — 220 Each hand trolley has a bin, two wheel assemblies, two handle bars and a mounting base.Each wheel assembly has a wheel and two bearings. Order quantities,
What are the basic inputs for MRP?AppendixLO1
What do you mean by bill of materials structure? Give an example.AppendixLO1
MRP II is(a) Material requirements planning (b) Manufacturing resource planning(c) Maintenance repair planning (d) None of the above.AppendixLO1
Load percentage is(a) [Load/capacity] x 100 (b) [Load/maximum load] x 100(c) [Load/minimum load] x 100 (d) None of the above AppendixLO1
In method for MRP, the cumulative cost of the sum of the set-up cost and carrying cost is computed for each periods combination.(a) LUC (b) PPB(c) EOQ (d) POQ AppendixLO1
In POQ method, the optimal order period is given by the formula(a) DI(NIE0Q) (b) DN/EOQ(c) NI(DIE0Q) (d) None of the above AppendixLO1
In PPB method for MRP, economic part period is given by the formula(a) Set-up cost/ordering cost(b) Set-up cost/carrying cost per unit per period(c) Set-up cost/shortest cost per unit per period(d) None of the above AppendixLO1
PPB method for MRP stands for(a) Particle part binary(c) Part period binary 12.(a) LUC(c) EOQ(b)(d)(b)(d)method.(b) Period of quantity(d) None of the above method.Linear uniform curve None of the above method.Part period balancing None of the above among all the methods.PPB None of the above Less
LUC method for MRP stands for(a) Limited ultimate cost(c) Least unit cost AppendixLO1
POQ method for MRP stands for(a) Period order quantity(c) Perfect optimum quantity AppendixLO1
MCP method for MRP stands for(a) Maximum cost per period(c) Matrix column pivot AppendixLO1
For a period, planned order release is to be made, if the projected requirement of that period is the stock on hand is of the previous period.(a) Equal to(c) Greater than AppendixLO1
Planned order release quantity is equal to(a) Stock on hand (b) Projected requirement(c) Economic order quantity (d) None of the above AppendixLO1
The stock on hand (SOH;) is given by the formula(a) SOFIi_ i — Recepti + Projected requirement;(b) SOFIi_ i + Receipt; — Projected requirement;(c) SOFIi_ i — Receipt; — Projected requirement;(d) None of the above.AppendixLO1
The data for the projected requirements are fed from(a) MPS (b) LOB(c) COMSOAL (d) None of the above AppendixLO1
MPS is an important input to(a) Line balancing(c) MRP(b) Master production scheduling(d) None of the above(b) Aggregate planning(d) None of the above AppendixLO1
BOM structure is used in(a) Line balancing(c) MRP AppendixLO1
MRP is applied to product.(a) Independent (b) Dependent(c) Both (a) and (b) (d) None of the above AppendixLO1
10. How should an organization manage the quality standards in the light of changing and dynamic nature of IPOM?
9. Explain the concept of supply chain management. What are the major problems in SCM?
8. "BPO and KPO industries basically depend on outsourcing from third world countries." Explain and justify the comment.
7. International business and operations depend on outsourcing. What are the key outsourcing areas of busi- ness?
6. List out the various strategic aspects in international production and operations management and explain with suitable examples.
5. Explain the role of multinational corporation in world trade.
4. Compare the domestic and international POM on the basis of cultural differences, business environment and quality standards.
3. Highlight the objectives and importance of Production and Operations management in the light of Global- ization and Liberalization.
2. Discuss in brief the evolution of industrialization in global scenario.
1. What do you understand by international production and operations management?
14. Which of the following statements is either true or false? (a) A "location measure", in models such as Brown and Gibson's model, is valid only for the annual turn- over. (b) The main purpose of Taguchi methods is to test the robustness of a design. (c) The main objective of IPOM is to increase
13. The main drawback of vertical integration is: (a) Reduce the transportation cost. (b) Decrease flexibility due to previous upstream or downstream investments. (c) Capture upstream or downstream profit margins. (d) Lead to expansion of core competencies.
12. Which of the following documents essential for ISO 9004? (a) Quality standards - for suppliers (b) Quality standard-systems and elements (c) Quality vocabulary (d) Quality standard - for manufacturers

Showing 2700 - 2800 of 5227

First
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
Last

Production And Operations Management 1st Edition McGraw-Hill Education India - Solutions

Step by Step Answers