2016
DOI: 10.1287/mnsc.2015.2284
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
29
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(29 citation statements)
references
References 40 publications
0
29
0
Order By: Relevance
“…If we multiply both sides of the above inequalities with the denominator of q , we obtain linear constraints (see, e.g., Rivera Letelier et al 2020). Except for Montiel and Dimitrakopoulos (2015) and Blom et al (2016), all the quality-related constraints observed in the papers from Table 2 are linear grade control constraints. Montiel and Dimitrakopoulos (2015) maximize discounted profits in an open-pit copper mine.…”
Section: Problem Specification and Related Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…If we multiply both sides of the above inequalities with the denominator of q , we obtain linear constraints (see, e.g., Rivera Letelier et al 2020). Except for Montiel and Dimitrakopoulos (2015) and Blom et al (2016), all the quality-related constraints observed in the papers from Table 2 are linear grade control constraints. Montiel and Dimitrakopoulos (2015) maximize discounted profits in an open-pit copper mine.…”
Section: Problem Specification and Related Literaturementioning
confidence: 99%
“…Montiel and Dimitrakopoulos emphasize in their work that the corresponding blending constraint is nonlinear; consequently, the authors propose a risk-based heuristic approach to tackle the problem without suggesting any linear mathematical formulation. Blom et al (2016) consider a multiple mine, multiple time-period, open-pit production scheduling problem. The authors define the productivity of a mine in terms of the desirable utilization of dig and trucking resources, i.e., dig and trucking resources should be fully utilized.…”
Section: Problem Specification and Related Literaturementioning
confidence: 99%
“…The mathematical model for joint stochastic short-term production scheduling and fleet management optimization for mining complexes is formulated as a stochastic integer programming model with fixed recourse (Birge and Louveaux 2011), and builds upon the simultaneous stochastic optimization of the components of a mining complex that are pertinent to long-term mine planning (Goodfellow 2014;Dimitrakopoulos 2016, 2017). In this section, a general notation and objective function of the mathematical model are presented first.…”
Section: Mathematical Formulationmentioning
confidence: 99%
“…The integrated blending optimisation decides not only the material flows inside each mine site but also the suitable match between mine-side products and port-side products such that the final blends are in line with certain quality targets over time. In other words, such an optimisation problem deals with a network of multiple mines and multiple ports in a multiple-time-period setting, known as MTP-MMPP [6].…”
Section: Introductionmentioning
confidence: 99%
“…Instead of defining explicitly all separation constraints, the authors in [6] utilised a delayed constraint generation method in which an inspection of solution feasibility is performed during the solution progress and any violated instances of separation constraints are added to the mixed integer program (MIP) model before the next solve. The rationale of this implementation is that it is often sufficient to find the optimal solution without going through all constraints ap- plicable.…”
Section: Introductionmentioning
confidence: 99%