\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Sustainable Manufacturing: Application of Optimization to Textile Manufacturing Plants},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2020-01-15 (revised: 15 January 2020)}
\def\TheID{10.34257/GJCSTHVOL20IS2PG11\makeatother }
\def\TheDate{2020-01-15}
\title{Sustainable Manufacturing: Application of Optimization to Textile Manufacturing Plants}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Isuru  Liyanage}

             \author[2]{Sachira  Nuwanga}

             \author[3]{Ravidu  Anjana}

             \author[4]{Windhya  Rankothge}

             \author[5]{Narmada  Gamage}

             \affil[1]{  Sri Lanka Institute of Information Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 7 December 2019 Accepted: 31 December 2019 Published: 15 January 2020}

\maketitle


\begin{abstract}
        


The main goal of manufacturing industry is to produce the end products on time with good quality and keep the resource wastage low. However, manufacturing industry face several challenges such as bottle necks in the workflow, unsynchronized production, and sudden increase in product demands.In this paper, we are proposing a management platform for textile manufacturing plants with following modules: (1) sewing workflow optimization (2) quality assurance workflow optimization and (3) finishing workflow optimizations. We have used Genetic Programming (GP) approach, to optimize the workflows, considering different factors that affect each workflow. Our results show that, using our proposed platform, the manufacturing workflows can be optimized and reduce the bottle necks in the workflows and resource wastage in the manufacturing plant.

\end{abstract}


