Data-Driven Models and Methodologies to Optimize Production Schedules
Automation, Control and Intelligent Systems
Volume 4, Issue 1, February 2016, Pages: 1-9
Received: Jan. 29, 2016;
Accepted: Feb. 8, 2016;
Published: Mar. 2, 2016
Views 3610 Downloads 127
Prabhakar Sastri, Automation and Data Analytics Department, Isa Technologies Pvt. Ltd., Manipal, India
Andreas Stephanides, Automation and Data Analytics Department, Isa Technologies Pvt. Ltd., Manipal, India
Follow on us
Data driven Models based on production parameters in combination with modern optimization algorithms are shown to be useful in industry to optimize production schedules and improve profitability. Based on real data obtained from an existing facility, we have developed models for time and costs of heat treatment. Using these data statistical models have been developed and used to find an optimal solution to the Job-Shop scheduling problem using three algorithms namely Particle Filter, Particle Swarm Optimization and Genetic Algorithm. The algorithm is useful when we would like to arrive at job schedules based on a mix of both time and cost optimization. The results are compared and future work discussed with respect to the data used.
Data-Driven Models, Optimized Production Scheduling, Job-Shop Scheduling, Time Based and/or Cost Based Production Optimization, Management Decision Tool
To cite this article
Data-Driven Models and Methodologies to Optimize Production Schedules, Automation, Control and Intelligent Systems.
Vol. 4, No. 1,
2016, pp. 1-9.
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/
) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Graham, Ronald L. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 1966; 45 (9): 1563-1581.
Dimopoulos, A. M. S., C.; Zalzala. Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Transactions on Evolutionary Computation 2000; 4.
Mathirajan, M, V Chandru, and AI Sivakumar. Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries. Sadhana 2007; 32 (5): 479-500.
Jamili, Amin, Mohammad Ali Shaa, and Reza Tavakkoli-Moghaddam. A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem. The International Journal of Advanced Manufacturing Technology 2011; 54 (1-4): 309-322.
Gomez Urrutia, Edwin David, Riad Aggoune, and Stephane Dauzere-Peres. Solving the integrated lot-sizing and job-shop scheduling problem. International Journal of Production Research (ahead-of-print): 2014; 1-19.
Luarn, Ching-Jong Liao; Chao-Tang Tseng; Pin. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 2007; 34.
Wang, Yong Ming, Hong Li Yin, and Jiang Wang. “Genetic algorithm with new encoding scheme for job shop scheduling.” The International Journal of Advanced Manufacturing Technology 2009; 44 (9-10) 977-984.
Pfund, Lars Monch, Hari Balasubramanian; John W. Fowler; Michele E. Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research 2005; 32.
Bean, James C. Genetic algorithms and random keys for sequencing and optimization. ORSA journal on computing 1994; 6 (2): 154-160.
Uzsoy, Cheng-Shuo Wang; Reha. A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research 2002; 29.
Taillard, E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64.
Shaw, KJ, AL Nortcli e, M Thompson, J Love, PJ Fleming, and CM Fonseca. Assessing the performance of multiobjective genetic algorithms for optimization of a batch process scheduling problem. Proceedings of the 1999 Congress on Evolutionary Computation, 1999; CEC 99, Vol. 1.