scispace - formally typeset
Search or ask a question
Author

Viswanath Kumar Ganesan

Bio: Viswanath Kumar Ganesan is an academic researcher from Tata Consultancy Services. The author has contributed to research in topics: Scheduling (production processes) & Supply chain. The author has an hindex of 9, co-authored 23 publications receiving 300 citations. Previous affiliations of Viswanath Kumar Ganesan include Nanyang Technological University & Singapore–MIT alliance.

Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the problem of synchronizing air transportation and assembly manufacturing to achieve accurate delivery with minimized cost in a consumer electronics supply chain is studied, and two solution methodologies using the concepts of forward and backward scheduling are presented.
Abstract: The paper studies the problem of synchronizing air transportation and assembly manufacturing to achieve accurate delivery with minimized cost in a consumer electronics supply chain. The motivation for this study came from a major computer manufacturer in a consumer electronics industry that faces challenges in the final stages of delivery of a supply chain. The synchronization problem is decomposed and formulated as two sub-problems, i.e. a multi-destination air transportation allocation problem and an assembly-scheduling problem. The first sub-problem is formulated and solved as an integer linear programming problem. For the assembly-scheduling problem, two solution methodologies using the concepts of forward and backward scheduling are presented. Computational results indicate that the proposed methodologies can achieve considerable cost reduction compared with the existing methodology applied in industry.

72 citations

Journal ArticleDOI
TL;DR: This paper investigates the case of process delays in assembly for reasons such as machine breakdowns, shortages of materials, etc., and presents a schedule repair heuristic, and evaluates the performance of the proposed heuristic with industry practice methods.

54 citations

Journal ArticleDOI
TL;DR: The problem of synchronized scheduling of assembly and air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain is studied and the parallel machine assembly scheduling problem is shown to be NP-complete.

38 citations

Journal ArticleDOI
TL;DR: This paper studies a coordinated scheduling problem of parallel machine assembly manufacturing and multi-destination transportation in the make-to-order (MTO) consumer electronics supply chain (CESC) and proposes heuristic algorithms to solve the parallel machineAssembly scheduling problem.

25 citations

Posted Content
TL;DR: The computational experiments indicate that the proposed solution methodologies can achieve excellent average performance in comparison with an existing industry practice heuristic and the solution methodology with backward scheduling logic for determining orders' release time works better than the solutionMethodology with forward scheduling logic.
Abstract: In this paper, we study the problem of synchronization of air transportation and assembly manufacturing to achieve accurate delivery with minimized delivery cost. This problem is observed in PC assembly manufacturing industry. There are two integrated decisions involved in the research problem and they are (1) optimal allocation of orders to various flights in the planning period and (2) an appropriate release time for each order to complete the assembly to match the first decision. We propose two solution methodologies for the research problem. An Integer Linear Programming model is developed for the first decision, backward scheduling logic for the second decision in solution methodology 1 and forward scheduling logic for the second decision in solution methodology 2. The computational experiments indicate that the proposed solution methodologies can achieve excellent average performance in comparison with an existing industry practice heuristic. Furthermore, the solution methodology with backward scheduling logic for determining orders' release time works better than the solution methodology with forward scheduling logic. The computational results demonstrate the effectiveness of our methodologies over a wide range of problem instances. Finally, managerial implications of the proposed methodology are presented.

19 citations


Cited by
More filters
Book ChapterDOI
01 Jan 1994
TL;DR: In this Chapter, a decision maker (or a group of experts) trying to establish or examine fair procedures to combine opinions about alternatives related to different points of view is imagined.
Abstract: In this Chapter, we imagine a decision maker (or a group of experts) trying to establish or examine fair procedures to combine opinions about alternatives related to different points of view.

1,329 citations

Journal ArticleDOI
TL;DR: This paper presents a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature.
Abstract: In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after the production. Consequently, there is little or no finished product inventory in the supply chain such that production and outbound distribution are very intimately linked and must be scheduled jointly to achieve a desired on-time delivery performance at minimum total cost. Research on integrated scheduling models of production and outbound distribution is relatively recent but is growing very rapidly. In this paper, we provide a survey of such existing models. We present a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature. We clarify the tractability of some open problems left in the literature and some new problems by providing intractability proofs or polynomial-time exact algorithms. We also identify several problem areas and issues for future research.

477 citations

Journal ArticleDOI
TL;DR: In this article, a general and conceptual framework for the assessment of food supply chain (FSC) and logistics of food products in agreement with a multidisciplinary and integrated view is presented.

254 citations

Journal ArticleDOI
TL;DR: A case PCB manufacturing firm is studied and the results indicated that the proposed evaluation framework is simple and reasonable to identify the primary criteria influencing the SCMS, and it is effective to determine the optimal supplier even with the interactive and interdependent criteria/attributes.

248 citations

Proceedings ArticleDOI
03 Dec 2006
TL;DR: A novel approach that uses the honey bees foraging model to solve the job shop scheduling problem and experimental results comparing the proposed honey bee colony approach with existing approaches such as ant colony and tabu search are presented.
Abstract: In the face of globalization and rapidly shrinking product life cycle, manufacturing companies are trying different means to improve productivity through management of machine utilization and product cycle-time. Job shop scheduling is an important task for manufacturing industry in terms of improving machine utilization and reducing cycle-time. However, job shop scheduling is inherently a NP-hard problem with no easy solution. This paper describes a novel approach that uses the honey bees foraging model to solve the job shop scheduling problem. Experimental results comparing the proposed honey bee colony approach with existing approaches such as ant colony and tabu search will be presented.

220 citations