.png){kind=icon}
.png){kind=icon}
Return
Distributed optimisation method for multi-resource constrained scheduling in coal supply chains
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2012.737955.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
distributed optimisation
integrated scheduling
coal logistics
resource constrained scheduling
Wedelin algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
View more organizations