Hiindex LOGO

Research Article

Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan


Author(s): Pervaiz Iqbal , P.S. Sehik Uduman
Affiliation: Research Scholar
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=834"><img src="http://www.hindex.org/sai.php/2014SCIA316F0834" alt="SAI"></a>


File:

http://www.hindex.org/2014/p834.pdf


Citation: Pervaiz Iqbal, P.S. Sehik Uduman. "Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan." International Journal of Computing Algorithm 3.2 (2014): 176-180.

Abstract:
Generally the Flowshop Scheduling Problem FSSP is a production environment problem where a set of n jobs has to visit a set of m machines in the same order. In permutation flow shops the sequence of jobs is the same on all machines with the objective of minimizing the sum of completion timesusing Genetic Algorithm. A significant research effort has been devoted for sequencing jobs in a flowshop for minimizing the make span. No machine is allowed to remain idle when a job is ready for processing. This paper, describes the Permutation Flowshop Scheduling Problem PFSSPsolved by using Genetic Algorithm GA to minimize the makespan. The basic concept of genetic algorithm is, that it is developed for finding near to optimalsolution for the minimum makespan of the n jobs, m machines permutation flowshop scheduling problem. It shows that the innovative genetic algorithm approach which provides competitive results for the solution of Permutation Flowshop Scheduling Problem.


