Gaurav Singh

Gaurav Singh

Auto-generated profile, based on publicly available information

Gaurav Singh

CSIRO

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 February 2017 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
Andreas ErnstAndreas Ernst
Andreas Ernst
COCeyda Oğuz
Ceyda Oğuz
GSGaurav Singh
Gaurav Singh
GTGita Taherkhani
Gita Taherkhani

19 March 2014 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
DTDhananjay Thiruvady
Dhananjay Thiruvady
Andreas ErnstAndreas Ernst
Andreas Ernst
GSGaurav Singh
Gaurav Singh

1 July 2012 in European Journal of Operational Research
Verified
Journal Article
Closed access
GSGaurav Singh
Gaurav Singh
DSDavid Sier
David Sier
Andreas ErnstAndreas Ernst
Andreas Ernst
OGOlena Gavriliouk
Olena Gavriliouk
RORob Oyston
Rob Oyston
PWPalitha Welgama
Palitha Welgama

1 January 2013 in International Journal of Production Economics
Verified
Journal Article
Closed access
DTDhananjay Thiruvady
Dhananjay Thiruvady
GSGaurav Singh
Gaurav Singh
Andreas ErnstAndreas Ernst
Andreas Ernst
BMBernd Meyer
Bernd Meyer

1 May 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
ATAnu Thomas
Anu Thomas
GSGaurav Singh
Gaurav Singh
MKMohan Krishnamoorthy
Mohan Krishnamoorthy
JVJayendran Venkateswaran
Jayendran Venkateswaran
We consider an integrated planning and scheduling problem motivated by the coal supply chains in Australia. The problem considers production planning of several independent mines. The mines need trains to complete delivery of coal by the arrival of ships at the terminal. The trains, on the other hand, are in limited supply and therefore the mines need to share this common resource. For this problem, we present a mixed integer programming formulation which minimises total weighted earliness, tardiness and operational costs. We also present a distributed algorithm based on the Lagrangian relaxation, which incorporates the volume and Wedelin algorithms. The strength of our distributed algorithm is demonstrated by an extensive computational experiment on several randomly generated instances.

1 August 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
ATAnu Thomas
Anu Thomas
JVJayendran Venkateswaran
Jayendran Venkateswaran
GSGaurav Singh
Gaurav Singh
MKMohan Krishnamoorthy
Mohan Krishnamoorthy