Production and Operations Management: Kopykitab
Production and Operations Management: Kopykitab
PRODUCTION
AND b
ta
Ki
OPERATIONS
py
Ko
MANAGEMENT
R. Panneerselvam
Production and Operations Management
b
ta
Ki
py
Ko
Ko
py
Ki
ta
b
Production and Operations
Management
Third Edition
b
R. PANNEERSELVAM
ta Professor
Department of Management Studies
School of Management, Pondicherry University
Ki
Puducherry
py
Ko
New Delhi-110001
2012
b
ta
Ki
py
Ko
© 2012 by PHI Learning Private Limited, New Delhi. All rights reserved. No part of this book may be
reproduced in any form, by mimeograph or any other means, without permission in writing from the
publisher.
ISBN-978-81-203-4555-3
The export rights of this book are vested solely with the publisher.
Published by Asoke K. Ghosh, PHI Learning Private Limited, M-97, Connaught Circus,
New Delhi-110001 and Printed by Rajkamal Electric Press, Plot No. 2, Phase IV, HSIDC,
Kundli-131028, Sonepat, Haryana.
Contents
Preface xv
Preface to the First Edition xix
b
1. INTRODUCTION 1–19
1.1 Functional Subsystems of Organizations 1
1.1.1 Definition 2
ta
1.2 Systems Concept of Production 4
1.3 Types of Production System 7
1.3.1 Flow Shop 7
Ki
1.3.2 Job Shop 8
1.3.3 Batch Manufacturing 8
1.3.4 The Project 8
1.4 Productivity 8
py
b
2.8.2 Criteria for Make or Buy 44
2.8.3 Approaches for Make or Buy Decision 45
2.10.1
2.10.2
ta
2.9 Ergonomic Considerations in Product Design
2.10 Concurrent Engineering 50
Tools for Concurrent Engineering 51
HRD in Concurrent Engineering 54
50
Ki
Objective Type Questions 54
Questions 56
CASE STUDY 1: VALUE ANALYSIS—FIRE EXTINGUISHER 58
CASE STUDY 2: BUSINESS PROCESS RE-ENGINEERING 58
py
b
5.3 Multifacility Location Problems 124
5.3.1 Model for Multifacility Location Problem 125
5.3.2
5.3.3
5.3.4
ta
Method of Transformation 125
Model to Determine X-coordinates of New Facilities 126
Model to Determine Y-coordinate 127
5.4 Minimax Location Problem 134
Ki
5.5 Gravity Location Problem 137
5.6 Euclidean-distance Location Problem 139
5.7 Covering Problem 144
5.7.1 Introduction 144
py
b
7.3 Rank Positional Weight Method 221
7.4 The COMSOAL Algorithm 224
7.5 Model for Assembly Line Balancing 226
7.5.1
ta
Zero-one Programming Model to Minimize the Number of Workstations 227
7.6 Stochastic Assembly Line Balancing 231
7.7 Case Study 231
Ki
Objective Type Questions 234
Questions 235
CASE STUDY 1: TURBO-CHARGER (ASSEMBLY LINE BALANCING) 238
CASE STUDY 2: HIGH VOLTAGE FUSE (ASSEMBLY LINE BALANCING) 239
py
b
9.9.6 VED Analysis 310
9.9.7 FSN Analysis 312
9.9.8 ta
SDE Analysis 312
Objective Type Questions 313
Questions 316
CASE STUDY: INVENTORY CONTROL 321
Ki
10. AGGREGATE PLANNING AND MASTER PRODUCTION SCHEDULING 322–349
10.1 Aggregate Planning 322
10.1.1 Nature of Aggregate Planning Decisions 322
py
Questions 345
CASE STUDY 1: AGGREGATE PLANNING—LAXMI MOTORS LIMITED 348
CASE STUDY 2: AGGREGATE PLANNING—ZIGMA AUTOMOBILE LIMITED 349
11. MATERIAL REQUIREMENTS PLANNING 350–372
11.1 Introduction 350
11.2 Product Structure/Bill of Materials (BOM) 350
11.3 MRP Concept 351
11.3.1 MRP Calculations 353
11.4 Lot Sizing in MRP 355
11.4.1 Illustration to Demonstrate Lot Sizing Methods in MRP 355
11.5 Capacity Requirements Planning 362
11.6 Manufacturing Resource Planning II (MRP II) 363
11.6.1 Implementation Design of MRP II 365
Objective Type Questions 367
Questions 369
CASE STUDY: MATERIAL REQUIREMENTS PLANNING 372
x | Contents
b
13.6 Model to Minimize Total Tardiness 384
13.7 Introduction to Branch and Bound Technique to Minimize Mean
Tardiness 386
13.7.1
ta
Branch and Bound Algorithm 388
13.8 Simple Heuristic to Minimize Total Tardiness in Single Machine
Scheduling Problem 395
Ki
13.9 Minimizing the Number of Tardy Jobs 398
13.9.1 Hodgson’s Algorithm to Minimize NT 398
13.10 Introduction to Parallel Processors under Single Machine Scheduling 400
13.10.1 Minimizing Makespan 401
py
Machines 403
13.10.6 Heuristic for Scheduling n Jobs on Parallel Identical Processors
to Minimize Weighted Mean Flow Time 404
Objective Type Questions 406
Questions 408
CASE STUDY: ALPHA PACKAGING LIMITED 411
14. FLOW SHOP SCHEDULING 412–436
14.1 Introduction 412
14.2 Johnson’s Problem 413
14.3 Extension of Johnson’s Rule 416
14.4 Branch and Bound Technique 417
14.5 CDS Heuristic 427
14.6 Palmer’s Heuristic 430
Objective Type Questions 431
Questions 436
CASE STUDY: LAKSHMI ENGINEERING LIMITED 436
Contents | xi
b
16.4 Critical Path Method (CPM) 459
16.5 Gantt Chart/Time Chart 464
16.6
16.7
ta
Project Evaluation and Review Technique (PERT) 464
Crashing of Project Network 467
16.7.1
16.7.2
General Guidelines for Network Crashing 468
Crashing of Project Network with Costs Trade-off 469
Ki
16.8 Project Scheduling with Constrained Resources 474
16.8.1 Resource Levelling Technique 474
16.8.2 Resource Allocation Technique 477
16.9 Graphical Evaluation and Review Technique (GERT) 479
py
b
Objective Type Questions 553
Questions 556
19.1
ta
19. MAINTENANCE PLANNING AND CONTROL
Maintenance Objectives 560
560–601
b
20.3.5 Operating Quality Costs 611
20.4 ISO 9000 Series 613
20.4.1 Benefits of ISO 9000 Series 613
20.4.2
20.5 Poka Yoke
20.5.1
ta
Steps in ISO 9000 Registration 614
615
Characteristics of Poka Yoke 615
20.5.2 Levels of Poka Yoke 616
Ki
20.5.3 Classification of Poka Yoke 616
20.5.4 Places Where Poka Yoke Works Well 617
20.5.5 Principles of Poka Yoke 617
20.5.6 Poka Yoke Devices 617
py
APPENDIX 665
REFERENCES 667–670
ANSWERS TO SELECTED QUESTIONS 671–691
INDEX 693–700
b
ta
Ki
py
Ko
Production And Operations
Management
25%
OFF