Institution
Indian Institute of Management Calcutta
Education•Kolkata, India•
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 & Emerging markets. The organization has 415 authors who have published 1354 publications receiving 21725 citations. The organization is also known as: IIMC & IIM Calcutta.
Papers published on a yearly basis
Papers
More filters
•
TL;DR: In this article, a critical examination of Indian Railways' procurement process has been conducted to understand the procedures and institutional mechanisms which have evolved over time for safeguarding institutional interests and their impact on the economy, efficiency, transparency and accountability aspects of procurement.
Abstract: Indian Railways is one of the world’s largest public sector organizations. Its network, traffic,
organization and extent of vertical integration are gigantic. This paper undertakes a critical
examination of its procurement process to understand the procedures and institutional
mechanisms which have evolved over time for safeguarding institutional interests. The paper
examines issues such as organizational structure, procurement organization, source selection
methodology, procurement oversight and regulation and their impact on the economy, efficiency,
transparency and accountability aspects of procurement. It is found that a unique combination of
internal vigil, external oversight by independent bodies and organizational characteristics
contribute to robust procurement processes.
2 citations
••
01 Jul 1987TL;DR: Vikalpa published in April-June 1986 an article by S K Chakraborty titled "Will-to-Yoga: Key to Better Quality of Work Life" as discussed by the authors.
Abstract: Vikalpa published in April-June 1986 an article by S K Chakraborty titled “Will‐to‐Yoga: Key to Better Quality of Work Life.”Several readers responded to this article. Their responses were published in the “Letters to the Editor” columns of subsequent issues while three were featured under “Ideas and Experiences” in the January-March 1987 issue.Professor Chakraborty could reply to only one letter, which was carried in the October-December 1986 issue. In view of the number of concerns that was raised, Vikalpa requested Professor S K Chakraborty to identify all the issues and clarify his own position on them. A brief summary of his original article and his analysis of the issues raised are presented here.
2 citations
••
TL;DR: This paper investigates randomization based causal inference in split-plot designs that are possibly unbalanced and proposes a construction procedure that generates an estimator with minimax bias, which becomes unbiased under milder conditions.
Abstract: Split-plot designs find wide applicability in multifactor experiments with randomization restrictions Practical considerations often warrant the use of unbalanced designs This paper investigates randomization based causal inference in split-plot designs that are possibly unbalanced Extension of ideas from the recently studied balanced case yields an expression for the sampling variance of a treatment contrast estimator as well as a conservative estimator of the sampling variance However, the bias of this variance estimator does not vanish even when the treatment effects are strictly additive A careful and involved matrix analysis is employed to overcome this difficulty, resulting in a new variance estimator, which becomes unbiased under milder conditions A construction procedure that generates such an estimator with minimax bias is proposed
2 citations
••
TL;DR: A heuristic search technique, developed based on Best-First Search, is proposed to address the problem of establishing a pair of primary and backup lightpaths on a call request within a reasonable amount of time in the WDM optical network literature.
Abstract: Providing a reliable and fast connection to a user is one of the challenging issues in a survivable IPover WDM optical network. A dynamic lightpath establishment (DLE) strategy along with a path protection technique may be used to address the issue. In this strategy, a primary lightpath is established when a request for communication from a node comes, and it is released when the communication is over. To protect the primary lightpath, there will also be a backup lightpath. Thus, DLE with path protection is the problem of establishing a pair of primary and backup lightpaths on a call request within a reasonable amount of time. This problem is a variant of the classical Routing and Wavelength Assignment (RWA) problem in the WDM optical network literature. It can be formulated as a combinatorial optimization problem and, in this paper, we have proposed a heuristic search technique, developed based on Best-First Search. We have tested the performance of our technique with respect to the lightpath establishment time (LET) and call blocking probability (CBP) and compared it with the performance of another well-known technique namely Mixed Integer Linear Programming (MILP). We have also studied the performance of our technique with respect to CBP and LET when there are multiple calls to admit. A significant performance gain is noticed in all the above cases.
2 citations
••
TL;DR: In this paper, the turnpike theorem is shown to be a crucial property of the model and an efficient growth path of finite order is shown. But the model is not a deterministic model.
Abstract: I. The model, 642.— II. A crucial property of the model, 643. — III. Efficient growth path of finite order: the turnpike theorem, 647. — IV. Efficient growth path of infinite order, 648.
2 citations
Authors
Showing all 426 results
Name | H-index | Papers | Citations |
---|---|---|---|
Russell W. Belk | 76 | 351 | 39909 |
Vishal Gupta | 47 | 387 | 9974 |
Sankaran Venkataraman | 32 | 75 | 19911 |
Subrata Mitra | 32 | 219 | 3332 |
Eiji Oki | 32 | 588 | 5995 |
Indranil Bose | 30 | 97 | 3629 |
Pradip K. Srimani | 30 | 268 | 2889 |
Rahul Mukerjee | 30 | 206 | 3507 |
Ruby Roy Dholakia | 29 | 102 | 5158 |
Per Skålén | 25 | 57 | 2763 |
Somprakash Bandyopadhyay | 23 | 111 | 1764 |
Debashis Saha | 22 | 181 | 2615 |
Haritha Saranga | 19 | 42 | 1523 |
Janat Shah | 19 | 52 | 1767 |
Rohit Varman | 18 | 46 | 1387 |