\keywords{manufacturing plant, textile industry, optimization, planning, scheduling, genetic programming (GP).}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{10.34257/GJCSTHVOL20IS2PG11}}
\end{textblock*}\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
he textile industry is an important segment in the worlds' manufacturing industry, playing a crucial role in economic development. It is an evergrowing market, with key competitors being China, European Union, United States, and India \hyperref[b16]{[19]}. The textile sector offers huge employment opportunities for people, especially for the people reside in rural area.\par
In the textile industry, specifically in manufacturing plants, the production process is a combined effort of different sections such as designing, cutting, sewing, packing, and delivering. They ensure that the clothes are produced with good quality and delivered on time with minimal wastage. However, the textile industry faces several challenges such as bottle necks in the workflow, unsynchronized production, sudden increases in product demands and unseen product wastages \hyperref[b17]{[20]}.\par
Therefore, it is necessary to adopt to a proper planning and scheduling approach, so that the workflows of manufacturing plants can be optimized. The optimal planning and scheduling are traditionally modeled as Integer Linear Programming (ILP) optimization. However, there is the intrinsic constraint that ILP optimization is a NP-complete problem, and even when solutions are obtained for limited classes, it might be too slow  {\ref [5]}. Therefore, ILP calculation is unfeasible for optimization problems with dynamic nature, even though an ILP formalization of the problem gives an exact solution. The best approach would be to use an approximation approach (heuristic-based approach) for planning and scheduling of manufacturing plants activities.\par
In this paper, we have proposed a platform for planning and scheduling of a manufacturing plant, specifically targeting the textile industry. We have identified three main workflows of a textile manufacturing plants: sewing, quality assurance and finishing. Therefore, the proposed platform includes following modules: (1) sewing workflow optimization (2) quality assurance workflow optimization and (3) finishing workflow optimization. We have used an approximation (heuristic) based approach: Genetic Programming (GP), to optimize the identified work flows. The GP approach is a well-known method in the planning and scheduling context \hyperref[b0]{[1]}\hyperref[b1]{[2]}\hyperref[b2]{[3]}\hyperref[b3]{[4]} {\ref [5]}\hyperref[b4]{[6]}\hyperref[b5]{[7]}\hyperref[b6]{[8]}\hyperref[b7]{[9]}\hyperref[b8]{[10]}\hyperref[b9]{[11]}\hyperref[b10]{[12]}\hyperref[b11]{[13]}\hyperref[b12]{[14]}\hyperref[b13]{[15]}\hyperref[b14]{[16]}.Moreover, they have been widely used for research works related to manufacturing planning systems.\par
We have identified several parameters that effect each workflow, and processes required to be optimized in each workflow. We have consulted and visited textile manufacturing plants, their management and workers to identify the factors contributing to optimizing workflows. We have conducted experiments to measure the performances of our algorithms using the Sri Lankan textile manufacturing industry as a case study. With the real data sets, our results show that, our proposed GP approach can decide the optimal planning of each work flow dynamically in the order of seconds.\par
The rest of the paper is organized as follows. Section II presents the related work. Section III introduces the proposed optimization algorithm for planning and scheduling of textile manufacturing plants. In section IV, the result and discussions are presented. Our final remarks can be found on Section V. The references are mentioned in Section VI. 
\section[{II.}]{II.} 
\section[{Related Work}]{Related Work}\par
The Genetic Programming (GP) approach is a well-known method in the planning and scheduling context \hyperref[b0]{[1]}\hyperref[b1]{[2]}\hyperref[b2]{[3]}\hyperref[b3]{[4]} {\ref [5]}\hyperref[b4]{[6]}\hyperref[b5]{[7]}\hyperref[b6]{[8]}\hyperref[b7]{[9]}\hyperref[b8]{[10]}\hyperref[b9]{[11]}\hyperref[b10]{[12]}\hyperref[b11]{[13]}\hyperref[b12]{[14]}\hyperref[b13]{[15]}\hyperref[b14]{[16]}, especially for NP-hard problems, In this section, we will discuss the most recent work on scheduling and planning in the textile manufacturing context.\par
The work on \hyperref[b0]{[1]} shows that resourceconstrained project scheduling problems are NP-hard and therefore, it is recommended to use approximation (heuristic) approaches to solve the problem. They have proposed a multi-objective evolutionary algorithm to solve the problem with multiple activity performance modes and two objectives to minimize project makes pan and resource utilization smoothness. They have used GP for their proposed algorithm. The authors of \hyperref[b1]{[2]} used GP approach to implement an optimal resource allocation algorithm, that minimizes the average execution time of the critical path of workflow under constraints. The authors of \hyperref[b2]{[3]} show that Master Production Scheduling (MPS) is the key action for success of a textile manufacturing plant. First, they have analyzed the constraints, mainly the installed capacity and the number of workers. Next, with the use of genetic algorithms, the MPS is optimized to carry out production planning, with an improvement of up to 96\% of the level of service provided. The research \hyperref[b3]{[4]} developed a system that uses GP approach to optimize pattern generation in textile production. Their results show that the system can generates enough patterns for fabric designers according to a given set of constraints. The work on [5] focuses on scheduling trousers collection orders, considering dates of starting orders and exporting them, the quantities of each order and the combined importance of customer and style. They have used GP approach to generate the best orders scheduling solution. The study of \hyperref[b4]{[6]} addresses the production scheduling problem in a textile factory and they have used GP approach to find the minimum total make-span. The authors of \hyperref[b5]{[7]} presented a methodology to design a control strategy to optimize a complex production process using a neural network combined with GP. The GP approach is used to optimize the architecture and the underlying parameters of the neural network in order to achieve the most effective model of the production process and to obtain set point values and raw material characteristics for an optimal tenacity and elongation of the spinning yarns.\par
Our research work has been inspired by these works, and we are focusing on a proposing a management platform which helps textile manufacturing plants to optimize their workflows and schedule them with minimum bottle necks and wastages. 
\section[{III.}]{III.} 
\section[{Methodology}]{Methodology}\par
We are proposing to use an approximation approach (heuristic-based approach) for planning and scheduling of textile manufacturing plants workflows, which have a dynamic nature. Specifically, we are proposing to use Genetic Programming (GP) approach. We have identified 3 workflows in the textile manufacturing plant to apply the optimization: sewing, quality assurance and finishing. We have implemented the E-Optimizer platform, which can be used to optimize sewing, quality assurance and finishing workflows. Figure \hyperref[fig_1]{1} Shows the system diagram of E-Optimizer.\par
It is important to note that, there are several factors to be considered when optimizing selected workflows in the textile manufacturing plant. As the initial step, we have identified parameters that effect each workflow, and processes required to be optimized in each workflow. We have consulted and visited textile manufacturing plants, their management and workers to identify the factors contributing to optimizing workflows.\par
For sewing process, parameters such as number of pieces to be sew, number of pieces that can be handled by one machine, number of sewing machines and time taken for one item to be sewed, effect the effectiveness of workflow. In the quality assurance workflow, parameters such as availability of chemical stain removers, hot water and steam generators, number of washers, spinners, and dryers, effect the effectiveness of workflow. For the finishing workflow, parameters such as availability of hand irons with a vacuum press table, scissors press, carousel machines, steam dollies, availability of plastic bags, boxes, and cartons, effect the effectiveness of workflow. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XX Issue II Version I  GP is a method of processing the initial population (a group of individual solutions) to get adapted to a new better environment, through threemajor genetic operators: (1) selection, (2) crossover and (3) mutation \hyperref[b15]{[18]}. The group of individual solutions gradually evolved into a better area of the search space by continuing to evolve from generation to generation. They will eventually converge to the most appropriate individual solution, which is the optimal solution for a problem.\par
GP can be described by the following five main steps \hyperref[b15]{[18]} The process begins with generating a set of individuals which is called a Population. Each individual is a Solution to the problem. After the initial population is generated, a fitness function is used to measure how good each solution is. Out of all the solutions, the best solutions are selected for next generation population.\par
Then genetic operations are applied to selected solutions to generate new solutions. We have considered two types of genetic operators to produce offspring: (1) mutation and (2) crossover. Crossover and mutation perform two different activities. Crossover is a convergence operation which is intended to pull the current population towards a local min/max. But the Mutation is a divergence operation, and it infrequently break one or more members of a population out of a local min/max space and possibly discover a better space. Since the end goal is to bring the population to convergence, crossover happen more frequently and mutation, being a divergence operation, happen less frequently.\par
The newly generated solutions are added to the existing set of solutions, which is known as the current population. This process is continued until y number of generations are explored. In the final generation, the solution that gives the best fitness value is selected as the best solution. 
\section[{b) Optimization of sewing workflow}]{b) Optimization of sewing workflow}\par
The optimization goal for sewing workflow is to optimize the sewing capacity arrangement; that is to find the best set of clothes to be sew within a given time limit. Cloth types are prioritized based on their profit generation capabilities, and given a priority, where high profit generating clothes are given a high priority value, to ensure maximum profit generation.\par
The sewing workflow optimization can be explained as the following constrained optimization: Maximize:? ?? ?? . ?? ?? ?? ??=1\par
(1) Subject to the constraint:? ?? ?? . ?? ?? ? ?? ?? ??=1 (2)\par
Where, n\par
Chromosome size Ci i th gene (Cloth type) Pi Priority of the Cloth type i Ai Time taken to sew the Cloth type i X Time Threshold\par
The constraint (2) ensures that the selected set of clothes can be sewn within the given time threshold.\par
When we apply GP approach to the optimization problem, the encoding of a Chromosomes (optimal set of clothes to be sew within a given time limit) is demonstrated in Figure \hyperref[fig_2]{2}. The set of Chromosomes: A1, A2, A3 and A4 build the population. In a Chromosome, each gene supplies two pieces of information: (i) the gene index number represents the cloth type and (ii) the value in the gene signifies the whether the cloth type has been selected to sew or not. A "1"indicates that the respective item is selected and a "0" indicates that it is not selected. For example, the value of the last gene of Chromosome A1, indicates that the cloth type "Denim" has not been selected to sew. (3) Next, the genetic operators are applied to Chromosomes to produce off-springs. Even though the traditional way of producing off-springs is to select the fittest chromosomes and perform genetic operations, it would lead to chromosomes that are closer to one another and results in less diversity. Therefore, we have used Roulette Wheel Selection method [17] and generated better off springs, with more diversity.\par
In the Roulette Wheel Selection method, a circular wheel is divided into n pies, where n is the number of Chromosomes in the population. Each Chromosome gets a portion of the circle which is proportional to its fitness value.\par
As given in Table  {\ref I}, first, the fitness value percentage is calculated for each Chromosome. Then the Roulette Wheel is represented as shown in Figure  {\ref 3}, where each Chromosome gets a portion of the circle which is proportional to its fitness value. 
\section[{Fig. 3: Roulette Wheel Selection representation}]{Fig. 3: Roulette Wheel Selection representation}\par
To select parents to generate off-springs, first the wheel is rotated, and then the region of the wheel which comes in front of a fixed point is chosen as the parent. For the second parent, the same process is repeated. Genetic operations are performed to the selected two parents. We have performed one-point crossover and mutation to generate off-springs. This process is continued until x number of generations are explored. In the final generation, the solution that gives the best fitness value is selected as the best solution. 
\section[{c) Optimizaiton of quality assurance workflow}]{c) Optimizaiton of quality assurance workflow}\par
The quality assurance process in textile industry ensures that there are no stains on manufactured clothes. Therefore, if a stain in spotted, the cloth is sent for cleaning. The optimization goal for quality assurance workflow is to optimize the cleaning process; that is to find the best set of clothes to be cleaned within a given time limit.\par
The quality assurance workflow optimization can be explained as the following constrained optimization: Maximize:? ?? ?? . ?? ?? ?? ??=1\textbf{(4)}\par
Subject to the constraint: The constraint (4) ensures that the selected set of clothes can be cleaned within the given time threshold.? ?? ?? . ?? ?? ? ?? ?? ??=1\textbf{(5)}\par
The GP approach used to optimize the quality assurance workflow is same as the GP approach used to optimize the sewing workflow, except for the fitness function, which measures how good a solution is.\par
The fitness function used in optimization of the quality assurance workflow is given in Equation (  {\ref 6}).?????????????? = ? ?? ?? . ?? ?? ?? ??=1 (6) 
\section[{d) Optimizing finishing workflow}]{d) Optimizing finishing workflow}\par
The finishing process in textile manufacturing carries out pressing and ironing of the cloth. The optimization goal for finishing workflow is to optimize the finishing process; that is to find the best set of clothes to be pressed and ironed within a given time limit.\par
The finishing workflow optimization can be explained as the following constrained optimization: Maximize: The constraint (8) ensures that the selected set of clothes can be cleaned within the given time threshold.? ?? ?? . ?? ?? ?? ??=1\par
The GP approach used to optimize the quality assurance workflow is same as the GP approach used to optimize the sewing workflow, except for the fitness function, which measures how good a solution is.\par
The fitness function used in optimization of the quality assurance workflow is given in Equation \hyperref[b7]{(9)}.?????????????? = ? ?? ?? . ?? ?? ?? ??=1\textbf{(9)}\par
IV. 
\section[{Experiments and Results}]{Experiments and Results}\par
In this section, we are presenting the results and observations of the modules:(1) sewing optimization (2) quality assurance optimization and (3) finishing optimization, which were implemented using the GP based approaches. We have consulted and visited textile manufacturing plants, their management and workers to identify the factors contributing to optimizing workflows and to collect the data sets related to three workflows.\par
We have used GP as our heuristic-based optimization approach because it gives reasonable results fast. We derived three individual fitness functions for the three work flows, based on the factors effecting each flow. We have used mutation and one-point cross over as genetic operations and selected parents using Roulette Wheel approach to generate off-springs. 
\section[{a) Optimizing sewing workflow}]{a) Optimizing sewing workflow}\par
Case 1: As explained in the in previous section, with the GP process the given initial solution is improved by mutations and crossover operations over the generations. Therefore, we explored how GP process improves the initial solution when optimizing the sewing workflow. First, we find the initial solutions, and then apply GP process to improve the solution. As shown in the Figure \hyperref[fig_5]{4}, most of the improvements in the fitness function happens early on (during first 8 generations) and after that improvements happens very rarely.\par
Case 2: Next we explored the relationship between time and number of generations for sewing optimization process. As shown in Figure \hyperref[fig_6]{5}, time taken for generations shows a sub-linear growth, and the optimal values are produced within milliseconds.    
\section[{c) Optimizing finishing workflow}]{c) Optimizing finishing workflow}\par
Case 5: To explore how the initial solution is improved with GP process when optimizing the finishing workflow, we conducted experiments. First, we find the initial solutions, and then applied GP process to improve the solution. As shown in the Figure  {\ref 8}, most of the improvements in the fitness function happens early on (during first 6 generations) and after that improvements happens very rarely.   
\section[{Final Remarks}]{Final Remarks}\par
We have proposed a management platform for optimization and scheduling of textile manufacturing plant, specifically for following workflows: (1) sewing optimization (2) quality assurance optimization and (3) finishing optimization. We have used Genetic Algorithms as our heuristic-based optimization approach to get reasonable results fast. We have consulted and visited textile manufacturing plants, their management and workers to identify the factors contributing to optimizing workflows. We derived three individual fitness functions for the three work flows, based on the factors effecting each flow. Our results show that, using our proposed modules, the manufacturing plant work flows can be optimized and scheduled efficiently and effectively.\par
As the future work, we are planning to extend the optimization research work, specifically to explore other heuristic approaches such as Iterated Local Search (ILS), and make recommendations on most suitable optimization approaches.\par
Also, we are planning to work on a prediction module, that predicts the expected time to finish workflow, specific for different cloth types, instead of using an average time threshold for all cloth types. The prediction module will help us to build a complete platform for optimization and scheduling of textile manufacturing plant.\begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-2.png}
\caption{\label{fig_0}12}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Fig. 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{64}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Fig. 6 : 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{78}\includegraphics[]{image-9.png}
\caption{\label{fig_8}Fig. 7 :Fig. 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-10.png}
\caption{\label{fig_9}Fig. 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.225\textwidth}P{0.1875\textwidth}P{0.43749999999999994\textwidth}}
Chromosome\tabcellsep Fitness\tabcellsep Percentage of Fitness\\
A1\tabcellsep 26\tabcellsep 20.8\\
A2\tabcellsep 25\tabcellsep 20\\
A3\tabcellsep 42\tabcellsep 33.6\\
A4\tabcellsep 32\tabcellsep 20.6\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\footnote{© 2020 Global Journals} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Hartmann ()]{b0}\label{b0} 	 		‘A competitive genetic algorithm for resource-constrained project scheduling’.  		 			S Hartmann 		.  	 	 		\textit{Naval Research Logistics}  		1998. 45  (7)  p. .  	 
\bibitem[Mitchell ()]{b15}\label{b15} 	 		\textit{An Introduction to Genetic Algorithms},  		 			M Mitchell 		.  		1998. Cambridge, MA, USA: MIT Press.  	 
\bibitem[Rankothge et al. ()]{b8}\label{b8} 	 		‘Experimental results on the use of genetic algorithms for scaling virtualized network functions’.  		 			W Rankothge 		,  		 			F Le 		,  		 			A Russo 		,  		 			J Lobo 		.  	 	 		\textit{Proc. IEEE SDN/NFV},  				 (IEEE SDN/NFV)  		2015. p. .  	 
\bibitem[Jayasuriya et al. ()]{b11}\label{b11} 	 		‘Experimental Study on an Efficient Dengue Disease Management System: Planning and Optimizing Hospital Staff Allocation’.  		 			M C Jayasuriya 		,  		 			K T Galappaththi 		,  		 			D Sampath 		.  	 	 		\textit{International Journal of Advanced Computer Science and Applications}  		2018.  	 
\bibitem[Md and Akter ()]{b17}\label{b17} 	 		 			Maeen Md 		,  		 			Akter 		.  		\textit{Sustainability in Textile Industry; Reality and Challenges},  				2019.  	 	 (Textile Focus) 
\bibitem[Jicheng and Xitong ()]{b1}\label{b1} 	 		\textit{Optimization method of workflow resources allocation under cost constraints},  		 			Jisuanji Jicheng 		,  		 			Zhizao Xitong 		.  		2007.  	 
\bibitem[Wdi Fernando and Rankothge]{b12}\label{b12} 	 		\textit{Optimization of Customer-Friendly Manual Load Shedding System},  		 			W H Wdi Fernando 		,  		 			Rankothge 		.  		 ICAC 2019.  		 	 
\bibitem[Lorente and Murillo-Valle ()]{b2}\label{b2} 	 		‘Optimization of the Master Production Scheduling in a Textile Industry Using Genetic Algorithm’.  		 			Leandro L Lorente 		,  		 			Jefferson R Murillo-Valle 		.  	 	 		\textit{International Conference on Hybrid Artificial Intelligence Systems},  				2019.  	 
\bibitem[Kurniawan and Sofianti ()]{b4}\label{b4} 	 		‘Optimizing Production Scheduling Using Genetic Algorithm in Textile Factory’.  		 			Harwin Kurniawan 		,  		 			Tanika D Sofianti 		.  	 	 		\textit{Journal of System and Management Sciences}  		2014.  	 
\bibitem[Rankothge et al. ()]{b7}\label{b7} 	 		‘Optimizing Resource Allocation for Virtualized Network Functions in a Cloud Center Using Genetic Algorithms’.  		 			W Rankothge 		,  		 			F Le 		,  		 			A Russo 		,  		 			J Lobo 		.  	 	 		\textit{Proc. IEEE IM},  				 (IEEE IM)  		2015. p. .  	 
\bibitem[Obe and Egwuche ()]{b3}\label{b3} 	 		‘Scheduling Optimization in a Cloth Manufacturing Factory Using Genetic Algorithm with Fuzzy Logic for Multi-Objective Decisions’.  		 			O Obe 		,  		 			O S Egwuche 		.  	 	 		\textit{Annals. Computer Science Series}  		2018. 2010.  (5) .  	 	 (Technology and Management) 
\bibitem[Smmm Senarath and Perera ()]{b13}\label{b13} 	 		‘Smart Platform for Film Shooting Management’.  		 			Smmm Senarath 		,  		 			Perera 		.  	 	 		\textit{CICT}  		2019.  	 
\bibitem[Perera et al. ()]{b10}\label{b10} 	 		\textit{Sustainable Tourism: Application of Optimization Algorithms to Schedule Tour Plans},  		 			Dhanuka Perera 		,  		 			Chamod Rathnayaka 		,  		 			Sachin Dilan 		,  		 			Lasitha Siriweera 		,  		 			W H Rankothge 		.  		2018. p. R10.  	 
\bibitem[Lal]{b16}\label{b16} 	 		‘The Textiles and Clothing Industry and Economic Development: A Global Perspective’.  		 			Kaushalesh Lal 		.  	 	 		\textit{Innovation Policies and International Trade Rules},  				 	 
\bibitem[Thiranjaya et al. ()]{b14}\label{b14} 	 		\textit{Towards a Smart City: Application of Optimization for a Smart Transportation Management System},  		 			C Thiranjaya 		,  		 			P Rushan 		,  		 			Udayanga 		.  		2018.  	 	 (ICIAfS) 
\bibitem[Rankothge et al. ()]{b6}\label{b6} 	 		‘Towards making network function virtualization a cloud computing service’.  		 			W Rankothge 		,  		 			J Ma 		,  		 			F Le 		.  	 	 		\textit{Proc. IEEE IM},  				 (IEEE IM)  		2015. p. .  	 
\bibitem[Muthusinghe et al. ()]{b9}\label{b9} 	 		\textit{Towards Smart Farming: Accurate Prediction of Paddy Harvest and Rice Demand},  		 			M R S Muthusinghe 		,  		 			S T Palliyaguru 		,  		 			W A N D Weerakkody 		,  		 			A M Saranga 		,  		 			W H Rankothge 		.  		2018. p. R10.  	 
\bibitem[Sette and Boullart ()]{b5}\label{b5} 	 		‘Using Genetic Algorithms to Design an Overall Control Strategy of an Industrial Process’.  		 			S Sette 		,  		 			L Boullart 		.  	 	 		\textit{IFAC Proceedings Volumes},  				1997.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
