Browsing Working Papers by Author "Rao, V. Venkata"
Now showing items 1-11 of 11
-
A computer based crew scheduling system for freight trains in Indian railways
Raghuram, G.; Rao, V. Venkata (2010-03-23)This paper describes the design and implementation of an online PC-based crew allocation and management system for freight trains on Indian Railways. The software allows different rules to be used for calling the crew so ... -
Crew scheduling in Indian railways: a case study of Vadodara division passenger train crews
Raghuram, G.; Rao, V. Venkata; Saha, Jahar (2010-03-14)In this paper we discuss the crew scheduling problem in Indian Railways and propose a methodology to minimize crew requirements. In Particular, we deal with the scheduling of passenger train crews in Vadodara Division of ... -
A decision support system for improving railway line capacity
Raghuram, G.; Rao, V. Venkata (Indian Institute of Management Ahmedabad, 1989-12-01) -
GANTT chart colouring
Rao, V. Venkata; Prasad, C. S. (2010-03-22)This paper presents three rules for colouring of a Grant Chart that displays the machine and job schedules of a job shop. These rules have been used on the job schedules of a real job shop and the performance of the proposed ... -
A heuristic procedure for one dimensional bin packing problem with additional constraints
Kumar, Satyendra; Rao, V. Venkata; Tirupati, Devanath (2010-03-31)We proposed a heuristic algorithm to solve the one-dimensional bin-packing problem with additional constraints. The proposed algorithm has been applied to solve a practical vehicle-allocation problem. The experimental ... -
Interactive GANTT charting: features,data structures and algorithms
Rao, V. Venkata; Prasad, C. Shyam (2010-03-18)Gantt chart (or bar chart) is a popular tool for developing and displaying job schedules. This paper focuses on software that provides a Gantt chart interface to enable users develop job schedules interactively. Here the ... -
The minimum weight rooted arborescence problem: weights on ARCS case
Rao, V. Venkata; Sridharan, R. (2010-03-24)In a rooted acyclic graph, G, there exits, in general, several rooted (not necessarily spanning) arborscences. Depending on whether the graph has weights on nodes, on arcs, or on both, it is possible to define, with different ... -
Multiple products, multiple constraints, single period inventory problem: a hierarchical solution procedure
Kumar, Satyendra; Rao, V. Venkata; Tirupati, Devanath (2010-03-31)This paper presents the formulation and a hierarchical solution procedure of multiple products, multiple constraints, single period inventory problem. The hierarchical procedure decomposes the problem into a number of ... -
Primal and Lagrangian heuristics for minimum weight rooted arborescence problem
Rao, V. Venkata; Sridharan, R. (2010-07-27)Consider a rooted acyclic graph G with weights on arcs. In this graph, a minimum weight rooted arborescence (MRC) can be defined as one whose sum of arc weights is less than or equal to that of any other rooted arborescence ... -
Quantity discount pricing model: an exact formulation and analysis
Srinivasan, G.; Rao, V. Venkata (2010-03-22)In this paper we formulate and analyze the quantity discount pricing problem without the approximation that was earlier used by Monahan and Lee and Rosenblatt. Our exact analysis throws light on some important conceptual ... -
Simulation models to evaluate railway operating policies
Manikutty, S.; Raghuram, G.; Rao, V. Venkata (2010-03-23)In this paper, we describe two applications of simulation models to evaluate the following railway operating policies: 1. Loco assignment at a junction, and 2. Twin single line versus orthodox double line operation. The ...