Keywords Flowshop Scheduling, Permutation Flowshop Scheduling, Genetic Algorithm, Makespan.


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Gen1483411, author = {Pervaiz Iqbal,P.S. Sehik Uduman}, title = {Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan}, journal={International Journal of Computing Algorithm}, volume={3}, issue={2}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] J.N.D. Gupta, “M-stage Scheduling Problem – A Critical Appraisal”, The International Journal of Production Research, 8, No. 2, 1971, pp. 276-281.
  • [2] R.A. Dudek and O.F. Teuton, “Development of M-stage decision rule for scheduling n-jobs through M-machines”, Ops Res, Vol.12, pp. 471, 1964.
  • [3] A.P.G. Brown and Z.A. Lomnicki, “Some Applications of the Branch and Bound Algorithm to the Machine Scheduling Problem”, Operational Research Quarterly, 17, No. 2, 1966, pp. 173-186.
  • [4] J.N.D. Gupta, “A General Algorithm for the n × M Flowshop Scheduling Problem”, The International Journal of Production Research, 7, No. 3, 1969, pp. 241-247.
  • [5] J.N.D. Gupta, “M-stage Flowshop Scheduling Problem by Branch and Bound”, Opsearch, India 7, No. 1, 1970, pp. 37-43.
  • [6] S.M. Johnson, “Optimal two-and three-stage production schedules with setup times included”, Naval Research Logistics Quarterly, Vol.1, pp.61-68, 1954.
  • [7] M.R. Garey, D.S. Johnson and R. Sethi, “Complexity of flow-shop and job-shop scheduling,” Mathematics of Operations Research, Vol.1, Issue 2, pp.117-129, 1976.
  • [8] C.L. Chen, V.S. Vempati and N. Aljaber, “An application of genetic algorithms for flow-shop problems”, European Journal of Operational Research, Vol.80, pp.389-396, 1995.
  • [9] T. Murata, H. Ishibuchi, and H. Tanaka, “Genetic algorithms for flow shop scheduling problems”, Computers and Industrial Engineering, Vol.30, pp.1061-1071, 1996.
  • [10] C.R. Reeves, “A Genetic algorithm for flow-shop sequencing”, Computers and Operations Research, Vol.22, Issue 1, pp.5-13, 1995.
  • [11] S.G. Ponnambalam, P. Aravindan, and S. Chandrasekaran, “Constructive and improvement flow shop scheduling heuristics: an extensive evaluation”, Production Planning and Control, Vol.12, Issue 4, pp.335-344, 2001.
  • [12] R. Ruiz, and C. Maroto, “A comprehensive review and evaluation of permutation flow-shop heuristics”, European Journal of Operational Research, Vol.165, pp.479-494, 2004.
  • [13] PervaizIqbal, P.S. Sheik Uduman and S. Srinivasan, “Job sequencing problem using advanced heuristics techniques”, Proceedings of the International Conference on Applied Mathematics and Theoretical Computer Science, Vol.1, pp.15-18, 2013.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>2</issue> <startPage>176</startPage> <endPage>180</endPage> <documentType>article</documentType> <title language='eng'>Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan</title> <authors> <author> <name>Pervaiz Iqbal</name> </author> </authors> <abstract language='eng'>Generally the Flowshop Scheduling Problem FSSP is a production environment problem where a set of n jobs has to visit a set of m machines in the same order. In permutation flow shops the sequence of jobs is the same on all machines with the objective of minimizing the sum of completion timesusing Genetic Algorithm. A significant research effort has been devoted for sequencing jobs in a flowshop for minimizing the make span. No machine is allowed to remain idle when a job is ready for processing. This paper, describes the Permutation Flowshop Scheduling Problem PFSSPsolved by using Genetic Algorithm GA to minimize the makespan. The basic concept of genetic algorithm is, that it is developed for finding near to optimalsolution for the minimum makespan of the n jobs, m machines permutation flowshop scheduling problem. It shows that the innovative genetic algorithm approach which provides competitive results for the solution of Permutation Flowshop Scheduling Problem.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p834.pdf</fullTextUrl> <keywords language='eng'> <keyword>Flowshop Scheduling, Permutation Flowshop Scheduling, Genetic Algorithm, Makespan.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=834", "name":"Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan", "author":[{"name":"Pervaiz Iqbal "}], "datePublished":"2014", "description":"Generally the Flowshop Scheduling Problem FSSP is a production environment problem where a set of n jobs has to visit a set of m machines in the same order. In permutation flow shops the sequence of jobs is the same on all machines with the objective of minimizing the sum of completion timesusing Genetic Algorithm. A significant research effort has been devoted for sequencing jobs in a flowshop for minimizing the make span. No machine is allowed to remain idle when a job is ready for processing. This paper, describes the Permutation Flowshop Scheduling Problem PFSSPsolved by using Genetic Algorithm GA to minimize the makespan. The basic concept of genetic algorithm is, that it is developed for finding near to optimalsolution for the minimum makespan of the n jobs, m machines permutation flowshop scheduling problem. It shows that the innovative genetic algorithm approach which provides competitive results for the solution of Permutation Flowshop Scheduling Problem.", "keywords":["Flowshop Scheduling, Permutation Flowshop Scheduling, Genetic Algorithm, Makespan."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>P.S. Sehik Uduman</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Pervaiz Iqbal</dc:creator> <dc:date>2014</dc:date> <dc:description>Generally the Flowshop Scheduling Problem FSSP is a production environment problem where a set of n jobs has to visit a set of m machines in the same order. In permutation flow shops the sequence of jobs is the same on all machines with the objective of minimizing the sum of completion timesusing Genetic Algorithm. A significant research effort has been devoted for sequencing jobs in a flowshop for minimizing the make span. No machine is allowed to remain idle when a job is ready for processing. This paper, describes the Permutation Flowshop Scheduling Problem PFSSPsolved by using Genetic Algorithm GA to minimize the makespan. The basic concept of genetic algorithm is, that it is developed for finding near to optimalsolution for the minimum makespan of the n jobs, m machines permutation flowshop scheduling problem. It shows that the innovative genetic algorithm approach which provides competitive results for the solution of Permutation Flowshop Scheduling Problem.</dc:description> <dc:identifier>2014SCIA316F0834</dc:identifier> <dc:language>eng</dc:language> <dc:title>Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0834", "abstract": "Generally the Flowshop Scheduling Problem FSSP is a production environment problem where a set of n jobs has to visit a set of m machines in the same order. In permutation flow shops the sequence of jobs is the same on all machines with the objective of minimizing the sum of completion timesusing Genetic Algorithm. A significant research effort has been devoted for sequencing jobs in a flowshop for minimizing the make span. No machine is allowed to remain idle when a job is ready for processing. This paper, describes the Permutation Flowshop Scheduling Problem PFSSPsolved by using Genetic Algorithm GA to minimize the makespan. The basic concept of genetic algorithm is, that it is developed for finding near to optimalsolution for the minimum makespan of the n jobs, m machines permutation flowshop scheduling problem. It shows that the innovative genetic algorithm approach which provides competitive results for the solution of Permutation Flowshop Scheduling Problem.", "author": [ { "family": "Pervaiz Iqbal,P.S. Sehik Uduman" } ], "id": "834", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Genetic Algorithm For Permutation Flowshop Scheduling Problem To Minimize The Makespan", "type": "publication-article", "version": "3" }