\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={A Review for Dynamic Scheduling in Manufacturing},
 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{2018-01-15 (revised: 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018-01-15}
\title{A Review for Dynamic Scheduling in Manufacturing}
\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]{Khalid Muhamadin Mohamed Ahmed  Bukkur}

             \author[2]{M.I.  Shukri}

             \author[3]{Osama Mohammed  Elmardi}

             \affil[1]{  Nile Valley University}

\renewcommand\Authands{ and }

\date{\small \em Received: 9 December 2017 Accepted: 4 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


This paper discusses review of literature of dynamic scheduling in manufacturing. First, the problem is defined. The scheduling problems are classified based on the nature of the shop configuration into five classes, i.e., single machine, parallel machines, flow shop, job shop, and open shop. A variety of approaches have been developed to solve the problem of dynamic scheduling. Dynamic scheduling could be classified into four categories, completely reactive scheduling, predictive-reactive scheduling, robust predictive reactive scheduling, and robust proactive scheduling. It is better to combine together different techniques such as operational research and artificial intelligence to overcome dynamic scheduling problems so as to endow the scheduling system with the required flexibility and robustness, and to suggest various orientations for further work is this area of research.

\end{abstract}


\keywords{dynamic scheduling, rescheduling, real-time events, operational research, artificial intelligence.}

\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*}


