Chandrasekharan Rajendran

Bio: Chandrasekharan Rajendran is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Job shop scheduling & Flow shop scheduling. The author has an hindex of 52, co-authored 192 publications receiving 9404 citations. Previous affiliations of Chandrasekharan Rajendran include Indian Institutes of Technology & VIT University.

Supply chain risk management in the Indian manufacturing context: a conceptual framework

Abstract: Due to emergence of global business environment, short product life cycles, technological innovations, natural disasters and ever changing government policies, industries face various types of risk in their supply chains. To overcome the increased risks raised by the above factors in the supply chain, organisations need to establish the principles of supply chain risk management (SCRM) for serving customers by finding right suppliers and fostering the trust among the supply chain partners. This study proposes that by following the strategies such as risk plan, risk financing, risk monitoring, risk avoidance, risk transfer and risk sharing, the supply chain can be enhanced by reducing the impact of risk on supply chain. This study supposes that the supply chain partners (entities) need to share information transparently across the supply chain to enhance the visibility of the supply chain. Without sharing information across the supply chain, alleviation of the impact of the risk and sustaining long lasting relationship among the trading partners is a difficult task. This study attempts to identify the critical dimensions of SCRM and it develops a conceptual framework to understand the relationship between risk and performance measures from the perspective of the manufacturers which includes original equipment manufacturers (OEM), tier-1 and tier-2 suppliers.

Evaluation of heuristics for scheduling in a flowshop: a case study

Abstract: The problem of finding the best permutation schedule for a flowshop has engaged the attention of researchers for almost four decades. In view of its NP-completeness, the problem is not amenable to the development of efficient optimizing algorithms. A number of heuristics have been proposed, most of which have been evaluated by using randomly generated problems for a single measure of performance. However, real-life problems often have more than one objective. This paper discusses a live flowshop problem that has the twin objectives of minimizing the production run-time as well as the total flowtime of jobs. Five heuristics are evaluated in this study and some interesting findings are reported.

A Comparative Study of Periodic-Review Order-Up-To (T, S) Policy and Continuous-Review (s, S) Policy in a Serial Supply Chain Over a Finite Planning Horizon

Abstract: In this paper, we consider a serial supply chain (SC) operating with deterministic and known customer demands and costs of review or orders, holding, and backlog at every installation over a finite planning horizon. We present an evaluation of two order policies: Periodic-review order-up-to S policy (i.e., (T, S) policy), and (s, S) policy. We first present a mathematical programming model to determine optimal re-order point and base-stock for every member in the SC. By virtue of the computational complexity associated with the mathematical model, we present genetic algorithms (GAs) to determine the order policy parameters, s and S for every stage. We compare the performances of GAs (for obtaining installation s and S) with the mathematical model for the periodic-review order-up-to (T, S) policy that obtains in its class optimal review periods and order-up-to levels. It is observed that the (s, S) policy emerges to be mostly better than the (T, S) policy.

Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models

Abstract: The berth allocation problem (BAP) involves decisions on how to allocate the berth space and to sequence maritime vessels that are to be loaded and unloaded at a container terminal involved in the maritime logistics. As the berth is a critical resource in a container terminal, an effective use of it is highly essential to have efficient berthing and servicing of vessels, and to optimize the associated costs. This study focuses on the minimum cost berth allocation problem (MCBAP) at a container terminal where the maritime vessels arrive dynamically. The objective comprises the waiting time penalty, tardiness penalty, handling cost and benefit of early service completion of vessels. This paper proposes three computationally efficient mixed integer linear programming (MILP) models for the MCBAP. Through numerical experiments, the proposed MILP models are compared to an existing model in the literature to evaluate their computational performance. The computational study with problem instances of various problem characteristics demonstrates the computational efficiency of the proposed models.

The Design and Analysis of Experiments

Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

Out of the Crisis

Abstract: According to W. Edwards Deming, American companies require nothing less than a transformation of management style and of governmental relations with industry. In Out of the Crisis, originally published in 1982, Deming offers a theory of management based on his famous 14 Points for Management. Management's failure to plan for the future, he claims, brings about loss of market, which brings about loss of jobs. Management must be judged not only by the quarterly dividend, but by innovative plans to stay in business, protect investment, ensure future dividends, and provide more jobs through improved product and service. In simple, direct language, he explains the principles of management transformation and how to apply them.

Evolutionary algorithms for solving multi-objective problems

Abstract: List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test Suites. 4. MOEA Testing and Analysis. 5. MOEA Theory and Issues. 3. MOEA Theoretical Issues. 6. Applications. 7. MOEA Parallelization. 8. Multi-Criteria Decision Making. 9. Special Topics. 10. Epilog. Appendix A: MOEA Classification and Technique Analysis. Appendix B: MOPs in the Literature. Appendix C: Ptrue & PFtrue for Selected Numeric MOPs. Appendix D: Ptrue & PFtrue for Side-Constrained MOPs. Appendix E: MOEA Software Availability. Appendix F: MOEA-Related Information. Index. References.