Buscar
Mostrando ítems 21-30 de 120
Learning in Combinatorial Optimization: What and How to Explore
(INFORMS, 2020)
We study dynamic decision making under uncertainty when, at each period, a decision maker implements a solution to a combinatorial optimization problem. The objective coefficient vectors of said problem, which are unobserved ...
A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application
(Elsevier, 2020)
In this work we address the Precedence Constrained Production Scheduling Problem (PCPSP), the problem of scheduling tasks in such a way that total profit is maximized, while satisfying conditions such as precedence constraints ...
A new hybrid heuristic algorithm for the Precedence Constrained Production Scheduling Problem: A mining application
(Elsevier Ltd, 2019)
In this work we address the Precedence Constrained Production Scheduling Problem (PCPSP), the problem of scheduling tasks in such a way that total profit is maximized, while satisfying conditions such as precedence constraints ...
A heuristic approach for scheduling activities with ‘OR’- precedence constraints at an underground mine
(Taylor & Francis, 2020)
Medium-term development planning of underground mines requires scheduling multiple activities to comply with long-term milestones, and to obtain a time span as short as possible. However, the planning must also respect the ...
Solving the operating room scheduling problem with prioritized lists of patients
(Springer, 2017)
The scheduling of surgical interventions directly impacts the number of patients that can be treated with given operating room resources. Medical centres often do not respond satisfactorily to the demand for interventions, ...
Aggregation heuristic for the open-pit block scheduling problem
(Elsevier, 2016)
In order to establish a production plan, an open-pit mine is partitioned into a three-dimensional array of blocks. The order in which blocks are extracted and processed has a dramatic impact on the economic value of the ...
A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy
(Springer Verlag, 2018)
This work introduces a model of the crew scheduling problem for the operation of trains in the mining industry in the North of Chile. The model possesses
particular features due to specific regulations with which train ...
Joint location-inventory problem with differentiated service levels using critical level policy
(Elsevier, 2015)
This paper analyzes the design of a distribution network for fast-moving items able to provide differentiated service levels in terms of product availability for two demand classes (high and low priority) using a critical ...
On distance-preserving elimination orderings in graphs: complexity and algorithms
(Elsevier, 2018-07-10)
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices in H is the same in H as in G. A distance-preserving elimination ordering of G is a total ordering of its vertex-set V ...
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
(Springer, 2017)
This article studies a multi-item auction characterized by asymmetric bidders and quantity discounts. We report a practical application of this type of auction in the procurement of Internet services to the 709 public ...