Scheduling copper refining and casting operations by means of heuristics for the flexible flow shop problem

Management of the operations in a copper smelter is fundamental for optimizing the use of the plant's installed capacity. In the refining and casting stage, the operations are particularly complex due to the metallurgical characteristics of the process. This paper tackles the problem of automatic scheduling of operations in the refining and casting stage of a copper concentrate smelter. The problem is transformed into a flexible flow shop problem and to solve it, an iterative method is proposed that operates in two stages: in the first stage, a sequence of jobs is constructed that configures the lots, and in the second, the constructed solution is improved by means of simulated annealing. Fifteen test problems are used to show that the proposed algorithm improves the makespan by an average of 9.42% and the mean flow time by 12.19% with respect to an existing constructive heuristic.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Tom Page,et al.  A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints , 2011 .

[5]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[6]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[7]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[8]  Stéphane Dauzère-Pérès,et al.  Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints , 2011 .

[9]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

[10]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[11]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[12]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[13]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[14]  Jamal Arkat,et al.  Flexible job shop scheduling with overlapping in operations , 2009 .

[15]  Víctor Parada,et al.  CODELCO, Chile Programs Its Copper-Smelting Operations , 2006, Interfaces.