V. Sridharan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
V. Sridharan has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
J.W.M Bertrand
Graduate School of Industrial Engineering and Management Science, Eindhoven University of Technology, P.O. Box 513, Paviljoen F16, NL-5600 MB Eindhoven, The Netherlands
1 shared publication- Mehmet Barut
Department of Finance, Real Estate, and Decision Sciences, Barton School of Business, Wichita State University, 1845 North Fairmount Street, Wichita, KS 67260-0077, USA
1 shared publication Sukran N. Atadeniz
Department of Marketing and Management, University of St. Thomas, Houston, TX, USA
1 shared publication- Xiaoming Li
Tennessee State University
1 shared publication Zhuoqun Zhou
Department of Management, Clemson University, 142 Shrine Hall, Clemson, SC 29634-1305, U.S.A.
1 shared publication
Latest Publications
- 2 July 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (13) , 4121-4137
Effectiveness of nervousness reduction policies when capacity is constrained
A number of studies have examined a variety of solutions for overcoming master production schedule nervousness which is a major cause of cost increase and material flow disruption throughout the supply chain. The study reported in this paper provides a comprehensive review of the literature and provides insights on the effect of capacity constraints on the effectiveness of policies for dampening schedule nervousness. The insights on the impact of capacity constraints are then confirmed via a simulation study investigating the effectiveness of three nervousness reduction policies. The relative effectiveness of the policies (freezing a portion of the schedule, using safety stock at the end item level, and a combination policy of freezing and safety stock) are examined under a variety of conditions characterised by variations in the level of demand uncertainty faced by the system and product structure complexity.
- 2 July 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (13) , 4121-4137
Effectiveness of nervousness reduction policies when capacity is constrained
A number of studies have examined a variety of solutions for overcoming master production schedule nervousness which is a major cause of cost increase and material flow disruption throughout the supply chain. The study reported in this paper provides a comprehensive review of the literature and provides insights on the effect of capacity constraints on the effectiveness of policies for dampening schedule nervousness. The insights on the impact of capacity constraints are then confirmed via a simulation study investigating the effectiveness of three nervousness reduction policies. The relative effectiveness of the policies (freezing a portion of the schedule, using safety stock at the end item level, and a combination policy of freezing and safety stock) are examined under a variety of conditions characterised by variations in the level of demand uncertainty faced by the system and product structure complexity.
- 4 April 2005
- Published by Wiley in Decision Sciences
- Vol. 36 (2) , 287-316
Revenue Management in Order‐Driven Production Systems
This article investigates the effectiveness of a tactical demand‐capacity management policy to guide operational decisions in order‐driven production systems. The policy is implemented via a heuristic that attempts to maximize revenue by selectively accepting or rejecting customer orders for multiple product classes when demand exceeds capacity constantly over the short term. The performance of the heuristic is evaluated in terms of its ability to generate a higher profit compared to a first‐come‐first‐served (FCFS) policy. The policies are compared over a wide range of conditions characterized by variations in both internal (firm) and external (market) factors. The heuristic, when used with a Whole Lot order‐processing approach, produces higher profit compared to FCFS when profit margins of products are substantially different from each other and demand exceeds capacity by a large amount. In other cases it is better to use the heuristic in conjunction with the Split Lot order‐processing approach.
- 4 April 2005
- Published by Wiley in Decision Sciences
- Vol. 36 (2) , 287-316
Revenue Management in Order‐Driven Production Systems
This article investigates the effectiveness of a tactical demand‐capacity management policy to guide operational decisions in order‐driven production systems. The policy is implemented via a heuristic that attempts to maximize revenue by selectively accepting or rejecting customer orders for multiple product classes when demand exceeds capacity constantly over the short term. The performance of the heuristic is evaluated in terms of its ability to generate a higher profit compared to a first‐come‐first‐served (FCFS) policy. The policies are compared over a wide range of conditions characterized by variations in both internal (firm) and external (market) factors. The heuristic, when used with a Whole Lot order‐processing approach, produces higher profit compared to FCFS when profit margins of products are substantially different from each other and demand exceeds capacity by a large amount. In other cases it is better to use the heuristic in conjunction with the Split Lot order‐processing approach.
- 1 February 2001
- Published by Elsevier in European Journal of Operational Research
- Vol. 128 (3) , 509-531
A study of simple rules for subcontracting in make-to-order manufacturing
- 1 February 2001
- Published by Elsevier in European Journal of Operational Research
- Vol. 128 (3) , 509-531
A study of simple rules for subcontracting in make-to-order manufacturing
- 31 December 1996
- Published by Elsevier in Computers & Operations Research
- Vol. 23 (12) , 1183-1190
Dynamic non-preemptive single machine scheduling
- 31 December 1996
- Published by Elsevier in Computers & Operations Research
- Vol. 23 (12) , 1183-1190
Dynamic non-preemptive single machine scheduling