Gaurav Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gaurav Singh has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Andreas T. Ernst
School of Mathematics, Monash University, Clayton, Australia
10 shared publications - Yakov Zinder
University of Technology Sydney
7 shared publications Jayendran Venkateswaran
Industrial Engineering and Operations Research, IIT Bombay, Mumbai, India
4 shared publications- Mohan Krishnamoorthy
Monash University
4 shared publications - Julia Memar
University of Technology Sydney
3 shared publications Anu Thomas
IITB-Monash Research Academy, Old CSE Building, 2nd Floor, Indian Institute of Technology Bombay, Powai, Mumbai - 400076, India
2 shared publications
Latest Publications
- 17 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 313-318
Impact of Big Data Analytics & Capabilities on Supply Chain Management (SCM) - An Analysis of Indian Cement Industry
Big data analytics and capabilities (BDA&C) have the potential to transform existing business strategies. Big data analytics technologies and capabilities can help businesses make data-driven decisions that enhance business outcomes. More effective marketing, additional income opportunities, customer personalization, and increased operational efficiency are possible benefits. The present research outlines the impact of the BDA&C on SCM of Indian cement industry. This research uses SEM and Smart-PLS to determine how effective the adoption of BDA&C. An empirical study used a sample of 300 respondents from the Indian cement industry to test five hypotheses using 26 variables in a model. The SEM findings highlight the relative relevance of several variables to boosting the Indian cement supply chain and logistics management. This model demonstrates the understanding of the critical role of big data analytics and capabilities and their interconnections in the supply chain and logistics operation. The study found a significant mediating effect of BDA capabilities on several aspects of sustainable SCM. Advance infrastructure development, management capabilities, personnel expertise, and technical expertise strongly influence BDAC in the present scenario. These findings can be valuable and guide the executives of the industry who demand to learn more about the implications of BDA&C on supply chain performance and logistics management.
- 17 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 313-318
Impact of Big Data Analytics & Capabilities on Supply Chain Management (SCM) - An Analysis of Indian Cement Industry
Big data analytics and capabilities (BDA&C) have the potential to transform existing business strategies. Big data analytics technologies and capabilities can help businesses make data-driven decisions that enhance business outcomes. More effective marketing, additional income opportunities, customer personalization, and increased operational efficiency are possible benefits. The present research outlines the impact of the BDA&C on SCM of Indian cement industry. This research uses SEM and Smart-PLS to determine how effective the adoption of BDA&C. An empirical study used a sample of 300 respondents from the Indian cement industry to test five hypotheses using 26 variables in a model. The SEM findings highlight the relative relevance of several variables to boosting the Indian cement supply chain and logistics management. This model demonstrates the understanding of the critical role of big data analytics and capabilities and their interconnections in the supply chain and logistics operation. The study found a significant mediating effect of BDA capabilities on several aspects of sustainable SCM. Advance infrastructure development, management capabilities, personnel expertise, and technical expertise strongly influence BDAC in the present scenario. These findings can be valuable and guide the executives of the industry who demand to learn more about the implications of BDA&C on supply chain performance and logistics management.
- 7 August 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 101, 275-284
Exact approaches for the orderly colored longest path problem: Performance comparison
- 7 August 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 101, 275-284
Exact approaches for the orderly colored longest path problem: Performance comparison
- 16 February 2017
- Published by Springer Nature in Journal of Scheduling
- Vol. 20 (5) , 459-473
Mathematical models for the berth allocation problem in dry bulk terminals
- 16 February 2017
- Published by Springer Nature in Journal of Scheduling
- Vol. 20 (5) , 459-473
Mathematical models for the berth allocation problem in dry bulk terminals
- 1 July 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (4) , 514-519
Decentralised scheduling with confidentiality protection
- 1 July 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (4) , 514-519
Decentralised scheduling with confidentiality protection
- Open Access
- 16 March 2016
- Published by Springer Nature in Journal of Scheduling
- Vol. 20 (1) , 57-65
An integrated model for the transshipment yard scheduling problem
- 16 March 2016
- Published by Springer Nature in Journal of Scheduling
- Vol. 20 (1) , 57-65
Open AccessAn integrated model for the transshipment yard scheduling problem
- 1 January 2016
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 49 (12) , 237-242
Flexible Flow Shop with Storage: Complexity and Optimisation Methods
- 1 January 2016
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 49 (12) , 237-242
Flexible Flow Shop with Storage: Complexity and Optimisation Methods
- 16 October 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (2) , 405-425
Decentralised decision-making in a multi-party supply chain
In this paper, we consider multi-party coordination in a supply chain (SC) that consists of a set of independent producers and a set of resource managers. A decentralised decision-making approach is proposed for a coal SC, with three independent parties – multiple mines, a rail operator and a terminal. The rail operator and the terminal act as common resource managers and connects the independent mines via a rail network. The objective of this SC is to efficiently use an independent rail operator to transport coal from different mines to meet the shipping demand at the terminal. The underlying coordination problem can be seen as a multi-resource constrained scheduling problem. A major part of this paper addresses the key challenges in a decentralised approach based on column generation (CG), which are to compute the value of a column, better upper bounds and to update the multipliers using decentralised methods. We have also discussed the mathematical models for different decision units, the CG algorithm and different strengthening methods. A comprehensive computational experiment based on randomly generated instances highlights the effect of decentralisation and the value of information-sharing. The proposed solution approaches can be extended to a multi-party case with any number of common resources.
- 16 October 2015
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (2) , 405-425
Decentralised decision-making in a multi-party supply chain
In this paper, we consider multi-party coordination in a supply chain (SC) that consists of a set of independent producers and a set of resource managers. A decentralised decision-making approach is proposed for a coal SC, with three independent parties – multiple mines, a rail operator and a terminal. The rail operator and the terminal act as common resource managers and connects the independent mines via a rail network. The objective of this SC is to efficiently use an independent rail operator to transport coal from different mines to meet the shipping demand at the terminal. The underlying coordination problem can be seen as a multi-resource constrained scheduling problem. A major part of this paper addresses the key challenges in a decentralised approach based on column generation (CG), which are to compute the value of a column, better upper bounds and to update the multipliers using decentralised methods. We have also discussed the mathematical models for different decision units, the CG algorithm and different strengthening methods. A comprehensive computational experiment based on randomly generated instances highlights the effect of decentralisation and the value of information-sharing. The proposed solution approaches can be extended to a multi-party case with any number of common resources.
- 1 September 2015
- Published by Elsevier in International Journal of Production Economics
- Vol. 167, 63-73
Coordination in a multiple producers–distributor supply chain and the value of information
- 1 September 2015
- Published by Elsevier in International Journal of Production Economics
- Vol. 167, 63-73
Coordination in a multiple producers–distributor supply chain and the value of information
- 1 September 2015
- Published by Elsevier in Information Sciences
- Vol. 316, 397-418
Capacity planning in supply chains of mineral resources
- 1 September 2015
- Published by Elsevier in Information Sciences
- Vol. 316, 397-418
Capacity planning in supply chains of mineral resources
- 19 January 2015
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 49 (2) , 413-434
Rail schedule optimisation in the hunter valley coal chain
This paper describes a method for scheduling trains on the Hunter Valley Coal Chain rail network. Coal for a particular ship is railed from different mines to stockpiles at one of the Port’s terminals. The coal producers decide which mines will supply each order in what proportion, so there is no flexibility in the allocation of mines to cargoes. We are presented with a list of tonnes of coal which need to be transported from specified load points at mines to specified stockpiles at the port. The operators of the rail network provide a number of paths, with specified arrival and departure times, that can be used for coal movement. The requirement to assign coal trains to these existing paths makes this rail scheduling problem different to most of those discussed in the literature. In this paper we describe the problem in detail, demonstrate that it is very large making it difficult to solve with commercial MILP solvers, and show that our Lagrangian heuristic is able to produce high quality solutions in a reasonable amount of time.
- 19 January 2015
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 49 (2) , 413-434
Rail schedule optimisation in the hunter valley coal chain
This paper describes a method for scheduling trains on the Hunter Valley Coal Chain rail network. Coal for a particular ship is railed from different mines to stockpiles at one of the Port’s terminals. The coal producers decide which mines will supply each order in what proportion, so there is no flexibility in the allocation of mines to cargoes. We are presented with a list of tonnes of coal which need to be transported from specified load points at mines to specified stockpiles at the port. The operators of the rail network provide a number of paths, with specified arrival and departure times, that can be used for coal movement. The requirement to assign coal trains to these existing paths makes this rail scheduling problem different to most of those discussed in the literature. In this paper we describe the problem in detail, demonstrate that it is very large making it difficult to solve with commercial MILP solvers, and show that our Lagrangian heuristic is able to produce high quality solutions in a reasonable amount of time.