\let\tabcellsep& 	 	 		 \par
produce stochastically over time. Each product requires a combination of resources, sequentially and/or in parallel, for different processing times. The overall aim of our work is to show how dynamic scheduling problem was solved and determined the best ways for dealing with this problem. 
\section[{a) Definition of dynamic scheduling problems}]{a) Definition of dynamic scheduling problems}\par
A dynamic scheduling problem is generally viewed as a collection of linked static problems  . Scheduling in manufacturing is an activity of allocating jobs to resources with respect to a time frame that considers critical ratio and considered as N-P hard type of problem (Tarun Kanti Jana, 2013). The main problem in job-shop and flexible job-shop scheduling is that of obtaining the best possible schedules with optimal solutions (Ahmad Shahrizal Muhamad, 2011). There is a need to incorporate these dynamic events into the scheduling process, in order to ensure feasibility of the scheduling plan that the manufacturing system is following . Realtime scheduling theory has traditionally focused upon the development of algorithms for feasibility analysis (determining whether all jobs can complete execution by their deadlines) and run-time scheduling (generating schedules at run-time for systems that are deemed to be feasible) of such systems (Joseph Y-T. Leung"Sanjoy Baruah 2004). The problem of scheduling in the presence of real time events, termed dynamic scheduling. Real-time events have been classified into two categories. 
\section[{b) Scheduling problem classifications}]{b) Scheduling problem classifications}\par
Suppose that (m) machines ( )m j M j\par
,..., 1 = have to process (n) jobs ( )\par
Resource-related: Machine breakdown, operator illness, unavailability or tool failures, loading limits, delay in the arrival or shortage of materials, defective material (material with wrong specification), etc. Job-related: Rush jobs, job cancellation, due date changes, early or late arrival of jobs, change in job priority, changes in job processing time, etc. (Djamila . Also (A. S. ,  and (Chao Lu, 2017b) agree with that categories.\par
ynamic scheduling is the process of absorbing the effect of real-time events, analyzing the current status of scheduling and automatically modifying the schedule with optimized measures in order to mitigate disruptions (Amer Fahmya, 2014). Also dynamic scheduling which is named rescheduling and it is the process of updating an existing production schedule in response to disruptions or other change . Also dynamic scheduling is a direct allocation of tasks to resources, according to given sequencing rules (Kalinowski Krzyszt of 2013). Real-world scheduling problems are combinatorial, dynamic and stochastic (Daria . The goal in such problems is to determine an approach that dictates, at every decision epoch, how the available resources should be allocated among competing job requests in order to optimize the performance of the system (Daria Terekhova, 2014). Real world scheduling requirements are related with complex systems operated in dynamic environments. That make the current schedules easily outdated and unsuitable (A. . In a more general way, dynamic changes can be seen as a set of inserted and cancelled constraints (I. Pereira 2013). The dynamic scheduling problems that our work about are characterized by a stream of products that should D one or more machines . The scheduling problems are classified based on the nature of the shop configuration into five classes, i.e., single machine, parallel machines, flow shop, job shop, and open shop(J.Behnamian 2014)(Eliana María González-Neira, 2017). 
\section[{c) Optimality criteria (objective functions)}]{c) Optimality criteria (objective functions)}\par
We denote the finishing time of job i J by i C , and the associated cost by ( )i i C f\par
. There are essentially two types of total cost functions.( ) ( ) \{ \} n i C f C f i i ,..., 1 max : max = = and ( ) ( ) ? ? = n i i i i C f C f 1 : i i i d C L ? = : lateness \{ \} i i i c d E ? = , 0 max : earliness \{ \} i i i d C T ? = , 0 max : tardiness i i i d C D ? = : absolute deviation ( )\textbf{2}\par
:  i i i d C S ? = squared deviation i i i d ifC U ? = 0 : , 1 otherwise unit penalty. 
\section[{With each of these functions}]{With each of these functions}? ? i i i i i i G w G G w G , , max , max, i T ? , i i T w ? , i U ? , i i U w ? , i D ? , i i D w ? , i S ? , i i S w ? , i E ? i i E w\par
. Linear combinations of these objective functions are also considered. An objective function which is non decreasing with respect to all variables i C is called regular. Functions involvingi i i S D E , ,\par
are not regular. The other functions defined so far are regular. A schedule is called active if it is not possible to schedule jobs (operations) earlier without violating some constraint. A schedule is called semi active if no job (operation) can be processed earlier without changing the processing order or violating the constraints . 
\section[{Global Journal of Researches in Engineering ( ) Volume XVIII Issue V Version I}]{Global Journal of Researches in Engineering ( ) Volume XVIII Issue V Version I}\par
Practical experience shows that some computational problems are easier to solve than others. Complexity theory provides a mathematical framework in which computational problems are studied so that they can be classified as "easy" or "hard". One of the main issues of complexity theory is to measure the performance of algorithms with respect to computational time. A problem is called polynomially ( )P solvable if there exists a polynomial p such that ( ) ( ) ( ) x p O x T ?\par
for all inputs x for the problem, i.e. if there is a k such that ( ) ( )k x O x T ? (Jun Zhao, 2014).\par
A commonly faced problem in flow-shop scheduling is that it belongs to the class of NP-hard problems (Florian T. . We are dealing with scheduling problems which are not decision problems, but optimization problems. An optimization problem is called NP-hard if the corresponding decision problem is NP-complete. A decision problem P is NP-complete in the strong sense if P belongs to NP and there exists a polynomial q for which Pq is NP-complete (Chuanli Zhao, 2017) . The knowledge that a scheduling problem is NP-hard is little consolation for the algorithm designer who needs to solve the problem. Fortunately, despite theoretical equivalence, not all NP-hard problems are equally hard from a practical perspective.\par
We have seen that some NP-hard problems can be solved pseudo polynomially using dynamic programming. Another possibility is to apply approximation algorithms. One of the most successful methods of attacking hard combinatorial optimization problems is the discrete analog of "hill climbing", known as local (or neighborhood) search. Any approach without formal guarantee of performance can be considered a "heuristic". Such approaches are useful in practical situations if no better methods are available .\par
Called bottleneck objectives and sum objectives, respectively. The scheduling problem is to find a feasible schedule which minimizes the total cost function. If the functions i f are not specified, we set ?= max f or ?= ? i f . However, in most cases we consider special functions i f . The most common objective functions are that make span max Other objective functions depend on due dates i d which are associated with jobs i J . We define for each job i J :\{ i C | n i ,..., 1 = \}, 
\section[{III. CURRENT DYNAMIC SCHEDULING APPROACHES}]{III. CURRENT DYNAMIC SCHEDULING APPROACHES}\par
Dynamic scheduling divided into four categories, completely reactive scheduling, predictivereactive scheduling, robust predictive-reactive scheduling, and robust pro-active scheduling . In (Amer Fahmya, 2014) and (Djamila  there are three main dynamic scheduling categories (or strategies),completely reactive scheduling, robust pro-active scheduling, predictive-reactive scheduling. 
\section[{a) Completely reactive scheduling}]{a) Completely reactive scheduling}\par
In completely reactive scheduling no firm schedule is generated in advance and decisions are made locally in real-time. A dispatching rule is used to select the next job with highest priority to be processed from a set of jobs awaiting service at a machine that becomes free . This scheduling type termed as "Dispatching" or "Priority Rule-based Scheduling". This approach was introduced by(Dongjuan, 2010) who proposed a dynamic scheduling established through an aloging connectivity. A new policy proposed for scheduling systems with setups, the Hedging Zone Policy (HZP) policy belongs to what we called the Clearing Cruising (CC) Class, which includes all produce-up-to or base stock policies . There was another work presented deal with dynamic task allocation mechanism for machine scheduling in a job shop environment following agent based holonic control approach. (Tarun Kanti Jana 2013). A new optimization-based control algorithm was proposed that developed for the buffer management and the production scheduling of a multiple-line production plant (Andrea Cataldo 2015). An approach to dynamically adjust the parameters of a dispatching rule was presented depending on the current system conditions by using machine learning method and demonstrate the capability of their work by reducing the mean tardiness of job . There was another article deals with a parallel machine scheduling problem subject to non-interference constraints. The good results presented by the heuristic enable the evaluation of different storage policies for real size instances (Gabriela N. Maschiettoa 2016). A work of a multi-agent-based dynamic scheduling system was introduce for manufacturing flow lines (MFLs) using the Prometheus methodology (PM) considering the dynamic customer demands and internal disturbances. The proposed decision making system supports both static and dynamic scheduling (Ali Vatankhah Barenji, 2016). A complex manufacturing network model CMNBS was proposed for RFID "radio frequency identification" -driven DMS" discrete manufacturing system" modeling, performance analyzing and dynamic scheduling (Jiewu Leng, 2017).\par
There was another work, a simulated annealing and the dispatching rule based complete rescheduling approaches as well as the simulation optimization tools are proposed for dynamic identical parallel machines scheduling problem with a common server (Alper Hamzadayi 2016). There was another work considered the problem of optimizing on-line the production scheduling of a multiple-line production plant (Andrea Cataldo, 2015). 
\section[{b) Robust pro-active scheduling}]{b) Robust pro-active scheduling}\par
This scheduling approach is based on building predictive schedules with studying the main causes of disruptions and integrating them into the schedules. The disruptions are measure based on actual completion measures compared to the originally planned completions; then the mitigation of these disruptions was mitigated through simple adjustment to the activities durations ). An algorithm was developed for the optimal production schedule in a backward dynamic programming approach. It will be applied to the development of an algorithm for production scheduling problems which permit backlogging (C. S. SUNG 1987).  
\section[{c) Predictive-reactive scheduling}]{c) Predictive-reactive scheduling}\par
Predictive-reactive scheduling is the most common dynamic scheduling approach used in manufacturing systems. Most of the definitions reported in the literature on dynamic scheduling refer to predictive-reactive scheduling.  
\section[{e) Comparison of dynamic scheduling approaches}]{e) Comparison of dynamic scheduling approaches}\par
Dynamic scheduling has been defined under four categories: on-line scheduling (completely reactive approaches), predictive-reactive scheduling, robust predictive-reactive scheduling, and robust pro-active scheduling. In completely reactive scheduling, schedules are easily generated using dispatching rules. However, the solution quality is poor due to the nature of these rules. Predictive-reactive scheduling is the most common approach in dynamic scheduling. Predictive reactive approaches search in a larger solution space, generate high quality schedules, and can generate better system performance to increase productivity and minimize operating costs compared with on-line scheduling and predictive scheduling. Simple schedule adjustments require little effort and are easy to implement. However, they may lead to poor system performance. Generating robust schedules lead to better system performance, even though robustness measures are not easy to define. Predictive-reactive scheduling is a scheduling/ rescheduling process in which schedules are revised in response to real-time events. Predictive-reactive scheduling is a two step process. First, a predictive schedule is generated in advance with the objective of optimizing shop performance without considering possible disruptions on the shop floor. This schedule is then modified during execution in response to real-time events .(Abdallah  Introduced a new approach for solving dynamic RCPSP "Resource Constrained Project Scheduling Problem" instances. This work is based on new constraint programming techniques. And provided a complete system able to handle both dynamic and over-constrained scheduling problems. (Chuanyu Zhao, 2013) Proposed a novel and rigorous RDHS "real-time dynamic hoist Scheduling " methodology , which takes into account uncertainties of new coming jobs and targets real-time scheduling optimality and applicability. (Bing-hai Zhou, 2013) Proposed a dynamic scheduling method of the photolithography process based on kohonen neural network. It determines the optimal combination of scheduling policies due to the special system status. (Gomes, 2014) Stated that dynamic events must be taken into account, since they may have a major impact on the schedule. They can change the system status and affect performance. Manufacturing systems require immediate response to these dynamic events. (Paolo Priore, 2015) Stated that dispatching rules are usually applied to schedule jobs in Flexible Manufacturing Systems (FMSs) dynamically. A scheduling approach that employs Support Vector Machines (SVMs) and case-based reasoning (CBR) was proposed.(Yuxin Zhai 2017) Proposed adynamic scheduling approach to minimize the electricity cost of a flow shop with a grid-integrated wind turbine. (Chao Lu, 2017b)There was another work developed a highperformance multi-objective predictive-reactive scheduling method for this MODWSP in order to narrow the gap between theoretical research and applicable practice.   
\section[{Global}]{Global} 
\section[{DYNAMIC SCHEDULING TECHNIQUES APPLIED t O MANUFACTURING SYSTEMS}]{DYNAMIC SCHEDULING TECHNIQUES APPLIED t O MANUFACTURING SYSTEMS} 
\section[{a) Dispatching rules}]{a) Dispatching rules}\par
Dispatching rules have played a significant role within dynamic contexts. . From the literature reviewed, Dispatching heuristic was able to provide not only a good solution but also the best solutions for the system observed . Dispatching rules are quick but lack robustness and adaptability(Atif Shahzad, 2016). (Edna Barbosa da Silva, 2014) In this work, a simulation model was proposed to evaluate sequencing solutions and present a simulation study of dispatching rules in stochastic job shop dynamic scheduling. (Atif Shahzad, 2016) Stated that dynamic scheduling uses priority dispatching rule (PDR) to prioritize jobs waiting for processing at a resource. 
\section[{b) Heuristics techniques}]{b) Heuristics techniques}\par
Heuristics are problem specific schedule repair methods, which do not guarantee to find an optimal schedule, but have the ability to find reasonably good solutions in a short time. The most common schedule repair heuristics are: right-shift schedule repair, match-up schedule repair, and partial schedule repair . Dispatching rules are also heuristics that have played a significant role in completely reactive scheduling. And used in real-time to select the next job waiting for processing at a resource (Djamila . (JurgenBranke 2016) In this work constitutes the first comprehensive review of hyper-heuristics for the automated design of production scheduling heuristics, providing a simple taxonomy and focusing on key design choices such as the learning method, attributes, representation and fitness evaluation. (Andrea Rossi, 2013). 
\section[{c) Meta-heuristics Techniques}]{c) Meta-heuristics Techniques}\par
Meta-heuristics (tabu search, simulated annealing, the ant colony algorithm, bee colony and genetic algorithms) have been successfully used to solve production scheduling problems . Meta-heuristics have been widely used to solve static deterministic production scheduling. However, little research work has addressed the use of metaheuristics in dynamic scheduling (Djamila . Tabu search algorithm is the alternative approaches to the modern meta-heuristic optimization techniques  . In this work a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources (Sana Alyaseri, 2013) . Ant Colony Optimization (ACO) is a meta-heuristic technique and is used to find shortest path between source and destination  . The ant colony algorithm is a new method to deal with the rescheduling problem of observing spacecraft  . In this work, an efficient an improved ant colony optimization IACO is proposed for flexible job shop scheduling problem FJSP in order to minimize make span(Lei Wang, 2017) .There was another method proposed that makes use of the greedy randomized adaptive search procedure (GRASP) also used to solve dynamic scheduling problems (Adil Baykaso?lu, 2017).Also, a hybrid genetic and simulated annealing algorithms is developed because of the high potential of outcomes to be trapped in the local optima (Aidin Delgoshaei, 2016). As solution approaches, two meta-heuristic solution approaches based on the simulated annealing (SA) algorithm and the discrete particle swarm optimization (DPSO) are proposed to obtain a near optimal solution in a reasonable amount of time (Byung Jun Joo, 2015). There was another work proposed a GA for solving the agile job shop scheduling to minimize the make span . Also in this work, an implementation of a standard GA (SGA) to solve the task scheduling problem has been presented (Omara and Arafa, 2010). A genetic algorithm approach is applied to hypothetical numerical examples with the objective of minimizing the makespan in the work of (C. S.  {\ref Wong, 2013)} Hyper-heuristics are defined as "an automated methodology for selecting or generating heuristics to solve hard computational search problems" (Jurgen Branke, 2016). There was another work developed a two-stage hyper-heuristic to automatically generate sets of dispatching rules for complex and dynamic scheduling problems. The approach combines a GP hyper-heuristic that evolves a composite rule from basic attributes (Christoph W. . There was another study used a hybrid heuristic model combining both Genetic Algorithm (GA) and Fuzzy Neural Network (FNN) (Alper . This work introduces a two-phase hybrid solution method. The first phase relies on solving a series of linear programming problems to generate an initial solution. In the second phase, a variable neighborhood descent procedure is applied to improve the solution (Amina . This work presented a Greedy Randomized Adaptive Search Procedure (GRASP)-Mixed Integer Programming (MIP) hybrid algorithm for solving the precedence constrained production scheduling problem (PCPSP) of mine optimization (Angus Kenny, 2017). For solving a multi-objective optimization problem, a mathematical model formulated and a new hybrid multi-objective backtracking search optimization algorithm developed with an energy saving scenario (Chao Lu, 2017a). A dynamic and heterogeneous hybrid Architecture for Optimized and Reactive Control, ORCA, was introduced and applied to the manufacturing scheduling of an FMS (Cyrille Pach, 2014).
\begin{quote}
.\end{quote}
 
\section[{e) Artificial intelligence techniques}]{e) Artificial intelligence techniques}\par
A number of dynamic scheduling problems have adopted artificial intelligence techniques such as knowledge-based-systems, neural networks, casebased reasoning, fuzzy logic, Petri nets, etc. (Banu Çali? 2013). (LIXIN TANG 2005)(T.  In this works a neural network approach was proposed to a dynamic job shop scheduling problems. There was another work present a survey of the use of an AI technique, in various manufacturing systems . To derive better dynamic scheduling systems, some researchers developed hybrid systems which combine various artificial intelligence techniques (Binodini Tripathy, 2015). 
\section[{f) Multi-agent-based dynamic scheduling}]{f) Multi-agent-based dynamic scheduling}\par
To optimize performance, scheduling decisions are made centrally at the level of the supervisor, and then distributed to the manufacturing resource level for execution . In the present work, Multiagents was proposed to find the near optimal solution for job shop scheduling problem using GA and VNS approach in parallel (Rakesh . 
\section[{g) The model of network topology technique}]{g) The model of network topology technique}\par
A contribution made towards solving the problem of dynamic scheduling on parallel machines by introducing a model of network topology technique which captures some important aspects of the practical scheduling problem (Anja Feldmann 1994). 
\section[{h) Constraint programming technique}]{h) Constraint programming technique}\par
Recently, Constraint Programming (CP) attracts a high interest among both planning and scheduling community. It was based on the idea of describing the problem declaratively by means of constraints, logical relations among several unknowns (or variables), and, consequently, finding a solution satisfying all the constraints . 
\section[{i) Environment driven, function-based technique}]{i) Environment driven, function-based technique}\par
In this technique, an environment driven, function-based was developed for solving the dynamic single-machine scheduling problem. This technique can capture uncertainty and dynamic characteristics associated with the dynamic environment. (Arezoo Atighehchian 2013). There is another work proposes an innovative approach to study the dynamic scheduling problem in FMS, taking the objectives of minimum or maximum energy consumption into account (Liping Zhang, 2013). 
\section[{j) Comparison of dynamic scheduling techniques}]{j) Comparison of dynamic scheduling techniques}\par
In order to ascertain the value of the various solution techniques, there has been some published work comparing some of these techniques. Heuristics have been widely used to react to the presence of realtime events because of their simplicity, but they may become stuck in poor local optima. To overcome this, meta heuristics such as tabu search, simulated annealing, and genetic algorithms have been proposed. Several comparative studies have been provided in the literature to compare the performance of tabu search, genetic algorithms, and simulated annealing. Unlike simulated annealing and tabu search based on manipulating one feasible solution, genetic algorithms manipulate a population of feasible solutions. Genetic algorithms were found not efficient to find a nearoptimal solution in a reasonable time compared to tabu search and simulated annealing which operate on a single configuration and not on an entire population. Knowledge-based systems possess the potential for automating human expert reasoning and heuristic knowledge to run production scheduling systems. In terms of effectiveness of the decision-making capability, knowledge-based systems are limited by the quality and integrity of the specific domain knowledge. Fuzzy logic has not yet been explored to its fullest potential. Neural networks cannot guarantee to provide optimal decisions, but their learning capability makes them to have a lot of promise. In addition, in developing practical integrated dynamic scheduling systems, it is necessary to combine together different techniques such as operational research and artificial intelligence to endow the scheduling system with the required flexibility and robustness (Djamila . In order to give recommendations on when it is beneficial to use a hyper-heuristic and how to design it, extensive and meaningful performance comparisons of evolved heuristics with more sophisticated (global) solution algorithms as well as between different hyper-heuristics are needed. So far, such comparisons have been rather limited hyper-heuristic approaches have strengths compared to global optimization approaches in particular in dynamic and stochastic environments where a quick reaction is important. They also become more competitive as the problem size (and thus the search space for the global optimizer) increases. One reason for the limited number of comparisons may be that hyper-heuristics possess several properties that make a fair comparison particularly difficult. For example, not only are the hyper-heuristics stochastic algorithms with many parameters to tune, but also is the evaluation function often a stochastic simulation, resulting in stochastic fitness values. Also, the running time for the simulations can be quite substantial, and, to make things worse, the running time to evaluate a particular dispatching rule strongly depends on the rule itself, as the time to calculate the priority value and the numbers of jobs in the system depend on the rule itself. This implies that a comparison of hyper heuristics based on the same number of function evaluations has limited validity (Jurgen Branke, 2016). For The network topology technique there was a question which remain open were, how can the model be extended to capture the practical scheduling even better? and if the competitive ratio is the right performance measurement? also of interest is whether randomization can help to improve the performance of the scheduling algorithm (Anja Feldmann 1994). About constraints programming despite of studying the proposed framework using the complex process environment background we believe that the results are applicable in general to other (non-production) problem areas where mixed planning and scheduling capabilities are desirable . The efficiency of the functionbased approach is evaluated against the most commonly used dispatching rules. Moreover, the proposed approach is compared with an agent-based approach, which employs the Q-learning algorithm to develop a decision-making policy. Experimental results show that the proposed approach is an effective method for dynamic single-machine scheduling (Arezoo Atighehchian 2013).\par
A dynamic scheduling is not dissection making problem but it is optimization problem. And it concerns with resources available, the jobs that should be done and the perfect time to do jobs. In manufacturing operations there should be an optimum utilization between resources and jobs in minimum time to gain markets. I think that a dynamic scheduling is a good way to solve any problem of scheduling in the presence of real-time events for allocating jobs to resources in manufacturing. From the above we can define dynamic scheduling like this "A dynamic scheduling is the optimum Utilization between resources and jobs in real time events ". Predictive-reactive scheduling is the most common approach in doing dynamic scheduling. It searches in a larger solution space, generate high quality schedules, and can generate better system performance to increase productivity and minimize operating costs compared with on-line scheduling and predictive scheduling. In computational complexity sense optimization problems belongs to the class of NP-hard problems. Not all NP-hard problems are equally hard from a practical perspective. We have seen that some NP-hard problems can be solved pseudopolynomially using dynamic programming or "hill climbing", known as local (or neighborhood) search Dynamic scheduling has been solved using many techniques. It is necessary to combine together different techniques such as operational research and artificial intelligence to endow the scheduling system with the required flexibility and robustness for example integrating neural networks, simulation, and expert systems or a hybrid approach. I think that dynamic scheduling has a main role in developing the fourth industrial revolution.\par
A Dynamic scheduling is the optimum Utilization between resources and jobs in real time events. The scheduling problems were classified based on the nature of the shop configuration into five classes. Dynamic scheduling divided into four categories. Predictive-reactive scheduling is the most common approach. In computational complexity sense optimization problems belongs to the class of a NPhard problems, practical experience shows that some computational problems are easier to solve than others. To solve dynamic scheduling, it is necessary to combine together different techniques such as operational research and artificial intelligence. Further work in this topic is expected to investigate the role of dynamic scheduling in manufacturing systems in Industry 4.0"the fourth industrial revolution", and as a core element of systems engineering, also doing\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}iG}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}.}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 1 :}\end{figure}
      			\footnote{© 2018 Global Journals} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Computers & Industrial Engineering]{b31}\label{b31} 	 		\textit{},  	 	 		\textit{Computers \& Industrial Engineering}  		112 p. .  	 
