{'fraction_non_alphanumeric': 0.020739404869251576, 'fraction_numerical': 0.010820559062218215, 'mean_word_length': 5.9375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Review of Solution Methodologies for Open Pit Mine Production Scheduling Problem

ABSTRACT The open pit mine production scheduling problem determines a sequence of three-dimensional, notional block extraction that maximises net present value (NPV) of future cash flows and satisfies technical and operational constraints such as precedence between blocks and resource availability. Since the 1960s, researchers have developed a variety of mathematical models that address block extraction at the strategic, tactical and operational levels, and the complexities associated therewith, e.g. risk and uncertainty, inventory strategies, environmental concerns and downstream processing. Given that these mathematical models are computationally complex, i.e. they are generally categorised as NP hard, a significant portion of the literature is dedicated to the development and performance of solution approaches spanning from exact and heuristics to recent meta-heuristic methods. This paper provides a comprehensive overview of recent contributions (from 2012 to early 2019) and discusses proposed future studies.