Applying genetic algorithm for hybrid job shop scheduling in a cosmetic industry

This work considers the problem of scheduling a given set of jobs in a Flexible Job Shop in a cosmetic industry, located in Colombia, taking into account the natural complexity of the process and a lot of amount of variables involved, this problem is considered as NP-hard in the strong sense. Therefore, it is possible to find and optimal solution in a reasonable computational time for only small instances, which in general, does not reflect the industrial reality. For that reason, it is proposed the use of metaheuristics as an alternative approach in order to determine, with a low computational effort, the best assignment of jobs in order to minimize the number of tardy jobs. This optimization objective will allow to company to improve their customer service. A Genetic Algorithm (GA) is proposed. Computational experiments are carried out comparing the proposed approach versus instances of literature by Chiang and Fu. Results show the efficiency of our GA Algorithm.

[1]  Miguel A. González.  Metaheuristic solutions to the "Job shop scheduling problem with sequence-dependent setup times" , 2013, AI Commun..

[2]  Sheik Meeran,et al.  A State-of-the-art Review of Job-Shop Scheduling Techniques , 2017 .

[3]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[4]  Klaus Jansen,et al.  Approximation algorithms for flexible job shop problems , 2000, Int. J. Found. Comput. Sci..

[5]  Miguel Ortíz-Barrios,et al.  Solving Flexible Job-Shop Scheduling Problem with Transfer Batches, Setup Times and Multiple Resources in Apparel Industry , 2016, ICSI.

[6]  Liao Qiang.  SOLVING JOB-SHOP SCHEDULING OPTIMIZATION PROBLEM WITH GENETIC ALGORITHM , 1999 .

[7]  J. C. Osorio,et al.  Hierarchical production planning in the flexible job shop , 2008 .

[8]  L. Fu,et al.  A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop , 2008 .

[9]  Vitaly A. Strusevich,et al.  Two-stage open shop scheduling with a bottleneck machine , 2001, Eur. J. Oper. Res..

[10]  Yanchun Liang,et al.  Solving Job Shop Scheduling Problem Using Genetic Algorithm with Penalty Function , 2010, Int. J. Intell. Inf. Process..

[11]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[12]  Gang Rong,et al.  Integrating genetic algorithm with time control for just-in-time scheduling problems , 2015 .

[13]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[14]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[15]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[16]  Zhenyuan Jia,et al.  Research on job-shop scheduling problem based on genetic algorithm , 2011 .

[17]  Jatinder N. D. Gupta,et al.  A comprehensive review of flowshop group scheduling literature , 2016, Comput. Oper. Res..

[18]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[19]  Mario Vanhoucke,et al.  A hybrid single and dual population search procedure for the job shop scheduling problem , 2011, Eur. J. Oper. Res..