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.

Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives

Abstract: This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness of a job, where each of the objectives is considered separately. A job-based bound, integrated with a machine-based bound, on the completion time of every unscheduled job by considering each of these objectives is developed, and the overall lower bound on a given objective at a given node in the branching tree is obtained by solving a bottleneck assignment problem. The proposed algorithms are evaluated by solving problems of various sizes, and some of these branch-and-bound algorithms (with the consideration of the maximum flowtime/the maximum tardiness) are compared with the existing algorithms available in the literature. This paper also presents the development and computational performance evaluation of a multi-objective branch-and-bound algorithm which can handle various combinations of objectives involving the sum of/maximum weighted flowtime, weighted tardiness and weighted earliness of jobs.

Discrete particle swarm optimisation algorithms for minimising the completion-time variance of jobs in flowshops

Abstract: In this paper, the problem of scheduling in the permutation flowshop scheduling problem is considered with the objective of minimising the completion-time variance of jobs (CTV). Two particle swarm optimisation algorithms (PSOAs) are proposed and analysed. The first PSOA is inspired from the solution construction procedures that are used in ant colony optimisation algorithms. The second algorithm is a newly developed one. The proposed algorithms are applied to a set of benchmark flowshop scheduling problems, and performances of the algorithms are evaluated by comparing the obtained results with the results published in the literature. The performance analysis demonstrates the effectiveness of the proposed algorithms in solving the permutation flowshop sequencing problem with the CTV objective.

Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs : Part 1

Abstract: This paper is the second of two papers that deal with the problem of scheduling in the permutation flowshop and flowline-based manufacturing cell with the consideration of different buffer-space requirements (or different in-process inventory levels) for jobs and the constraints on buffer-storage capacity between machines. We consider two sets of twin objectives of scheduling: one set consists of minimizing the idle-time of machines and waiting-time of jobs, and another set consists of minimizing idletime of machines and weighted waiting-time of jobs. We present a bicriterion heuristic, with a variant, to obtain a sequence that minimizes the twin objectives under consideration. The heuristic works in two phases. The first phase, i.e., 'initial seed-sequence generation phase', deals with the development of a good seed sequence with respect to twin objectives under consideration. The second phase is the 'improvement phase' in which the seed sequence, obtained from the first phase, is improved by using a new...

A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows

Abstract: In this work, we consider the Vehicle Routing Problem with Simultaneous Delivery and Pickup, and constrained by time windows, to improve the performance and responsiveness of the supply chain by transporting goods from one location to another location in an efficient manner. In this class of problem, each customer demands a quantity to be delivered as a part of the forward supply service and another quantity to be picked up as a part of the reverse recycling service, and the complete service has to be done simultaneously in a single visit of a vehicle, and the objective is to minimize the total cost, which includes the traveling cost and dispatching cost for operating vehicles. We propose a Mixed Integer Linear Programming (MILP) model for solving this class of problem. In order to evaluate the performance of the proposed MILP model, a comparison study is made between the proposed MILP model and an existing MILP model available in the literature, with the consideration of heterogeneous vehicles. Our study indicates that the proposed MILP model gives tighter lower bound and also performs better in terms of the execution time to solve each of the randomly generated problem instances, in comparison with the existing MILP model. In addition, we also compare the proposed MILP model (assuming homogeneous vehicles) with the existing MILP model that also considers homogeneous vehicles. The results of the computational evaluation indicate that the proposed MILP model gives much tighter lower bound, and it is competitive to the existing MILP model in terms of the execution time to solve each of the randomly generated problem instances.

A conceptual framework for Supply Chain Management with specific reference to a developing economy

Abstract: Organisations need to tap the principles of Supply Chain Management (SCM) to realise the criterion of serving the right customers, finding the right suppliers, and fostering trust with the right partners. This study supposes that the supply chain partners (entities) should share a common vision and that without tangible benefits accruing to these entities in the supply chain, sustaining a long lasting relationship cannot be possible. This study attempts to identify the critical dimensions of SCM and develop conceptual frameworks from the perspective of the four entities in the supply chain, namely, original equipment manufacturers, suppliers, logistics service providers and retailers.

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.