Indian Institute of Management Calcutta

About: Indian Institute of Management Calcutta is a education organization based out in Kolkata, India. It is known for research contribution in the topics: Supply chain & Context (language use). The organization has 415 authors who have published 1354 publications receiving 21725 citations. The organization is also known as: IIMC & IIM Calcutta.

A two pass heuristic algorithm for scheduling ‘blocked out’ units in continuous process industry

Abstract: This paper addresses the problem of scheduling cascaded ‘blocked out’ continuous processing units separated by finite capacity storage tanks The raw materials for the product lines arrive simultaneously on the input side of the first unit But every unit can process only one product line at a time, thus giving rise to the possibility of spillage of raw material due to limited storage capacity The need to process multiple product lines and the added constraint of multiple intermediate upliftment dates aggravate the problem This problem is quite common in petrochemical industry The paper provides a MINLP (Mixed Integer Non-Linear Programming) formulation of the problem However, for any realistic scheduling horizon, the size of the problem is too large to be solved by standard packages We have proposed a depth first branch and bound algorithm, guided by heuristics, to help planners in tackling the problem The suggested algorithm could output near optimal solutions for scheduling horizons of 30 time periods when applied to real life situations involving 3 units and 3 product lines

The Internet and the Organizational Adoption of Electronic Business: A Research Agenda

Abstract: The late nineties witnessed adoption of the Internet by organizations, on a very large scale. However, not every organization did experience an equally deep penetration of the Internet in its business. It was followed by the dot-com bubble burst. Many researchers have studied the phenomenon of organizational adoption of the Internet and the associated success factors. However, the available literature is fragmented in nature and does not take into consideration certain fundamental concepts. Therefore, there is a need for an enhanced understanding of the phenomenon. It will enable executives to plan for and implement Internet adoption in a more effective manner. This paper discusses the literature and brings out the inadequacies in the current findings. Subsequently a framework is developed to indicate directions for future research.

Sensitivity analysis for a linearized method of geometric programming

Abstract: Using the variation of certain parameters in the direction of the gradient, a sensitivity analysis is performed here in respect of a linearized method of simplex-type computation for problems of geometric programming, which minimize a polynomial with polynomial constraints. The illustrative applications show the relative flexibility and efficiency of the computational method which has considerable scope of application in dynamic problems of intertemporal optimization

Near-optimal Y-routed delay trees in nanometric interconnect design

Abstract: Performance-driven routing tree construction has immense research scope in today's VLSI circuit design In this study, the authors focuss on delay efficient routing tree construction Our current work encompasses two aspects of research On the one hand, the authors consider the construction of cost-effective global routing trees with the recently introduced Y-interconnects, and on the other hand, we utilise this framework for verifying the supremacy of the two-pole and Elmore delay estimate for its high fidelity The authors also incorporated fidelity measure for two-pole delay estimate In order to ensure accurate computation of fidelity, (i) the authors propose new statistically proven formulae for the fidelity metric, and (ii) compute the fidelity values based on delay estimates for optimal and near-optimal trees Our experiments on several randomly generated problem instances and benchmarks confirm once again the supremacy of fidelity of two-pole and Elmore delay estimates over that of linear delay The two-pole delay estimate is also observed to exhibit higher fidelity compared to Elmore delay in most of the cases

Insuring Big Losses Due to Security Breaches through Insurance: A Business Model

Abstract: Security breaches deter e-commerce activities. Organizations spend millions of dollars on security appliances to make online transactions more secure. Nonetheless, a new virus or a clever hacker can easily compromise these deterrents and cause losses of millions of dollars annually. To reduce the impact of such losses, e-risk insurance is a viable complement to the security devices. Currently, e-risk insurance is in its developmental stage and small claim coverage is only available. In this paper, we provide a framework, for insurance companies to duly accept large e-risk. Splitting a large risk across layers reduces the overall variance of the loss. Also in case of a contingency the loss indemnification is shared. The inputs to the proposed model are the risk transfer proportion, overloading for premium, expected return on capital and undistributed risk at each layer. The model outputs the optimal number of layers in which the risk needs to be spilt by the insurance company and the interlayer relationships