Indian Institute of Management Bangalore

About: Indian Institute of Management Bangalore is a education organization based out in Bengaluru, Karnataka, India. It is known for research contribution in the topics: Emerging markets & Corporate governance. The organization has 491 authors who have published 1254 publications receiving 23853 citations. The organization is also known as: IIMB.

CLASS: An algorithm for cellular manufacturing system and layout design using sequence data

Abstract: Cell formation problem in CMS design has received the attention of researchers for more than three decades. However, use of sequence data for cell formation has been a least researched area. Sequence data provides valuable information about the flow patterns of various jobs in a manufacturing system. Therefore, it is only natural to expect that use of sequence data must result in not only identifying the part families and machine groups but also the layout (sequence) of the machines within each cell. Unfortunately, such an approach has not been taken in the past while solving CMS design problem using sequence data. In this paper, we fill this gap in the literature by developing an algorithm that not only identifies the cells but also the sequence of machines in the cells in a simultaneous fashion. The numerical computations of the algorithm with the available problems in the literature indicate the usefulness of the algorithm. Further, it also points to the untapped potential of such an approach to solve CMS design and layout problem using sequence data.

Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models

Abstract: A retailer's product selection decisions are largely driven by her assumptions on how consumers make choices. We use a ranking-based consumer choice model to represent consumer preferences: every customer has a ranking of the potential products in the category and purchases his highest ranked product (if any) offered in the assortment. We consider four practically motivated special cases of this model, namely, the one-way substitution, the locational choice, the outtree, and the intree preference models, and we study the retailer's product selection problem when products have different price and cost parameters. We assume that the retailer incurs a fixed carrying cost per product offered, a goodwill penalty for each customer who does not purchase his first choice and a lost sale penalty for each customer who does not find an acceptable product to buy. For the first three models, we obtain efficient solution methods that simplify to either a shortest path method or a dynamic program. For the fourth model, we construct an effective algorithm and show numerically that, in practice, it is much faster than enumeration. We also obtain valuable insights on the structure of the optimal assortment.