Distributed optimisation method for multi-resource constrained scheduling in coal supply chains

Thomas, Anu; Singh, Gaurav; Krishnamoorthy, Mohan; Venkateswaran, Jayendran

doi:10.1080/00207543.2012.737955

Cited by 30 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As Fisher (2004) comments, the method does not meet the convergence requirement, that the sum of gradients tends to infinity, but it works empirically. But the subgradient method tends to oscillate in its outcome (Singh et al, 2011) and its convergence speed (Nie et al, 2008) especially when the size of the passage is small (Thomas et al, 2013). The multiplier has also been updated, using the Augmented Lagrangian method, a quadratic function to update the multiplier (Table 10).…”

Section: Characteristics Of the Implementation Of The Mechanismmentioning

confidence: 99%

Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review

Rius-Sorolla

Maheut

Miguel

et al. 2018

Cent Eur J Oper Res

View full text Add to dashboard Cite

The increase in the complexity of supply chains requires greater efforts to align the activities of all its members in order to improve the creation of value of their products or services offered to customers. In general, the information is asymmetric; each member has its own objective and limitations that may be in conflict with other members. Operations managements face the challenge of coordinating activities in such a way that the supply chain as a whole remains competitive, while each member improves by cooperating. This document aims to offer a systematic review of the collaborative planning in the last decade on the mechanisms of coordination in mathematical programming models that allow us to position existing concepts and identify areas where more research is needed.

show abstract

Section: Characteristics Of the Implementation Of The Mechanismmentioning

confidence: 99%

Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review

Rius-Sorolla

Maheut

Miguel

et al. 2018

Cent Eur J Oper Res

View full text Add to dashboard Cite

show abstract

“…While there exists work in which the mine-to-port transport problem, in a network of multiple mines and ports, is optimised (Thomas et al 2012, the composition and tons of ore produced at each mine, in each time period, is known a priori, in contrast to the : Management Science 00(0), pp. 000-000, c ⃝ 0000 INFORMS 7 problem we tackle in this paper.…”

Section: Related Workmentioning

confidence: 99%

A Decomposition-Based Algorithm for the Scheduling of Open-Pit Networks Over Multiple Time Periods

2016

View full text Add to dashboard Cite

We consider the multiple time period short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine, in each period, is transported by rail to a set of ports and blended into products for shipping. Each port forms these blends to a specification, as stipulated in contracts with downstream customers. This problem belongs to a class of multiple producer/consumer scheduling problems in which producers are able to generate a range of products, a combination of which are required by consumers to meet specified demands. In practice, short-term schedules are formed independently at each mine, tasked with achieving a grade and quality target outlined in a medium-term plan. Due to uncertainty in the data available to a medium-term planner, and the dynamics of the mining environment, such targets may not be feasible in the short-term. We present, in this paper, an algorithm in which the grade and quality targets assigned to each mine are iteratively adapted, ensuring the satisfaction of blending constraints at each port, while generating schedules for each mine that maximise resource utilisation. : 2 Management Science 00(0), pp. 000-000, c ⃝ 0000 INFORMS mine. Moreover, we describe a general class of multiple producer/consumer problems to which our solving approach can be applied, instances of which appear in a wide range of domains.The MTP-MMPP is significantly more complex than the single period MMPP solved by Blom et al. (2014). This is primarily due to the combinatorial complexity of selecting regions of material to extract across multiple time periods, and several mines -where many extraction schedules are possible -to optimise an objective that is dependent on the activity at each mine, in each period.A solution to the short-term MTP-MMPP schedules the movement of material, from available sources of ore and waste at each mine, to appropriate destinations, and the transport of ore between each mine and port, in each time period of a scheduling horizon. In the short-term, for the case study we consider in this paper, this horizon is 13 weeks long, split into weekly periods. During each time period, at each mine, ore from a variety of sources is processed and blended in a stockyard, producing ore of a specific grade and quality. Ore is reclaimed from this stockyard onto trains, railed to a port, and blended with ore from other mines to form desired products. An optimal solution to the MTP-MMPP requires coordination across mines. The grade and quality of production at each mine, in each period, must support the formation of correctly blended products at each port.In practice, short-term planning in a network of open-pit mines proceeds with the independent construction of block extraction schedules at each mine, by individual short-term planners. In this process, the short-term planner at each mine is guided by a five year, or medium-term, plan. This plan sets monthly grade and quality targets on mine production -assumed to be both achievable given the estimated com...

show abstract

“…También se encuentra la programación no lineal, como lo mencionan [40], [31], [32]. Así mismo metodologías como la multi-objetivo desarrollada por [41], o la programación mixta como lo menciona [42]. Por ultimo cabe destacar la metodología de algoritmo genético que genera avances significativos y que desarrollan autores como [30], [38], [33].…”

Section: Ingeniare Universidad Libre-barranquilla Año 12 No 20 Punclassified

Algoritmos aplicados en la programación de las cadenas de suministros para minimizar costos. Revisión de literatura*

2016

View full text Add to dashboard Cite

El objetivo del presente estudio fue recopilar la información existente de las herramientas más utilizadas en la planeación de las cadenas de suministros, donde el propósito fundamental es la reducción de los costos. esto se realizó a partir de una aplicación web, llamada tree of science, en donde se encontraron diversas tendencias a partir de las referencias bibliograficas. la revisión brindó conclusiones sobre las investigaciones y aplicaciones de herramientas de inteligencia artificial e investigacion de operaciones, como algoritmos, metaheurísticas , programación lineal, programacion no lineal, programación dinámica y algunos hibridos. Igualmente, el estudio concluyó acerca de los temas más tratados, vacíos de conocimiento y sectores económicos objeto de estudio, así como la identificación de objetivos y variables utilizadas en las publicaciones. Por último, se presentaron las metodologías identificadas y las más relevantes de la literatura. Palabras claves: Cadena de suministro, Algoritmo, Metaheurística, Programación, Costos, Tree of Science, Inteligencia Artificial.

show abstract

Distributed optimisation method for multi-resource constrained scheduling in coal supply chains

Cited by 30 publications

References 31 publications

Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review

Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review

A Decomposition-Based Algorithm for the Scheduling of Open-Pit Networks Over Multiple Time Periods

Algoritmos aplicados en la programación de las cadenas de suministros para minimizar costos. Revisión de literatura*

Contact Info

Product

Resources

About