Donald Davendra
ABSTRACT
This paper describes an approach for solving a tardiness constrained flow shop with simultaneously loaded stations using a Genetic Algorithm (GA). This industrial based problem is modeled from a filter basket production line and is generally solved using deterministic algorithms. An evolutionary approach is utilized in this paper to improve the tardiness and illustrate better consistent results. A total of 120 different problem instances in six test cases are randomly generated to mimic conditions, which occur at industrial practice and solved using 22 different GA scenarios. These results are compared with four standard benchmark priority rule based algorithms of First in First Out (FIFO), Raghu and Rajendran (RR), Shortest Processing Time (SPT) and Slack. From all the obtained results, GA was found to consistently outperform all compared algorithms for all the problem instances.
- Taillard, E 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 2, 278--285.Google Scholar
- Yochihiro Fuchigami, H., and Rangel, S. 2018. A survey of case studies in production scheduling: Analysis and perspectives. Journal of Computational Science, 25, 425--436.Google ScholarCross Ref
- Thomas Vollmann, D. Clay Whybark, F. Robert Jacobs, and William B. 2011. Manufacturing Planning and Control for Supply Chain Management. McGraw-Hill Professional.Google Scholar
- Englberger, J., Herrmann, F., and Manitz, M., 2016. Two-stage stochastic master production scheduling under demand uncertainty in a rolling planning environment. International Journal of Production Research, 54, 20, 6192--6215.Google ScholarCross Ref
- Ronconi D. P., and Armentano V. A. 2001. Lower Bounding Schemes for Flowshops with Blocking In-Process. The Journal of the Operational Research Society, 52, 11, 1289--1297.Google ScholarCross Ref
- Debora P., Ronconi and Luís R.S. Henriques. 2009. Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega, 37, 2, 272--281.Google ScholarCross Ref
- Zhongshi, S., Dechang, P., and Weishi, S. 2017. Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Computers & Industrial Engineering, 111, 331--351.Google ScholarDigital Library
- Zhongshi, S., Dechang, P., and Weishi, S. 2018. A multi-objective discrete invasive weed optimization for multi-objective blocking flow- shop scheduling problem. Expert Systems with Applications, 113, 77--99.Google ScholarDigital Library
- Samarghandi, H., and Behroozi, M. 2017. On the exact solution of the no-wait flow shop problem with due date constraints. Computers & Operations Research, 81, 141--159.Google ScholarDigital Library
- Chaudhry, J., and Mahmood, S. 2012. No-wait Flowshop Scheduling Using Genetic Algorithm. In Proceedings of the World Congress on Engineering. Vol. 3.Google Scholar
- Januario, Tiago de O., Arroyo, J and Moreira, M. 2009. Genetic Algorithm for Tardiness Minimization in Flowshop with Blocking. Springer Berlin Heidelberg, Berlin, Heidelberg, 153--164.Google Scholar
- Russell, R., Darwl, E., and Taylor, B. 1987. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research, 25, 10, 1523--1540.Google ScholarCross Ref
- Engel, S., Herrmann, F., and Moser, M. 1994. Priority rules and predictive control algorithms for on-line scheduling of FMS. Springer Netherlands, Dordrecht, 75--107.Google Scholar
- Hall, N., and Sriskandarajah, C. 1996. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process. Operations Research, 44, 3, 510--525.Google ScholarDigital Library
- Holland J. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press.Google Scholar
- Lawrence, S, and Morton, T. 1993. Resource- constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics. European Journal of Operational Research, 64, 2, 168--187.Google ScholarCross Ref
- Conway., R. W. 1965. Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16, 228--237.Google Scholar
- Raghu, T. S. and Rajendran, C. 1993. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics, 32, 301--313.Google ScholarCross Ref
- Aslan, M. Beskirli, M. Kodaz H, and Kiran M. 2018. An Improved Tree Seed Algorithm for Optimization Problems, International Journal of Machine Learning and Computing 8, 1, 20--25.Google ScholarCross Ref
Index Terms
- Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm
Recommendations
Genetic algorithm with genetic engineering technology for multi-objective dynamic job shop scheduling problems
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationGenetic algorithms were intensively investigated in various modifications and in combinations with other algorithms for solving the NP-hard scheduling problem. This extended abstract describes a genetic algorithm approach for solving large job shop ...
Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm
Based on Genetic Algorithm (GA) and Grouping Genetic Algorithm (GGA), this research develops a scheduling algorithm for job shop scheduling problem with parallel machines and reentrant process. This algorithm consists of two major modules: machine ...
A hybrid genetic algorithm for the job shop scheduling problems
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetics algorithm to address JSSP. We design a ...
Comments