\bibitem[ Computers & Industrial Engineering]{b110}\label{b110} 	 		\textit{},  	 	 		\textit{Computers \& Industrial Engineering}  		112 p. .  	 
\bibitem[Brucker ()]{b23}\label{b23} 	 		\textit{},  		 			P Brucker 		.  		2007. Berlin Heidelberg Springer.  	 
\bibitem[Brucker ()]{b102}\label{b102} 	 		\textit{},  		 			P Brucker 		.  		2007. Berlin Heidelberg Springer.  	 
\bibitem[Amer Fahmya and Bassionic ()]{b9}\label{b9} 	 		\textit{},  		 			T M H Amer Fahmya 		,  		 			Hesham Bassionic 		.  	 	 		\textit{Pm World Journal}  		2014. 9.  	 
\bibitem[Barbosa Da et al. ()]{b39}\label{b39} 	 		\textit{},  		 			Edna Barbosa Da 		,  		 			M G C Silva 		,  		 			Marilda F´atima De Souza Da 		,  		 			Fabio Henrique Silva 		,  		 			Pereira 		.  	 	 		\textit{Simulation Study of Dispatching Rules In Stochastic Job Shop Dynamic Scheduling. World Journal of Modelling and Simulation}  		2014. 10 p. 11.  	 
\bibitem[Kumar et al. ()]{b57}\label{b57} 	 		\textit{},  		 			V S Kumar 		,  		 			O J Soni 		,  		 			G Kumar 		,  		 			R 		.  		 \url{Https://Www.Researchgate.Net/Publication/273695480}  	 	 		\textit{a Review on Artificial Neural Network Approach in Manufacturing Systems}  		2014.  	 
\bibitem[Amer Fahmya and Bassionic ()]{b89}\label{b89} 	 		\textit{},  		 			T M H Amer Fahmya 		,  		 			Hesham Bassionic 		.  	 	 		\textit{Pm World Journal}  		2014. 9.  	 
\bibitem[Zhao et al. ()]{b51}\label{b51} 	 		‘A Bayesian Networks Structure Learning and Reasoning-Based Byproduct Gas Scheduling in Steel Industry’.  		 			Jun Zhao 		,  		 			W Kan Sun 		,  		 			Ying Liu 		.  	 	 		\textit{Ieee Transactions on Automation Science and Engineering}  		2014. 11.  	 
\bibitem[Zhao et al. ()]{b130}\label{b130} 	 		‘A Bayesian Networks Structure Learning and Reasoning-Based Byproduct Gas Scheduling In Steel Industry’.  		 			Jun Zhao 		,  		 			W Kan Sun 		,  		 			Ying Liu 		.  	 	 		\textit{Ieee Transactions on Automation Science and Engineering}  		2014. 11.  	 
\bibitem[Cai et al. ()]{b79}\label{b79} 	 		‘A Delay-Based Dynamic Scheduling Algorithm for Bag-of-Task Workflows With Stochastic Task Execution Times in Clouds’.  		 			Zhicheng Cai 		,  		 			XL 		,  		 			Ruben Ruiz 		,  		 			Qianmu Li 		.  	 	 		\textit{Future Generation Computer Systems}  		2017. 71 p. .  	 
\bibitem[Cai et al. ()]{b158}\label{b158} 	 		‘A Delay-Based Dynamic Scheduling Algorithm for Bag-Of-Task Workflows with Stochastic Task Execution Times in Clouds’.  		 			Zhicheng Cai 		,  		 			XL 		,  		 			Ruben Ruiz 		,  		 			Qianmu Li 		.  	 	 		\textit{Future Generation Computer Systems}  		2017. 71 p. .  	 
\bibitem[Vatankhah Barenji et al. ()]{b6}\label{b6} 	 		‘A Dynamic Multi-Agent-Based Scheduling Approach for Smes’.  		 			Ali Vatankhah Barenji 		,  		 			RV B 		,  		 			Danial Roudi 		,  		 			Majid Hashemipour 		.  	 	 		\textit{The International Journal of Advanced Manufacturing Technology}  		2016. 89 p. .  	 
\bibitem[Vatankhah Barenji et al. ()]{b86}\label{b86} 	 		‘A Dynamic Multi-Agent-Based Scheduling Approach for Smes. the’.  		 			Ali Vatankhah Barenji 		,  		 			RV B 		,  		 			Danial Roudi 		,  		 			Majid Hashemipour 		.  	 	 		\textit{International Journal of Advanced Manufacturing Technology}  		2016. 89 p. .  	 
\bibitem[Sung ()]{b25}\label{b25} 	 		‘A Dynamic Production Scheduling Model With Lost-Sales or Backlogging’.  		 			C S Sung 		,  		 			JT R 		.  	 	 		\textit{Comput. Opns Res}  		1987. 14.  	 
\bibitem[Sung ()]{b104}\label{b104} 	 		‘A Dynamic Production Scheduling Model with Lost-Sales or Backlogging’.  		 			C S Sung 		,  		 			JT R 		.  	 	 		\textit{Comput. opns Res}  		1987. 14.  	 
\bibitem[Dongjuan ()]{b37}\label{b37} 	 		‘A Dynamic Scheduling Model Oriented to Flexible Production’.  		 			X Dongjuan 		.  	 	 		\textit{Ieee International Coriference on Educational and Network Technology}  		2010.  	 
\bibitem[Dongjuan ()]{b116}\label{b116} 	 		‘A Dynamic Scheduling Model Oriented to Flexible Production’.  		 			X Dongjuan 		.  	 	 		\textit{Ieee International Coriference on Educational and Network Technology}  		2010.  	 
\bibitem[Li and Chen ()]{b59}\label{b59} 	 		‘A Genetic Algorithm for Job-Shop Scheduling’.  		 			Y Li 		,  		 			Y Chen 		.  	 	 		\textit{Journal of Software}  		2010. 5.  	 
\bibitem[Li and Chen ()]{b138}\label{b138} 	 		‘A Genetic Algorithm For Job-Shop Scheduling’.  		 			Y Li 		,  		 			Y Chen 		.  	 	 		\textit{Journal of Software}  		2010. 5.  	 
\bibitem[Lamghari ()]{b10}\label{b10} 	 		‘A Hybrid Method Based on Linear Programming And Variable Neighborhood Descent for Scheduling Production in Open-Pit Mines’.  		 			Amina Lamghari 		,  		 			RD J A F 		.  	 	 		\textit{Journal of Global Optimization}  		2014. 63 p. .  	 
\bibitem[Lamghari ()]{b90}\label{b90} 	 		‘A Hybrid Method Based On Linear Programming and Variable Neighborhood Descent for Scheduling Production in Open-Pit Mines’.  		 			Amina Lamghari 		,  		 			RD J A F 		.  	 	 		\textit{Journal of Global Optimization}  		2014. 63 p. .  	 
\bibitem[Lu et al. ()]{b28}\label{b28} 	 		‘A Hybrid Multi-Objective Grey Wolf Optimizer for Dynamic Scheduling in a Real-World Welding Industry’.  		 			Chao Lu 		,  		 			LG 		,  		 			Xinyu Li 		,  		 			Shengqiang Xiao 		.  	 	 		\textit{Engineering Applications of Artificial Intelligence}  		2017b. 57 p. .  	 
\bibitem[Lu et al. ()]{b107}\label{b107} 	 		‘A Hybrid Multi-Objective Grey Wolf Optimizer for Dynamic Scheduling in a Real-World Welding Industry’.  		 			Chao Lu 		,  		 			LG 		,  		 			Xinyu Li 		,  		 			Shengqiang Xiao 		.  	 	 		\textit{Engineering Applications of Artificial Intelligence}  		2017b. 57 p. .  	 
\bibitem[Wong and Chung ()]{b26}\label{b26} 	 		‘A Joint Production Scheduling Approach Considering Multiple Resources and Preventive Maintenance Tasks’.  		 			C S Wong 		,  		 			FT S C 		,  		 			S H Chung 		.  	 	 		\textit{International Journal of Production Research}  		2013. 51 p. .  	 
\bibitem[Wong and Chung ()]{b105}\label{b105} 	 		‘A Joint Production Scheduling Approach Considering Multiple Resources And Preventive Maintenance Tasks’.  		 			C S Wong 		,  		 			FT S C 		,  		 			S H Chung 		.  	 	 		\textit{International Journal of Production Research}  		2013. 51 p. .  	 
\bibitem[Delgoshaei ()]{b5}\label{b5} 	 		‘A Multi-Period Scheduling of Dynamic Cellular Manufacturing Systems in the Presence of Cost Uncertainty’.  		 			Aidin Delgoshaei 		,  		 			AA 		.  	 	 		\textit{Computers \& Industrial Engineering}  		2016. 100 p. .  	 	 (Mohd Khairol Anuar Ariffin, Chandima Gomes) 
\bibitem[Delgoshaei ()]{b85}\label{b85} 	 		‘A Multi-Period Scheduling of Dynamic Cellular Manufacturing Systems in the Presence of Cost Uncertainty’.  		 			Aidin Delgoshaei 		,  		 			AA 		.  	 	 		\textit{Computers \& Industrial Engineering}  		2016. 100 p. .  	 	 (Mohd Khairol Anuar Ariffin, Chandima Gomes) 
\bibitem[Eguchi and Hirai (ed.) ()]{b72}\label{b72} 	 		\textit{A Neural Network Approach To Dynamic},  		 			T Eguchi 		,  		 			FO 		,  		 			T Hirai 		.  		Job Shop Scheduling. K. Mertins Et Al. (ed.)  		1999. Global Production Management.  	 
\bibitem[Eguchi and Hirai (ed.) ()]{b151}\label{b151} 	 		\textit{A Neural Network Approach To Dynamic},  		 			T Eguchi 		,  		 			FO 		,  		 			T Hirai 		.  		Job Shop Scheduling. K. Mertins Et Al. (ed.)  		1999. Global Production Management.  	 
\bibitem[Tang and Li ()]{b62}\label{b62} 	 		‘A Neural Network Model And Algorithm for the Hybrid Flow Shop Scheduling Problem in a Dynamic Environment’.  		 			Lixin Tang 		,  		 			WL 		,  		 			J I Y I N Li 		,  		 			U 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2005. 2005. 16 p. .  	 
\bibitem[Tang and Li ()]{b141}\label{b141} 	 		‘A Neural Network Model and Algorithm for The Hybrid Flow Shop Scheduling Problem in a Dynamic Environment’.  		 			Lixin Tang 		,  		 			WL 		,  		 			J I Y I N Li 		,  		 			U 		.  	 	 		\textit{Journal Of Intelligent Manufacturing}  		2005. 2005. 16 p. .  	 
\bibitem[Ihsan Sabuncuoglu ()]{b47}\label{b47} 	 		‘A Neural Network Model For Scheduling Problems’.  		 			B G Ihsan Sabuncuoglu 		.  	 	 		\textit{European Journal of Operational Research}  		1996. 93 p. 12.  	 
\bibitem[Ihsan Sabuncuoglu ()]{b126}\label{b126} 	 		‘A Neural Network Model for Scheduling Problems’.  		 			B G Ihsan Sabuncuoglu 		.  	 	 		\textit{European Journal of Operational Research}  		1996. 93 p. 12.  	 
\bibitem[Seker and Botsali ()]{b8}\label{b8} 	 		‘A Neuro-Fuzzy Model for A New Hybrid Integrated Process Planning and Scheduling System’.  		 			Alper Seker 		,  		 			SE 		,  		 			Reha Botsali 		.  	 	 		\textit{Expert Systems with Applications}  		2013. 40 p. .  	 
\bibitem[Seker and Botsali ()]{b88}\label{b88} 	 		‘A Neuro-Fuzzy Model for A New Hybrid Integrated Process Planning and Scheduling System’.  		 			Alper Seker 		,  		 			SE 		,  		 			Reha Botsali 		.  	 	 		\textit{Expert Systems with Applications}  		2013. 40 p. .  	 
\bibitem[Zhao et al. ()]{b30}\label{b30} 	 		\textit{A Note on the Time Complexity of Machine Scheduling with Dejong's Learning Effect},  		 			Chuanli Zhao 		,  		 			FJ 		,  		 			T C E Cheng 		,  		 			Min Ji 		.  		2017.  	 
\bibitem[Zhao et al. ()]{b109}\label{b109} 	 		\textit{A Note on the Time Complexity Of Machine Scheduling with Dejong's Learning Effect},  		 			Chuanli Zhao 		,  		 			FJ 		,  		 			T C E Cheng 		,  		 			Min Ji 		.  		2017.  	 
\bibitem[Byung Jun Joo ()]{b24}\label{b24} 	 		‘A Production Scheduling Problem with Uncertain Sequence-Dependent Set-Up Times and Random Yield’.  		 			P X Byung Jun Joo 		.  	 	 		\textit{International Journal of Production Research}  		2015. 53 p. .  	 
\bibitem[Byung Jun Joo ()]{b103}\label{b103} 	 		‘A Production Scheduling Problem with Uncertain Sequence-Dependent Set-Up Times and Random Yield’.  		 			P X Byung Jun Joo 		.  	 	 		\textit{International Journal of Production Research}  		2015. 53 p. .  	 
\bibitem[Banu Çali? ()]{b19}\label{b19} 	 		‘A Research Survey: Review of Ai Solution Strategies of Job Shop Scheduling Problem’.  		 			S B Banu Çali? 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2013. 26 p. .  	 
\bibitem[Banu Çali? ()]{b99}\label{b99} 	 		‘A Research Survey: Review of Ai Solution Strategies of Job Shop Scheduling Problem’.  		 			S B Banu Çali? 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2013. 26 p. .  	 
\bibitem[Kumar et al. ()]{b136}\label{b136} 	 		\textit{A Review on Artificial Neural Network Approach in Manufacturing Systems},  		 			V S Kumar 		,  		 			O J Soni 		,  		 			G Kumar 		,  		 			R 		.  		 \url{Https://Www.Researchgate.Net/Publication/273695480}  		2014.  	 
\bibitem[Ouelhadj ()]{b36}\label{b36} 	 		‘A Survey of Dynamic Scheduling In Manufacturing Systems’.  		 			Djamila Ouelhadj 		,  		 			SP 		.  	 	 		\textit{Journal of Scheduling}  		2008. 12 p. .  	 
\bibitem[Ouelhadj ()]{b115}\label{b115} 	 		‘A Survey of Dynamic Scheduling In Manufacturing Systems’.  		 			Djamila Ouelhadj 		,  		 			SP 		.  	 	 		\textit{Journal of Scheduling}  		2008. 12 p. .  	 
\bibitem[Behnamian ()]{b48}\label{b48} 	 		‘A Survey of Multi-Factory Scheduling’.  		 			J Behnamian 		,  		 			SM T F G 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2014. 27 p. .  	 
\bibitem[Behnamian ()]{b127}\label{b127} 	 		‘A Survey of Multi-Factory Scheduling’.  		 			J Behnamian 		,  		 			SM T F G 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2014. 27 p. .  	 
\bibitem[Santos et al. ()]{b1}\label{b1} 	 		\textit{Alternative Approaches Analysis for Scheduling in an Extended Manufacturing Environment},  		 			A S Santos 		,  		 			ML R V 		,  		 			G D A M Putnik 		,  		 			Madureira 		.  		2014. Ieee.  	 
\bibitem[Santos et al. ()]{b81}\label{b81} 	 		\textit{Alternative Approaches Analysis for Scheduling in an Extended Manufacturing Environment},  		 			A S Santos 		,  		 			ML R V 		,  		 			G D A M Putnik 		,  		 			Madureira 		.  		2014. Ieee.  	 
\bibitem[Shahrizal Muhamad ()]{b4}\label{b4} 	 		‘An Artificial Immune System for Solving Production Scheduling Problems: A Review’.  		 			Ahmad Shahrizal Muhamad 		,  		 			SD 		.  	 	 		\textit{Artificial Intelligence Review}  		2011. 39 p. .  	 
\bibitem[Shahrizal Muhamad ()]{b84}\label{b84} 	 		‘An Artificial Immune System for Solving Production Scheduling Problems: A Review’.  		 			Ahmad Shahrizal Muhamad 		,  		 			SD 		.  	 	 		\textit{Artificial Intelligence Review}  		2011. 39 p. .  	 
\bibitem[Arezoo Atighehchian ()]{b16}\label{b16} 	 		‘An Environment-Driven, Function-Based Approach to Dynamic Single-Machine Scheduling’.  		 			M M S Arezoo Atighehchian 		.  	 	 		\textit{European J. Industrial Engineering}  		2013. 7 p. 19.  	 
\bibitem[Arezoo Atighehchian ()]{b96}\label{b96} 	 		‘An Environment-Driven, Function-Based Approach to Dynamic Single-Machine Scheduling’.  		 			M M S Arezoo Atighehchian 		.  	 	 		\textit{European J. Industrial Engineering}  		2013. 7 p. 19.  	 
\bibitem[Sahana et al. ()]{b70}\label{b70} 	 		‘Ant Colony Optimization for Train Scheduling: an Analysis’.  		 			S K Sahana 		,  		 			A Jain 		,  		 			P K Mahanti 		.  	 	 		\textit{International Journal of Intelligent Systems and Applications}  		2014. 6 p. .  	 
\bibitem[Sahana et al. ()]{b149}\label{b149} 	 		‘Ant Colony Optimization for Train Scheduling: an Analysis’.  		 			S K Sahana 		,  		 			A Jain 		,  		 			P K Mahanti 		.  	 	 		\textit{International Journal of Intelligent Systems and Applications}  		2014. 6 p. .  	 
\bibitem[Hecker et al. ()]{b41}\label{b41} 	 		‘Application of A Modified Ga, Aco and a Random Search Procedure to Solve the Production Scheduling of A Case Study Bakery’.  		 			Florian T Hecker 		,  		 			MS 		,  		 			Thomas Becker 		,  		 			Bernd Hitzmann 		.  	 	 		\textit{Expert Systems with Applications}  		2014. 41 p. .  	 
\bibitem[Hecker et al. ()]{b120}\label{b120} 	 		‘Application of A Modified Ga, Aco And A Random Search Procedure to Solve the Production Scheduling of a Case Study Bakery’.  		 			Florian T Hecker 		,  		 			MS 		,  		 			Thomas Becker 		,  		 			Bernd Hitzmann 		.  	 	 		\textit{Expert Systems With Applications}  		2014. 41 p. .  	 
\bibitem[Jurgen Branke et al. ()]{b52}\label{b52} 	 		‘Automated Design of Production Scheduling Heuristics: A Review’.  		 			S N Jurgen Branke 		,  		 			Christoph Pickardt 		,  		 			Mengjie Zhang 		.  	 	 		\textit{Ieee Transactions on Evolutionary Computation}  		2016. 20 p. .  	 
\bibitem[Jurgenbranke et al. ()]{b53}\label{b53} 	 		‘Automated Design of Production Scheduling Heuristics: A Review’.  		 			S N Jurgenbranke 		,  		 			Christoph Pickardt 		,  		 			Mengjie Zhang 		.  	 	 		\textit{Ieee Transactions on Evolutionary Computation}  		2016. 20 p. .  	 
\bibitem[Jurgen Branke et al. ()]{b131}\label{b131} 	 		‘Automated Design of Production Scheduling Heuristics: A Review’.  		 			S N Jurgen Branke 		,  		 			Christoph Pickardt 		,  		 			Mengjie Zhang 		.  	 	 		\textit{Ieee Transactions on Evolutionary Computation}  		2016. 20 p. .  	 
\bibitem[Jurgenbranke et al. ()]{b132}\label{b132} 	 		‘Automated Design of Production Scheduling Heuristics: A Review’.  		 			S N Jurgenbranke 		,  		 			Christoph Pickardt 		,  		 			Mengjie Zhang 		.  	 	 		\textit{Ieee Transactions on Evolutionary Computation}  		2016. 20 p. .  	 
\bibitem[Kaban et al. ()]{b54}\label{b54} 	 		‘Comparison of Dispatching Rules in Job-Shop Scheduling Problem using Simulation: A Case Study’.  		 			A K Kaban 		,  		 			Z Othman 		,  		 			D S Rohmah 		.  	 	 		\textit{Int J Simul Model}  		2012. 2012. p. 12.  	 
\bibitem[Kaban et al. ()]{b133}\label{b133} 	 		‘Comparison of Dispatching Rules in Job-Shop Scheduling Problem using Simulation: a Case Study’.  		 			A K Kaban 		,  		 			Z Othman 		,  		 			D S Rohmah 		.  	 	 		\textit{Int J Simul Model}  		2012. 2012. p. 12.  	 
\bibitem[Elkhyari and Narendra Jussien ()]{b2}\label{b2} 	 		\textit{Constraint Programming for Dynamic Scheduling Problems},  		 			Abdallah Elkhyari 		,  		 			C G Narendra Jussien 		.  		 \url{Http://Www.Emn.Fr/Jussien/Publications}  		2003.  	 
\bibitem[Elkhyari and Narendra Jussien ()]{b82}\label{b82} 	 		\textit{Constraint Programming for Dynamic Scheduling Problems},  		 			Abdallah Elkhyari 		,  		 			C G Narendra Jussien 		.  		 \url{Http://Www.Emn.Fr/Jussien/Publications}  		2003.  	 
\bibitem[Maschiettoa et al. ()]{b42}\label{b42} 	 		‘Crane Scheduling Problem With Non-Interference Constraints in A Steel Coil Distribution Center’.  		 			Gabriela N Maschiettoa 		,  		 			Y O Martin 		,  		 			G Ravetti 		,  		 			Mauricio C De Souza 		.  	 	 		\textit{International Journal of Production Research}  		2016.  	 
\bibitem[Maschiettoa et al. ()]{b121}\label{b121} 	 		‘Crane Scheduling Problem With Non-Interference Constraints in a Steel Coil Distribution Center’.  		 			Gabriela N Maschiettoa 		,  		 			Y O Martin 		,  		 			G Ravetti 		,  		 			Mauricio C De Souza 		.  	 	 		\textit{International Journal Of Production Research}  		2016.  	 
\bibitem[Heger et al. ()]{b44}\label{b44} 	 		‘Dynamic Adjustment of Dispatching Rule Parameters in flow Shops With Sequence Dependent Setup Times’.  		 			J Heger 		,  		 			Branke 		,  		 			Jurgen 		,  		 			Hildebrandt 		,  		 			Torsten 		,  		 			Bernd Scholz-Reiter 		.  	 	 		\textit{International Journal of Production Research}  		2016.  	 
\bibitem[Heger et al. ()]{b123}\label{b123} 	 		‘Dynamic Adjustment of Dispatching Rule Parameters in flow Shops with Sequence Dependent Setup Times’.  		 			J Heger 		,  		 			Branke 		,  		 			Jurgen 		,  		 			Hildebrandt 		,  		 			Torsten 		,  		 			Bernd Scholz-Reiter 		.  	 	 		\textit{International Journal of Production Research}  		2016.  	 
\bibitem[Barták ()]{b20}\label{b20} 	 		\textit{Dynamic Constraint Models for Planning And Scheduling Problems},  		 			R Barták 		.  		1999. Grant Agency.  	 
\bibitem[Li and Xiao ()]{b38}\label{b38} 	 		‘Dynamic Parts Scheduling in Multiple Job Shop Cells Considering Intercell Moves And Flexible Routes’.  		 			Dongni Li 		,  		 			YW 		,  		 			Guangxue Xiao 		.  	 	 		\textit{Computers \& Operations Research}  		2013. 40 p. .  	 	 (Jiafu Tang) 
\bibitem[Li and Xiao ()]{b117}\label{b117} 	 		‘Dynamic Parts Scheduling in Multiple Job Shop Cells Considering Intercell Moves and Flexible Routes’.  		 			Dongni Li 		,  		 			YW 		,  		 			Guangxue Xiao 		.  	 	 		\textit{Computers \& Operations Research}  		2013. 40 p. .  	 	 (Jiafu Tang) 
\bibitem[Zhang et al. ()]{b61}\label{b61} 	 		‘Dynamic Rescheduling in Fms that is Simultaneously Considering Energy Consumption and Schedule Efficiency’.  		 			Liping Zhang 		,  		 			X L Liang Gao 		,  		 			Guohui Zhang 		.  	 	 		\textit{The International Journal of Advanced Manufacturing Technology}  		2013. 87 p. .  	 
\bibitem[Zhang et al. ()]{b140}\label{b140} 	 		‘Dynamic Rescheduling in Fms that is Simultaneously Considering Energy Consumption And Schedule Efficiency. the’.  		 			Liping Zhang 		,  		 			X L Liang Gao 		,  		 			Guohui Zhang 		.  	 	 		\textit{International Journal of Advanced Manufacturing Technology}  		2013. 87 p. .  	 
\bibitem[Tarun Kanti Jana et al. ()]{b73}\label{b73} 	 		‘Dynamic Schedule Execution in an Agent Based Holonic Manufacturing System’.  		 			B B Tarun Kanti Jana 		,  		 			Soumen Paul 		,  		 			Bijan Sarkar 		,  		 			Jyotirmoy Saha 		.  	 	 		\textit{Journal of Manufacturing Systems}  		2013. 32 p. .  	 
\bibitem[Tarun Kanti Jana et al. ()]{b74}\label{b74} 	 		‘Dynamic Schedule Execution in an Agent based Holonic Manufacturing System’.  		 			B B Tarun Kanti Jana 		,  		 			Soumen Paul 		,  		 			Bijan Sarkar 		,  		 			Jyotirmoy Saha 		.  	 	 		\textit{Journal of Manufacturing Systems}  		2013. 32 p. .  	 
\bibitem[Tarun Kanti Jana et al. ()]{b152}\label{b152} 	 		‘Dynamic Schedule Execution In an Agent Based Holonic Manufacturing System’.  		 			B B Tarun Kanti Jana 		,  		 			Soumen Paul 		,  		 			Bijan Sarkar 		,  		 			Jyotirmoy Saha 		.  	 	 		\textit{Journal of Manufacturing Systems}  		2013. 32 p. .  	 
\bibitem[Tarun Kanti Jana et al. ()]{b153}\label{b153} 	 		‘Dynamic Schedule Execution in an Agent Based Holonic Manufacturing System’.  		 			B B Tarun Kanti Jana 		,  		 			Soumen Paul 		,  		 			Bijan Sarkar 		,  		 			Jyotirmoy Saha 		.  	 	 		\textit{Journal of Manufacturing Systems}  		2013. 32 p. .  	 
\bibitem[Zaki Ahmad Khan and Mahfooz ()]{b78}\label{b78} 	 		‘Dynamic Scheduling Algorithm for Variants of Hypercube Interconnection Networks’.  		 			J S Zaki Ahmad Khan 		,  		 			Alam Mahfooz 		.  	 	 		\textit{Indian Journal of Science and Technology}  		2017. 10 p. .  	 
\bibitem[Zaki Ahmad Khan and Mahfooz ()]{b157}\label{b157} 	 		‘Dynamic Scheduling Algorithm for Variants Of Hypercube Interconnection Networks’.  		 			J S Zaki Ahmad Khan 		,  		 			Alam Mahfooz 		.  	 	 		\textit{Indian Journal of Science and Technology}  		2017. 10 p. .  	 
\bibitem[Leng ()]{b49}\label{b49} 	 		‘Dynamic Scheduling in Rfid-Driven Discrete Manufacturing System by using Multi-Layer Network Metrics As Heuristic Information’.  		 			Jiewu Leng 		,  		 			PJ 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2017.  	 
\bibitem[Leng ()]{b128}\label{b128} 	 		‘Dynamic Scheduling in Rfid-Driven Discrete Manufacturing System by using Multi-Layer Network Metrics As Heuristic Information’.  		 			Jiewu Leng 		,  		 			PJ 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2017.  	 
\bibitem[Zhai et al. ()]{b77}\label{b77} 	 		‘Dynamic Scheduling of a Flow Shop With On-Site Wind Generation for Energy Cost Reduction Under Real Time Electricity Pricing’.  		 			Yuxin Zhai 		,  		 			KB 		,  		 			Fu Zhao 		,  		 			John W Sutherland 		.  	 	 		\textit{Cirp Annals -Manufacturing Technology}  		2017. 66 p. .  	 
\bibitem[Zhai et al. ()]{b156}\label{b156} 	 		‘Dynamic Scheduling of A flow Shop with on-Site Wind Generation for Energy Cost Reduction under Real Time Electricity Pricing’.  		 			Yuxin Zhai 		,  		 			KB 		,  		 			Fu Zhao 		,  		 			John W Sutherland 		.  	 	 		\textit{Cirp Annals -Manufacturing Technology}  		2017. 66 p. .  	 
\bibitem[Tubilla ()]{b75}\label{b75} 	 		\textit{Dynamic Scheduling of Manufacturing Systems with Setups And Random Disruptions},  		 			F Tubilla 		.  		2011.  		 			Massachusetts Institute of Technology 		 	 	 (Phd Thesis) 
\bibitem[Tubilla ()]{b154}\label{b154} 	 		\textit{Dynamic Scheduling of Manufacturing Systems With Setups And Random Disruptions},  		 			F Tubilla 		.  		2011.  		 			Massachusetts Institute of Technology 		 	 	 (Phd Thesis) 
\bibitem[Barták ()]{b100}\label{b100} 	 		‘Dynamic Scheduling of Photolithography Process Based on Kohonen Neural Network’.  		 			R Barták 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		Bing-Hai Zhou, X. L., Richard. Y. K.Fung (ed.)  		1999. 2013. 101 p. .  	 	 (Grant Agency) 
\bibitem[Zhou et al. ()]{b21}\label{b21} 	 		‘Dynamic Scheduling Of Photolithography Process Based on Kohonen Neural Network’.  		 			Bing-Hai Zhou 		,  		 			X L Y K Richard 		,  		 			Fung 		.  	 	 		\textit{Journal of Intelligent Manufacturing}  		2013. 26 p. .  	 
\bibitem[Feldmann et al. ()]{b15}\label{b15} 	 		‘Dynamic Scheduling on Parallel Machines’.  		 			Anja Feldmann 		,  		 			J S Shang-Hua 		,  		 			Teng 		.  	 	 		\textit{Theoretical Computer Science}  		1994. 130 p. 24.  	 
\bibitem[Feldmann et al. ()]{b95}\label{b95} 	 		‘Dynamic Scheduling on Parallel Machines’.  		 			Anja Feldmann 		,  		 			J S Shang-Hua 		,  		 			Teng 		.  	 	 		\textit{Theoretical Computer Science}  		1994. 130 p. 24.  	 
\bibitem[Wen and Chen ()]{b76}\label{b76} 	 		\textit{Dynamic Scheduling Optimization for Instance Aspect Handling In Workflows},  		 			Yiping Wen 		,  		 			JL 		,  		 			Zhigang Chen 		.  		2014.  	 	 (Buqing Cao) 
\bibitem[Wen and Chen ()]{b155}\label{b155} 	 		\textit{Dynamic Scheduling Optimization for Instance Aspect Handling In Workflows},  		 			Yiping Wen 		,  		 			JL 		,  		 			Zhigang Chen 		.  		2014.  	 	 (Buqing Cao) 
\bibitem[Rossi and Lanzetta ()]{b13}\label{b13} 	 		‘Dynamic Set-Up Rules for Hybrid flow Shop Scheduling With Parallel Batching Machines’.  		 			Andrea Rossi 		,  		 			AP 		,  		 			Michele Lanzetta 		.  	 	 		\textit{International Journal of Production Research}  		2013. 52 p. .  	 
\bibitem[Rossi and Lanzetta ()]{b93}\label{b93} 	 		‘Dynamic Set-Up Rules for Hybrid Flow Shop Scheduling with Parallel Batching Machines’.  		 			Andrea Rossi 		,  		 			AP 		,  		 			Michele Lanzetta 		.  	 	 		\textit{International Journal of Production Research}  		2013. 52 p. .  	 
\bibitem[Binodini Tripathy and Sasmita Kumari Padhy ()]{b22}\label{b22} 	 		‘Dynamic Task Scheduling using A Directed Neural Network’.  		 			S D Binodini Tripathy 		,  		 			Sasmita Kumari Padhy 		.  	 	 		\textit{Journal of Parallel And Distributed Computing}  		2015. 75 p. .  	 
\bibitem[Binodini Tripathy and Sasmita Kumari Padhy ()]{b101}\label{b101} 	 		‘Dynamic Task Scheduling using a Directed Neural Network’.  		 			S D Binodini Tripathy 		,  		 			Sasmita Kumari Padhy 		.  	 	 		\textit{Journal of Parallel and Distributed Computing}  		2015. 75 p. .  	 
\bibitem[Lu et al. ()]{b27}\label{b27} 	 		‘Energy-Efficient Permutation flow Shop Scheduling Problem using a Hybrid Multi-Objective Backtracking Search Algorithm’.  		 			Chao Lu 		,  		 			LG 		,  		 			Xinyu Li 		,  		 			Quanke Pan 		,  		 			Qi Wang 		.  	 	 		\textit{Journal of Cleaner Production}  		2017a. 144 p. .  	 
\bibitem[Lu et al. ()]{b106}\label{b106} 	 		‘Energy-Efficient Permutation flow Shop Scheduling Problem using A Hybrid Multi-Objective Backtracking Search Algorithm’.  		 			Chao Lu 		,  		 			LG 		,  		 			Xinyu Li 		,  		 			Quanke Pan 		,  		 			Qi Wang 		.  	 	 		\textit{Journal Of Cleaner Production}  		2017a. 144 p. .  	 
\bibitem[Hamzadayi ()]{b7}\label{b7} 	 		‘Event Driven Strategy Based Complete Rescheduling Approaches for Dynamic M Identical Parallel Machines Scheduling Problem with a Common Server’.  		 			Alper Hamzadayi 		,  		 			GY 		.  	 	 		\textit{Computers \& Industrial Engineering}  		2016. 91 p. .  	 
\bibitem[Hamzadayi ()]{b87}\label{b87} 	 		‘Event Driven Strategy Based Complete Rescheduling Approaches for Dynamic M Identical Parallel Machines Scheduling Problem with a Common Server’.  		 			Alper Hamzadayi 		,  		 			GY 		.  	 	 		\textit{Computers \& Industrial Engineering}  		2016. 91 p. .  	 
\bibitem[Pickardt et al. ()]{b29}\label{b29} 	 		‘Evolutionary Generation of Dispatching Rule Sets For Complex Dynamic Scheduling Problems’.  		 			Christoph W Pickardt 		,  		 			TH 		,  		 			Jurgen Branke 		,  		 			Jens Heger 		,  		 			Bernd Scholz-Reiter 		.  	 	 		\textit{International Journal of Production Economics}  		2013. 145 p. .  	 
\bibitem[Pickardt et al. ()]{b108}\label{b108} 	 		‘Evolutionary Generation of Dispatching Rule Sets for Complex Dynamic Scheduling Problems’.  		 			Christoph W Pickardt 		,  		 			TH 		,  		 			Jurgen Branke 		,  		 			Jens Heger 		,  		 			Bernd Scholz-Reiter 		.  	 	 		\textit{International Journal of Production Economics}  		2013. 145 p. .  	 
\bibitem[Wang et al. ()]{b58}\label{b58} 	 		\textit{Flexible Job Shop Scheduling Problem using an Improved Ant Colony Optimization},  		 			Lei Wang 		,  		 			JC 		,  		 			Ming Li 		,  		 			Zhihu Liu 		.  		2017. 2017 p. .  	 
\bibitem[Wang et al. ()]{b137}\label{b137} 	 		\textit{Flexible Job Shop Scheduling Problem using an Improved Ant Colony Optimization},  		 			Lei Wang 		,  		 			JC 		,  		 			Ming Li 		,  		 			Zhihu Liu 		.  		2017. 2017 p. .  	 
\bibitem[María González-Neira and Barrera ()]{b40}\label{b40} 	 		‘Flow-Shop Scheduling Problem under Uncertainties: Review and Trends’.  		 			Eliana María González-Neira 		,  		 			AR 		,  		 			M.-T 		,  		 			David Barrera 		.  	 	 		\textit{International Journal of Industrial Engineering Computations}  		2017. p. .  	 
\bibitem[María González-Neira and Barrera ()]{b119}\label{b119} 	 		‘flow-Shop Scheduling Problem under Uncertainties: Review and Trends’.  		 			Eliana María González-Neira 		,  		 			AR 		,  		 			M.-T 		,  		 			David Barrera 		.  	 	 		\textit{International Journal of Industrial Engineering Computations}  		2017. p. .  	 
\bibitem[Omara and Arafa ()]{b65}\label{b65} 	 		‘Genetic Algorithms for Task Scheduling Problem’.  		 			F A Omara 		,  		 			M M Arafa 		.  	 	 		\textit{Journal of Parallel and Distributed Computing}  		2010. 70 p. .  	 
\bibitem[Omara and Arafa ()]{b144}\label{b144} 	 		‘Genetic Algorithms for Task Scheduling Problem’.  		 			F A Omara 		,  		 			M M Arafa 		.  	 	 		\textit{Journal of Parallel and Distributed Computing}  		2010. 70 p. .  	 
\bibitem[Herrmann ()]{b45}\label{b45} 	 		\textit{Handbook of Production Scheduling University of Maryland},  		 			J W Herrmann 		.  		2006. College Park, Sprineger.  	 
\bibitem[Herrmann ()]{b124}\label{b124} 	 		\textit{Handbook of Production Scheduling University of Maryland},  		 			J W Herrmann 		.  		2006. College Park, Sprineger.  	 
\bibitem[Joseph et al. ()]{b50}\label{b50} 	 		‘Handbook of Scheduling. Scheduling Real-Time Tasks’.  		 			Y-T Joseph 		,  		 			Leung"sanjoy 		,  		 			J G Baruah 		.  	 	 		\textit{Algorithms And Complexity}  		2004. Crc Press Llc.  	 
\bibitem[Joseph et al. ()]{b129}\label{b129} 	 		‘Handbook of Scheduling. Scheduling Real-Time Tasks’.  		 			Y-T Joseph 		,  		 			Leung"sanjoy 		,  		 			J G Baruah 		.  	 	 		\textit{Algorithms and Complexity}  		2004. Crc Press Llc.  	 
\bibitem[Abedi ()]{b64}\label{b64} 	 		‘Hybrid Scheduling and Maintenance Problem using Artificial Neural Network Based Meta-Heuristics’.  		 			Mehdi Abedi 		,  		 			HS 		.  	 	 		\textit{Journal of Modelling in Management}  		2017. p. .  	 	 (Hamed Fazlollahtabar) 
\bibitem[Abedi ()]{b143}\label{b143} 	 		‘Hybrid Scheduling and Maintenance Problem Using Artificial Neural Network Based Meta-Heuristics’.  		 			Mehdi Abedi 		,  		 			HS 		.  	 	 		\textit{Journal of Modelling In Management}  		2017. p. .  	 	 (Hamed Fazlollahtabar) 
\bibitem[Terekhov and Tran ()]{b34}\label{b34} 	 		\textit{Integrating Scheduling And Queueing for Dynamic Scheduling Problems},  		 			Daria Terekhov 		,  		 			JC B 		,  		 			Tony T Tran 		.  		2010.  	 
\bibitem[Terekhov and Tran ()]{b113}\label{b113} 	 		\textit{Integrating Scheduling and Queueing for Dynamic Scheduling Problems},  		 			Daria Terekhov 		,  		 			JC B 		,  		 			Tony T Tran 		.  		2010.  	 
\bibitem[Kaminsky ()]{b56}\label{b56} 	 		 			P Kaminsky 		.  		\textit{Models and Algorithms for Integratedmulti-Stage Production/ Distribution Systems: Third Party Logistics. Nsf Design, Service, Andmanufacturing Grantees and Research Conference},  				 (St. Louis,Missouri Grant \#Dmi -0200439)  		2006.  	 
\bibitem[Kaminsky ()]{b135}\label{b135} 	 		 			P Kaminsky 		.  		\textit{Models and Algorithms for Integratedmulti -Stage Production/Distribution Systems: Third Party Logistics. Nsf Design, Service, Andmanufacturing Grantees and Research Conference},  				 (St. Louis,Missouri Grant \#Dmi -0200439)  		2006.  	 
\bibitem[Shahzad ()]{b17}\label{b17} 	 		‘Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees’.  		 			Atif Shahzad 		,  		 			NM 		.  	 	 		\textit{Tabu Search and Simulation. Computers}  		2016. 5 p. 3.  	 
\bibitem[Shahzad ()]{b97}\label{b97} 	 		‘Learning Dispatching Rules for Scheduling: a Synergistic View Comprising Decision Trees’.  		 			Atif Shahzad 		,  		 			NM 		.  	 	 		\textit{Tabu Search and Simulation. Computers}  		2016. 5 p. 3.  	 
\bibitem[Rakesh Kumar ()]{b69}\label{b69} 	 		‘Multi Agents Approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search Method’.  		 			M A Rakesh Kumar 		.  	 	 		\textit{The 20th World Multi-Conference on Systemics, Cybernetics And Informatics Wmsci},  				 (Haryana)  		2016.  	 
\bibitem[Rakesh Kumar ()]{b148}\label{b148} 	 		‘Multi Agents Approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search Method’.  		 			M A Rakesh Kumar 		.  	 	 		\textit{The 20th World Multi-Conference on Systemics, Cybernetics and Informatics Wmsci},  				 (Haryana)  		2016.  	 
\bibitem[Adibi ()]{b63}\label{b63} 	 		‘Multi-Objective Scheduling of Dynamic Job Shop using Variable Neighborhood Search’.  		 			M A Adibi 		,  		 			MZ 		,  		 			M 		.  	 	 		\textit{Expert Systems with Applications}  		Amiri 2010. 37 p. .  	 
\bibitem[Adibi ()]{b142}\label{b142} 	 		‘Multi-Objective Scheduling of Dynamic Job Shop using Variable Neighborhood Search’.  		 			M A Adibi 		,  		 			MZ 		,  		 			M 		.  	 	 		\textit{Expert Systems with Applications}  		Amiri 2010. 37 p. .  	 
\bibitem[Madureira et al. ()]{b0}\label{b0} 	 		‘Negotiation Mechanism for Self-Organized Scheduling System with Collective Intelligence’.  		 			A Madureira 		,  		 			IP 		,  		 			P Pereira 		,  		 			A Abraham 		.  	 	 		\textit{Neurocomputing}  		2014. 132 p. .  	 
\bibitem[Madureira et al. ()]{b80}\label{b80} 	 		‘Negotiation Mechanism for Self-Organized Scheduling System with Collective Intelligence’.  		 			A Madureira 		,  		 			IP 		,  		 			P Pereira 		,  		 			A Abraham 		.  	 	 		\textit{Neurocomputing}  		2014. 132 p. .  	 
\bibitem[Pach et al. ()]{b33}\label{b33} 	 		‘Orca-Fms: A Dynamic Architecture for the Optimized and Reactive Control of Flexible Manufacturing Scheduling’.  		 			Cyrille Pach 		,  		 			TB 		,  		 			Therese Bonte 		,  		 			Damien Trentesaux 		.  	 	 		\textit{Computers in Industry}  		2014. 65 p. .  	 
\bibitem[Pach et al. ()]{b112}\label{b112} 	 		‘Orca-Fms: A Dynamic Architecture for the Optimized And Reactive Control of Flexible Manufacturing Scheduling’.  		 			Cyrille Pach 		,  		 			TB 		,  		 			Therese Bonte 		,  		 			Damien Trentesaux 		.  	 	 		\textit{Computers In Industry}  		2014. 65 p. .  	 
\bibitem[Kalinowski Krzysztof and Cezary ()]{b55}\label{b55} 	 		‘Predictive -Reactive Strategy for Real time Scheduling of Manufacturing Systems’.  		 			K D Kalinowski Krzysztof 		,  		 			Grabowik Cezary 		.  	 	 		\textit{Applied Mechanics and Materials}  		2013. 307 p. .  	 
\bibitem[Kalinowski Krzysztof and Cezary ()]{b134}\label{b134} 	 		‘Predictive -Reactive Strategy for Real Time Scheduling of Manufacturing Systems’.  		 			K D Kalinowski Krzysztof 		,  		 			Grabowik Cezary 		.  	 	 		\textit{Applied Mechanics and Materials}  		2013. 307 p. .  	 
\bibitem[Priore et al. ()]{b67}\label{b67} 	 		 			Paolo Priore 		,  		 			DD L F 		,  		 			Raúl Pino 		,  		 			Javier Puente 		.  		\textit{Dynamic Scheduling of Flexible Manufacturing Systems using Neural Networks and Inductive Learning},  				2001.  	 
\bibitem[Priore et al. ()]{b146}\label{b146} 	 		 			Paolo Priore 		,  		 			DD L F 		,  		 			Raúl Pino 		,  		 			Javier Puente 		.  		\textit{Dynamic Scheduling of Flexible Manufacturing Systems using Neural Networks and Inductive Learning},  				2001.  	 
\bibitem[Cataldo and Scattolini ()]{b11}\label{b11} 	 		‘Production Scheduling of Parallel Machines with Model Predictive Control’.  		 			Andrea Cataldo 		,  		 			AP 		,  		 			Riccardo Scattolini 		.  	 	 		\textit{Control Engineering Practice}  		2015. 42 p. .  	 
\bibitem[Cataldo and Scattolini ()]{b12}\label{b12} 	 		‘Production Scheduling of Parallel Machines with Model Predictive Control’.  		 			Andrea Cataldo 		,  		 			AP 		,  		 			Riccardo Scattolini 		.  	 	 		\textit{Control Engineering Practice}  		2015. 42 p. .  	 
\bibitem[Cataldo and Scattolini ()]{b91}\label{b91} 	 		‘Production Scheduling of Parallel Machines with Model Predictive Control’.  		 			Andrea Cataldo 		,  		 			AP 		,  		 			Riccardo Scattolini 		.  	 	 		\textit{Control Engineering Practice}  		2015. 42 p. .  	 
\bibitem[Cataldo and Scattolini ()]{b92}\label{b92} 	 		‘Production Scheduling of Parallel Machines with Model Predictive Control’.  		 			Andrea Cataldo 		,  		 			AP 		,  		 			Riccardo Scattolini 		.  	 	 		\textit{Control Engineering Practice}  		2015. 42 p. .  	 
\bibitem[Terekhova ()]{b35}\label{b35} 	 		\textit{Queueing-Theoretic Approaches for Dynamic Scheduling: A Survey},  		 			Daria Terekhova 		,  		 			DG D A J C B 		.  		2014.  	 
\bibitem[Terekhova ()]{b114}\label{b114} 	 		\textit{Queueing-Theoretic Approaches for Dynamic Scheduling: A Survey},  		 			Daria Terekhova 		,  		 			DG D A J C B 		.  		2014.  	 
\bibitem[Zhao and Xu ()]{b32}\label{b32} 	 		‘Real-Time Dynamic Hoist Scheduling for Multistage Material Handling Process Under Uncertainties’.  		 			Chuanyu Zhao 		,  		 			JF 		,  		 			Qiang Xu 		.  	 	 		\textit{Aiche Journal}  		2013. 59 p. .  	 
\bibitem[Zhao and Xu ()]{b111}\label{b111} 	 		‘Real-Time Dynamic Hoist Scheduling For Multistage Material Handling Process under Uncertainties’.  		 			Chuanyu Zhao 		,  		 			JF 		,  		 			Qiang Xu 		.  	 	 		\textit{Aiche Journal}  		2013. 59 p. .  	 
\bibitem[Priore et al. ()]{b68}\label{b68} 	 		‘Real-Time Scheduling of Flexible Manufacturing Systems using Support Vector Machines and Case-Based Reasoning’.  		 			Paolo Priore 		,  		 			RP 		,  		 			Jose Parreño 		,  		 			Javier Puente 		.  	 	 		\textit{Business And Management}  		2015. 3.  	 	 (Journal of Economics) 
\bibitem[Priore et al. ()]{b147}\label{b147} 	 		‘Real-Time Scheduling of Flexible Manufacturing Systems using Support Vector Machines And Case-Based Reasoning’.  		 			Paolo Priore 		,  		 			RP 		,  		 			Jose Parreño 		,  		 			Javier Puente 		.  	 	 		\textit{Business and Management}  		2015. 3.  	 	 (Journal of Economics) 
\bibitem[Li Yuqing and Xu Minqiang ()]{b60}\label{b60} 	 		‘Rescheduling of Observing Spacecraft using Fuzzy Neural Network and Ant Colony Algorithm’.  		 			W R Li Yuqing 		,  		 			Xu Minqiang 		.  	 	 		\textit{Chinese Journal of Aeronautics}  		2014. 27 p. .  	 
\bibitem[Li Yuqing and Xu Minqiang ()]{b139}\label{b139} 	 		‘Rescheduling of Observing Spacecraft using Fuzzy Neural Network and Ant Colony Algorithm’.  		 			W R Li Yuqing 		,  		 			Xu Minqiang 		.  	 	 		\textit{Chinese Journal of Aeronautics}  		2014. 27 p. .  	 
\bibitem[Sana Alyaseri ()]{b71}\label{b71} 	 		 			K R Sana Alyaseri 		,  		 			K.-M 		.  		 \url{Http://Www.Uum.Edu.My}  		\textit{Multi Objective Bee Colony Optimization Framework for Grid Job Scheduling. the 4th International Conference on Computing and Informatics},  				2013.  	 
\bibitem[Sana Alyaseri ()]{b150}\label{b150} 	 		 			K R Sana Alyaseri 		,  		 			K.-M 		.  		 \url{Http://Www.Uum.Edu.My}  		\textit{Multi Objective Bee Colony Optimization Framework for Grid Job Scheduling. the 4th International Conference on Computing and Informatics},  				2013.  	 
\bibitem[Gomes ()]{b43}\label{b43} 	 		\textit{Selection Constructive Based Hyper-Heuristic for Dynamic Scheduling},  		 			S R P Gomes 		.  		2014.  	 	 (Master Degree) 
\bibitem[Gomes ()]{b122}\label{b122} 	 		\textit{Selection Constructive Based Hyper-Heuristic for Dynamic Scheduling},  		 			S R P Gomes 		.  		2014.  	 	 (Master Degree) 
\bibitem[Pereira ()]{b46}\label{b46} 	 		\textit{Self-Optimization Module For Scheduling Using Case-Based Reasoning},  		 			I Pereira 		,  		 			AM 		.  		2013.  	 
\bibitem[Pereira ()]{b125}\label{b125} 	 		\textit{Self-Optimization Module for Scheduling using Case-Based Reasoning},  		 			I Pereira 		,  		 			AM 		.  		2013.  	 
\bibitem[Barbosa Da et al. ()]{b118}\label{b118} 	 		‘Simulation Study of Dispatching Rules in Stochastic Job Shop Dynamic Scheduling’.  		 			Edna Barbosa Da 		,  		 			M G C Silva 		,  		 			Marilda F´atima De Souza Da 		,  		 			Fabio Henrique Silva 		,  		 			Pereira 		.  	 	 		\textit{World Journal of Modelling and Simulation}  		2014. 10 p. 11.  	 
\bibitem[Baykaso?lu ()]{b3}\label{b3} 	 		‘Solving Comprehensive Dynamic Job Shop Scheduling Problem by using a Grasp-Based Approach’.  		 			Adil Baykaso?lu 		,  		 			FS K 		.  	 	 		\textit{International Journal of Production Research}  		2017. 55 p. .  	 
\bibitem[Baykaso?lu ()]{b83}\label{b83} 	 		‘Solving Comprehensive Dynamic Job Shop Scheduling Problem by using A Grasp-Based Approach’.  		 			Adil Baykaso?lu 		,  		 			FS K 		.  	 	 		\textit{International Journal of Production Research}  		2017. 55 p. .  	 
\bibitem[Ouelhadj ()]{b66}\label{b66} 	 		‘Survey of Dynamic Scheduling In Manufacturing Systems’.  		 			D Ouelhadj 		,  		 			PS 		.  	 	 		\textit{Journal of Scheduling}  		2009. p. 27.  	 
\bibitem[Ouelhadj ()]{b145}\label{b145} 	 		‘Survey of Dynamic Scheduling in Manufacturing Systems’.  		 			D Ouelhadj 		,  		 			PS 		.  	 	 		\textit{Journal of Scheduling}  		2009. p. 27.  	 
\bibitem[Balicki ()]{b18}\label{b18} 	 		‘Tabu Programming For Multiobjective Optimization Problems’.  		 			J Balicki 		.  	 	 		\textit{Ijcsns International Journal of Computer Science And Network Security}  		2007. 7.  	 
\bibitem[Balicki ()]{b98}\label{b98} 	 		‘Tabu Programming for Multiobjective Optimization Problems’.  		 			J Balicki 		.  	 	 		\textit{Ijcsns International Journal of Computer Science and Network Security}  		2007. 7.  	 
\bibitem[Kenny et al. ()]{b14}\label{b14} 	 		\textit{Towards Solving Large-Scale Precedence Constrained Production Scheduling Problems in Mining},  		 			Angus Kenny 		,  		 			XL 		,  		 			Andreas T Ernst 		,  		 			Dhananjay Thiruvady 		.  		2017. p. .  	 
\bibitem[Kenny et al. ()]{b94}\label{b94} 	 		\textit{Towards Solving Large-Scale Precedence Constrained Production Scheduling Problems in Mining},  		 			Angus Kenny 		,  		 			XL 		,  		 			Andreas T Ernst 		,  		 			Dhananjay Thiruvady 		.  		2017. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
