research-article

Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm

Authors:

Donald Davendra,

Magdalena Bialic-DavendraAuthors Info & Claims

ISMSI '20: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

Pages 93 - 98

https://doi.org/10.1145/3396474.3396475

Published: 30 May 2020 Publication History

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.

References

[1]

Taillard, E 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 2, 278--285.

[2]

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.

[3]

Thomas Vollmann, D. Clay Whybark, F. Robert Jacobs, and William B. 2011. Manufacturing Planning and Control for Supply Chain Management. McGraw-Hill Professional.

[4]

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.

[5]

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.

[6]

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.

[7]

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.

Digital Library

[8]

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.

Digital Library

[9]

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.

Digital Library

[10]

Chaudhry, J., and Mahmood, S. 2012. No-wait Flowshop Scheduling Using Genetic Algorithm. In Proceedings of the World Congress on Engineering. Vol. 3.

[11]

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.

[12]

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.

[13]

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.

[14]

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.

Digital Library

[15]

Holland J. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press.

[16]

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.

[17]

Conway., R. W. 1965. Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering, 16, 228--237.

[18]

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.

[19]

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.

Cited By

Davendra DHerrmann FBialic-Davendra M(2025)Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stationsNeural Computing and Applications10.1007/s00521-022-08044-037:2(579-596)Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s00521-022-08044-0

Index Terms

Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm
1. Applied computing
  1. Operations research
    1. Industry and manufacturing
      1. Command and control

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 computation

Genetic 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

Information & Contributors

Information

Published In

cover image ACM Other conferences

ISMSI '20: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

March 2020

142 pages

ISBN:9781450377614

DOI:10.1145/3396474

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

University of Delhi

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 May 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ISMSI '20

ISMSI '20: 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence

March 21 - 22, 2020

Thimphu, Bhutan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
47
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Davendra DHerrmann FBialic-Davendra M(2025)Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stationsNeural Computing and Applications10.1007/s00521-022-08044-037:2(579-596)Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s00521-022-08044-0

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten