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

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 specificati...

Full description

Saved in:
Bibliographic Details
Published in:Management science Vol. 62; no. 10; pp. 3059 - 3084
Main Authors: Blom, Michelle L., Pearce, Adrian R., Stuckey, Peter J.
Format: Journal Article
Language:English
Published: Linthicum INFORMS 01.10.2016
Institute for Operations Research and the Management Sciences
Subjects:
Algorithms
Analysis
Consumers
Customers
Data mining
hybrid optimisation
Methods
Mineral industry
Mines
Mining
Mining industry
Nonlinear programming
Ports
Production management
Production scheduling
Satisfaction
Scheduling (Management)
Short term
short-term open-pit mine production scheduling
Specification
Time periods
Uncertainty
United States
ISSN:0025-1909, 1526-5501
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Because of 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. In this paper, we present 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. This paper was accepted by Yinyu Ye, optimization .
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.2015.2284