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. # a) Definition of dynamic scheduling problems 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. # b) Scheduling problem classifications Suppose that (m) machines ( ) m j M j ,..., 1 = have to process (n) jobs ( ) 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. 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). # c) Optimality criteria (objective functions) We denote the finishing time of job i J by i C , and the associated cost by ( ) i i C f . 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 ( )2 : i i i d C S ? = squared deviation i i i d ifC U ? = 0 : , 1 otherwise unit penalty. # 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 . 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 involving i i i S D E , , 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 . # Global Journal of Researches in Engineering ( ) Volume XVIII Issue V Version I 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 ? for all inputs x for the problem, i.e. if there is a k such that ( ) ( ) k x O x T ? (Jun Zhao, 2014). 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. 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 . 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 = }, # III. CURRENT DYNAMIC SCHEDULING APPROACHES 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. # a) Completely reactive scheduling 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). 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). # b) Robust pro-active scheduling 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). # c) Predictive-reactive scheduling 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. # e) Comparison of dynamic scheduling approaches 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. # Global # DYNAMIC SCHEDULING TECHNIQUES APPLIED t O MANUFACTURING SYSTEMS # a) Dispatching rules 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. # b) Heuristics techniques 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). # c) Meta-heuristics Techniques 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. 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). . # e) Artificial intelligence techniques 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). # f) Multi-agent-based dynamic scheduling 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 . # g) The model of network topology technique 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). # h) Constraint programming technique 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 . # i) Environment driven, function-based technique 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). # j) Comparison of dynamic scheduling techniques 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). 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. 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 ![we get four possible objectives ?=](image-2.png "iG") ![The most important bottleneck objective besides maxC is maximum lateness i L L max : max = . Other objective functions which are widely used are ?](image-3.png ".") 1![Figure 1: Completely reactive schedulingThere was another work proposed a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum make spanjob shop scheduling problem. The proposed network combines the characteristics of neural networks and algorithmic approaches (Ihsan Sabuncuoglu 1996).A scheduling approach that uses and compares inductive learning and neural networks was presented to improve the manufacturing system's performance (PAOLO PRIORE, 2001). A scheduling method based on variable neighborhood search (VNS) was proposed for dynamic job shop scheduling problem with random job arrivals and machine breakdowns (M. A.Adibi 2010).A multi-agent based approach is developed in another work to solve the part scheduling problem in](image-4.png "Figure 1 :") © 2018 Global Journals * Negotiation Mechanism for Self-Organized Scheduling System with Collective Intelligence AMadureira IP PPereira AAbraham Neurocomputing 132 2014 * Alternative Approaches Analysis for Scheduling in an Extended Manufacturing Environment ASSantos ML R V GD A MPutnik Madureira 2014 Ieee * Constraint Programming for Dynamic Scheduling Problems AbdallahElkhyari CGNarendra Jussien 2003 * Solving Comprehensive Dynamic Job Shop Scheduling Problem by using a Grasp-Based Approach AdilBaykaso?lu FS K International Journal of Production Research 55 2017 * An Artificial Immune System for Solving Production Scheduling Problems: A Review AhmadShahrizal Muhamad SD Artificial Intelligence Review 39 2011 * A Multi-Period Scheduling of Dynamic Cellular Manufacturing Systems in the Presence of Cost Uncertainty AidinDelgoshaei AA Computers & Industrial Engineering 100 2016 Mohd Khairol Anuar Ariffin, Chandima Gomes * A Dynamic Multi-Agent-Based Scheduling Approach for Smes AliVatankhah Barenji RV B DanialRoudi MajidHashemipour The International Journal of Advanced Manufacturing Technology 89 2016 * Event Driven Strategy Based Complete Rescheduling Approaches for Dynamic M Identical Parallel Machines Scheduling Problem with a Common Server AlperHamzadayi GY Computers & Industrial Engineering 91 2016 * A Neuro-Fuzzy Model for A New Hybrid Integrated Process Planning and Scheduling System AlperSeker SE RehaBotsali Expert Systems with Applications 40 2013 * TM HAmer Fahmya HeshamBassionic Pm World Journal 9 2014 * A Hybrid Method Based on Linear Programming And Variable Neighborhood Descent for Scheduling Production in Open-Pit Mines AminaLamghari RD J A F Journal of Global Optimization 63 2014 * Production Scheduling of Parallel Machines with Model Predictive Control AndreaCataldo AP RiccardoScattolini Control Engineering Practice 42 2015 * Production Scheduling of Parallel Machines with Model Predictive Control AndreaCataldo AP RiccardoScattolini Control Engineering Practice 42 2015 * Dynamic Set-Up Rules for Hybrid flow Shop Scheduling With Parallel Batching Machines AndreaRossi AP MicheleLanzetta International Journal of Production Research 52 2013 * Towards Solving Large-Scale Precedence Constrained Production Scheduling Problems in Mining AngusKenny XL AndreasTErnst DhananjayThiruvady 2017 * Dynamic Scheduling on Parallel Machines AnjaFeldmann JSShang-Hua Teng Theoretical Computer Science 130 24 1994 * An Environment-Driven, Function-Based Approach to Dynamic Single-Machine Scheduling MM SArezoo Atighehchian European J. Industrial Engineering 7 19 2013 * Learning Dispatching Rules for Scheduling: A Synergistic View Comprising Decision Trees AtifShahzad NM Tabu Search and Simulation. Computers 5 3 2016 * Tabu Programming For Multiobjective Optimization Problems JBalicki Ijcsns International Journal of Computer Science And Network Security 7 2007 * A Research Survey: Review of Ai Solution Strategies of Job Shop Scheduling Problem SBBanu Çali? Journal of Intelligent Manufacturing 26 2013 * Dynamic Constraint Models for Planning And Scheduling Problems RBarták 1999 Grant Agency * Dynamic Scheduling Of Photolithography Process Based on Kohonen Neural Network Bing-HaiZhou XL Y KRichard Fung Journal of Intelligent Manufacturing 26 2013 * Dynamic Task Scheduling using A Directed Neural Network SDBinodini Tripathy Sasmita Kumari Padhy Journal of Parallel And Distributed Computing 75 2015 * PBrucker 2007 Berlin Heidelberg Springer * A Production Scheduling Problem with Uncertain Sequence-Dependent Set-Up Times and Random Yield PXByung Jun Joo International Journal of Production Research 53 2015 * A Dynamic Production Scheduling Model With Lost-Sales or Backlogging CSSung JT R Comput. Opns Res 14 1987 * A Joint Production Scheduling Approach Considering Multiple Resources and Preventive Maintenance Tasks CSWong FT S C SHChung International Journal of Production Research 51 2013 * Energy-Efficient Permutation flow Shop Scheduling Problem using a Hybrid Multi-Objective Backtracking Search Algorithm ChaoLu LG XinyuLi QuankePan QiWang Journal of Cleaner Production 144 2017a * A Hybrid Multi-Objective Grey Wolf Optimizer for Dynamic Scheduling in a Real-World Welding Industry ChaoLu LG XinyuLi ShengqiangXiao Engineering Applications of Artificial Intelligence 57 2017b * Evolutionary Generation of Dispatching Rule Sets For Complex Dynamic Scheduling Problems ChristophWPickardt TH JurgenBranke JensHeger BerndScholz-Reiter International Journal of Production Economics 145 2013 * A Note on the Time Complexity of Machine Scheduling with Dejong's Learning Effect ChuanliZhao FJ TC ECheng MinJi 2017 * Computers & Industrial Engineering 112 * Real-Time Dynamic Hoist Scheduling for Multistage Material Handling Process Under Uncertainties ChuanyuZhao JF QiangXu Aiche Journal 59 2013 * Orca-Fms: A Dynamic Architecture for the Optimized and Reactive Control of Flexible Manufacturing Scheduling CyrillePach TB ThereseBonte DamienTrentesaux Computers in Industry 65 2014 * Integrating Scheduling And Queueing for Dynamic Scheduling Problems DariaTerekhov JC B TonyTTran 2010 * Queueing-Theoretic Approaches for Dynamic Scheduling: A Survey DariaTerekhova DG D A J C B 2014 * A Survey of Dynamic Scheduling In Manufacturing Systems DjamilaOuelhadj SP Journal of Scheduling 12 2008 * A Dynamic Scheduling Model Oriented to Flexible Production XDongjuan Ieee International Coriference on Educational and Network Technology 2010 * Dynamic Parts Scheduling in Multiple Job Shop Cells Considering Intercell Moves And Flexible Routes DongniLi YW GuangxueXiao Computers & Operations Research 40 2013 Jiafu Tang * EdnaBarbosa Da MG CSilva Marilda F´atima De Souza Da FabioHenriqueSilva Pereira Simulation Study of Dispatching Rules In Stochastic Job Shop Dynamic Scheduling. World Journal of Modelling and Simulation 10 11 2014 * Flow-Shop Scheduling Problem under Uncertainties: Review and Trends ElianaMaría González-Neira AR M.-T DavidBarrera International Journal of Industrial Engineering Computations 2017 * Application of A Modified Ga, Aco and a Random Search Procedure to Solve the Production Scheduling of A Case Study Bakery FlorianTHecker MS ThomasBecker BerndHitzmann Expert Systems with Applications 41 2014 * Crane Scheduling Problem With Non-Interference Constraints in A Steel Coil Distribution Center GabrielaNMaschiettoa YOMartin GRavetti MauricioC DeSouza International Journal of Production Research 2016 * Selection Constructive Based Hyper-Heuristic for Dynamic Scheduling SR PGomes 2014 Master Degree * Dynamic Adjustment of Dispatching Rule Parameters in flow Shops With Sequence Dependent Setup Times JHeger Branke Jurgen Hildebrandt Torsten BerndScholz-Reiter International Journal of Production Research 2016 * Handbook of Production Scheduling University of Maryland JWHerrmann 2006 College Park, Sprineger * Self-Optimization Module For Scheduling Using Case-Based Reasoning IPereira AM 2013 * A Neural Network Model For Scheduling Problems BGIhsan Sabuncuoglu European Journal of Operational Research 93 12 1996 * A Survey of Multi-Factory Scheduling JBehnamian SM T F G Journal of Intelligent Manufacturing 27 2014 * Dynamic Scheduling in Rfid-Driven Discrete Manufacturing System by using Multi-Layer Network Metrics As Heuristic Information JiewuLeng PJ Journal of Intelligent Manufacturing 2017 * Handbook of Scheduling. Scheduling Real-Time Tasks Y-TJoseph Leung"sanjoy JGBaruah Algorithms And Complexity 2004 Crc Press Llc * A Bayesian Networks Structure Learning and Reasoning-Based Byproduct Gas Scheduling in Steel Industry JunZhao WKan Sun YingLiu Ieee Transactions on Automation Science and Engineering 11 2014 * Automated Design of Production Scheduling Heuristics: A Review SNJurgen Branke ChristophPickardt MengjieZhang Ieee Transactions on Evolutionary Computation 20 2016 * Automated Design of Production Scheduling Heuristics: A Review SNJurgenbranke ChristophPickardt MengjieZhang Ieee Transactions on Evolutionary Computation 20 2016 * Comparison of Dispatching Rules in Job-Shop Scheduling Problem using Simulation: A Case Study AKKaban ZOthman DSRohmah Int J Simul Model 12 2012. 2012 * Predictive -Reactive Strategy for Real time Scheduling of Manufacturing Systems KDKalinowski Krzysztof GrabowikCezary Applied Mechanics and Materials 307 2013 * PKaminsky 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 * VSKumar OJSoni GKumar R a Review on Artificial Neural Network Approach in Manufacturing Systems 2014 * Flexible Job Shop Scheduling Problem using an Improved Ant Colony Optimization LeiWang JC MingLi ZhihuLiu 2017 2017 * A Genetic Algorithm for Job-Shop Scheduling YLi YChen Journal of Software 5 2010 * Rescheduling of Observing Spacecraft using Fuzzy Neural Network and Ant Colony Algorithm WRLi Yuqing Xu Minqiang Chinese Journal of Aeronautics 27 2014 * Dynamic Rescheduling in Fms that is Simultaneously Considering Energy Consumption and Schedule Efficiency LipingZhang XLLiang Gao GuohuiZhang The International Journal of Advanced Manufacturing Technology 87 2013 * A Neural Network Model And Algorithm for the Hybrid Flow Shop Scheduling Problem in a Dynamic Environment LixinTang WL J I Y I NLi U Journal of Intelligent Manufacturing 16 2005. 2005 * Multi-Objective Scheduling of Dynamic Job Shop using Variable Neighborhood Search MAAdibi MZ M Expert Systems with Applications 37 Amiri 2010 * Hybrid Scheduling and Maintenance Problem using Artificial Neural Network Based Meta-Heuristics MehdiAbedi HS Journal of Modelling in Management 2017 Hamed Fazlollahtabar * Genetic Algorithms for Task Scheduling Problem FAOmara MMArafa Journal of Parallel and Distributed Computing 70 2010 * Survey of Dynamic Scheduling In Manufacturing Systems DOuelhadj PS Journal of Scheduling 27 2009 * PaoloPriore DD L F RaúlPino JavierPuente Dynamic Scheduling of Flexible Manufacturing Systems using Neural Networks and Inductive Learning 2001 * Real-Time Scheduling of Flexible Manufacturing Systems using Support Vector Machines and Case-Based Reasoning PaoloPriore RP JoseParreño JavierPuente Business And Management 3 2015 Journal of Economics * Multi Agents Approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search Method MARakesh Kumar The 20th World Multi-Conference on Systemics, Cybernetics And Informatics Wmsci Haryana 2016 * Ant Colony Optimization for Train Scheduling: an Analysis SKSahana AJain PKMahanti International Journal of Intelligent Systems and Applications 6 2014 * KRSana Alyaseri K.-M Multi Objective Bee Colony Optimization Framework for Grid Job Scheduling. the 4th International Conference on Computing and Informatics 2013 * A Neural Network Approach To Dynamic TEguchi FO THirai Job Shop Scheduling. K. Mertins Et Al. 1999 Global Production Management * Dynamic Schedule Execution in an Agent Based Holonic Manufacturing System BBTarun Kanti Jana SoumenPaul BijanSarkar JyotirmoySaha Journal of Manufacturing Systems 32 2013 * Dynamic Schedule Execution in an Agent based Holonic Manufacturing System BBTarun Kanti Jana SoumenPaul BijanSarkar JyotirmoySaha Journal of Manufacturing Systems 32 2013 * Dynamic Scheduling of Manufacturing Systems with Setups And Random Disruptions FTubilla 2011 Massachusetts Institute of Technology Phd Thesis * Dynamic Scheduling Optimization for Instance Aspect Handling In Workflows YipingWen JL ZhigangChen 2014 Buqing Cao * Dynamic Scheduling of a Flow Shop With On-Site Wind Generation for Energy Cost Reduction Under Real Time Electricity Pricing YuxinZhai KB FuZhao JohnWSutherland Cirp Annals -Manufacturing Technology 66 2017 * Dynamic Scheduling Algorithm for Variants of Hypercube Interconnection Networks JSZaki Ahmad Khan AlamMahfooz Indian Journal of Science and Technology 10 2017 * A Delay-Based Dynamic Scheduling Algorithm for Bag-of-Task Workflows With Stochastic Task Execution Times in Clouds ZhichengCai XL RubenRuiz QianmuLi Future Generation Computer Systems 71 2017 * Negotiation Mechanism for Self-Organized Scheduling System with Collective Intelligence AMadureira IP PPereira AAbraham Neurocomputing 132 2014 * Alternative Approaches Analysis for Scheduling in an Extended Manufacturing Environment ASSantos ML R V GD A MPutnik Madureira 2014 Ieee * Constraint Programming for Dynamic Scheduling Problems AbdallahElkhyari CGNarendra Jussien 2003 * Solving Comprehensive Dynamic Job Shop Scheduling Problem by using A Grasp-Based Approach AdilBaykaso?lu FS K International Journal of Production Research 55 2017 * An Artificial Immune System for Solving Production Scheduling Problems: A Review AhmadShahrizal Muhamad SD Artificial Intelligence Review 39 2011 * A Multi-Period Scheduling of Dynamic Cellular Manufacturing Systems in the Presence of Cost Uncertainty AidinDelgoshaei AA Computers & Industrial Engineering 100 2016 Mohd Khairol Anuar Ariffin, Chandima Gomes * A Dynamic Multi-Agent-Based Scheduling Approach for Smes. the AliVatankhah Barenji RV B DanialRoudi MajidHashemipour International Journal of Advanced Manufacturing Technology 89 2016 * Event Driven Strategy Based Complete Rescheduling Approaches for Dynamic M Identical Parallel Machines Scheduling Problem with a Common Server AlperHamzadayi GY Computers & Industrial Engineering 91 2016 * A Neuro-Fuzzy Model for A New Hybrid Integrated Process Planning and Scheduling System AlperSeker SE RehaBotsali Expert Systems with Applications 40 2013 * TM HAmer Fahmya HeshamBassionic Pm World Journal 9 2014 * A Hybrid Method Based On Linear Programming and Variable Neighborhood Descent for Scheduling Production in Open-Pit Mines AminaLamghari RD J A F Journal of Global Optimization 63 2014 * Production Scheduling of Parallel Machines with Model Predictive Control AndreaCataldo AP RiccardoScattolini Control Engineering Practice 42 2015 * Production Scheduling of Parallel Machines with Model Predictive Control AndreaCataldo AP RiccardoScattolini Control Engineering Practice 42 2015 * Dynamic Set-Up Rules for Hybrid Flow Shop Scheduling with Parallel Batching Machines AndreaRossi AP MicheleLanzetta International Journal of Production Research 52 2013 * Towards Solving Large-Scale Precedence Constrained Production Scheduling Problems in Mining AngusKenny XL AndreasTErnst DhananjayThiruvady 2017 * Dynamic Scheduling on Parallel Machines AnjaFeldmann JSShang-Hua Teng Theoretical Computer Science 130 24 1994 * An Environment-Driven, Function-Based Approach to Dynamic Single-Machine Scheduling MM SArezoo Atighehchian European J. Industrial Engineering 7 19 2013 * Learning Dispatching Rules for Scheduling: a Synergistic View Comprising Decision Trees AtifShahzad NM Tabu Search and Simulation. Computers 5 3 2016 * Tabu Programming for Multiobjective Optimization Problems JBalicki Ijcsns International Journal of Computer Science and Network Security 7 2007 * A Research Survey: Review of Ai Solution Strategies of Job Shop Scheduling Problem SBBanu Çali? Journal of Intelligent Manufacturing 26 2013 * Dynamic Scheduling of Photolithography Process Based on Kohonen Neural Network RBarták Journal of Intelligent Manufacturing Bing-Hai Zhou, X. L., Richard. Y. K.Fung 101 1999. 2013 Grant Agency * Dynamic Task Scheduling using a Directed Neural Network SDBinodini Tripathy Sasmita Kumari Padhy Journal of Parallel and Distributed Computing 75 2015 * PBrucker 2007 Berlin Heidelberg Springer * A Production Scheduling Problem with Uncertain Sequence-Dependent Set-Up Times and Random Yield PXByung Jun Joo International Journal of Production Research 53 2015 * A Dynamic Production Scheduling Model with Lost-Sales or Backlogging CSSung JT R Comput. opns Res 14 1987 * A Joint Production Scheduling Approach Considering Multiple Resources And Preventive Maintenance Tasks CSWong FT S C SHChung International Journal of Production Research 51 2013 * Energy-Efficient Permutation flow Shop Scheduling Problem using A Hybrid Multi-Objective Backtracking Search Algorithm ChaoLu LG XinyuLi QuankePan QiWang Journal Of Cleaner Production 144 2017a * A Hybrid Multi-Objective Grey Wolf Optimizer for Dynamic Scheduling in a Real-World Welding Industry ChaoLu LG XinyuLi ShengqiangXiao Engineering Applications of Artificial Intelligence 57 2017b * Evolutionary Generation of Dispatching Rule Sets for Complex Dynamic Scheduling Problems ChristophWPickardt TH JurgenBranke JensHeger BerndScholz-Reiter International Journal of Production Economics 145 2013 * A Note on the Time Complexity Of Machine Scheduling with Dejong's Learning Effect ChuanliZhao FJ TC ECheng MinJi 2017 * Computers & Industrial Engineering 112 * Real-Time Dynamic Hoist Scheduling For Multistage Material Handling Process under Uncertainties ChuanyuZhao JF QiangXu Aiche Journal 59 2013 * Orca-Fms: A Dynamic Architecture for the Optimized And Reactive Control of Flexible Manufacturing Scheduling CyrillePach TB ThereseBonte DamienTrentesaux Computers In Industry 65 2014 * Integrating Scheduling and Queueing for Dynamic Scheduling Problems DariaTerekhov JC B TonyTTran 2010 * Queueing-Theoretic Approaches for Dynamic Scheduling: A Survey DariaTerekhova DG D A J C B 2014 * A Survey of Dynamic Scheduling In Manufacturing Systems DjamilaOuelhadj SP Journal of Scheduling 12 2008 * A Dynamic Scheduling Model Oriented to Flexible Production XDongjuan Ieee International Coriference on Educational and Network Technology 2010 * Dynamic Parts Scheduling in Multiple Job Shop Cells Considering Intercell Moves and Flexible Routes DongniLi YW GuangxueXiao Computers & Operations Research 40 2013 Jiafu Tang * Simulation Study of Dispatching Rules in Stochastic Job Shop Dynamic Scheduling EdnaBarbosa Da MG CSilva Marilda F´atima De Souza Da FabioHenriqueSilva Pereira World Journal of Modelling and Simulation 10 11 2014 * flow-Shop Scheduling Problem under Uncertainties: Review and Trends ElianaMaría González-Neira AR M.-T DavidBarrera International Journal of Industrial Engineering Computations 2017 * Application of A Modified Ga, Aco And A Random Search Procedure to Solve the Production Scheduling of a Case Study Bakery FlorianTHecker MS ThomasBecker BerndHitzmann Expert Systems With Applications 41 2014 * Crane Scheduling Problem With Non-Interference Constraints in a Steel Coil Distribution Center GabrielaNMaschiettoa YOMartin GRavetti MauricioC DeSouza International Journal Of Production Research 2016 * Selection Constructive Based Hyper-Heuristic for Dynamic Scheduling SR PGomes 2014 Master Degree * Dynamic Adjustment of Dispatching Rule Parameters in flow Shops with Sequence Dependent Setup Times JHeger Branke Jurgen Hildebrandt Torsten BerndScholz-Reiter International Journal of Production Research 2016 * Handbook of Production Scheduling University of Maryland JWHerrmann 2006 College Park, Sprineger * Self-Optimization Module for Scheduling using Case-Based Reasoning IPereira AM 2013 * A Neural Network Model for Scheduling Problems BGIhsan Sabuncuoglu European Journal of Operational Research 93 12 1996 * A Survey of Multi-Factory Scheduling JBehnamian SM T F G Journal of Intelligent Manufacturing 27 2014 * Dynamic Scheduling in Rfid-Driven Discrete Manufacturing System by using Multi-Layer Network Metrics As Heuristic Information JiewuLeng PJ Journal of Intelligent Manufacturing 2017 * Handbook of Scheduling. Scheduling Real-Time Tasks Y-TJoseph Leung"sanjoy JGBaruah Algorithms and Complexity 2004 Crc Press Llc * A Bayesian Networks Structure Learning and Reasoning-Based Byproduct Gas Scheduling In Steel Industry JunZhao WKan Sun YingLiu Ieee Transactions on Automation Science and Engineering 11 2014 * Automated Design of Production Scheduling Heuristics: A Review SNJurgen Branke ChristophPickardt MengjieZhang Ieee Transactions on Evolutionary Computation 20 2016 * Automated Design of Production Scheduling Heuristics: A Review SNJurgenbranke ChristophPickardt MengjieZhang Ieee Transactions on Evolutionary Computation 20 2016 * Comparison of Dispatching Rules in Job-Shop Scheduling Problem using Simulation: a Case Study AKKaban ZOthman DSRohmah Int J Simul Model 12 2012. 2012 * Predictive -Reactive Strategy for Real Time Scheduling of Manufacturing Systems KDKalinowski Krzysztof GrabowikCezary Applied Mechanics and Materials 307 2013 * PKaminsky 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 * A Review on Artificial Neural Network Approach in Manufacturing Systems VSKumar OJSoni GKumar R 2014 * Flexible Job Shop Scheduling Problem using an Improved Ant Colony Optimization LeiWang JC MingLi ZhihuLiu 2017 2017 * A Genetic Algorithm For Job-Shop Scheduling YLi YChen Journal of Software 5 2010 * Rescheduling of Observing Spacecraft using Fuzzy Neural Network and Ant Colony Algorithm WRLi Yuqing Xu Minqiang Chinese Journal of Aeronautics 27 2014 * Dynamic Rescheduling in Fms that is Simultaneously Considering Energy Consumption And Schedule Efficiency. the LipingZhang XLLiang Gao GuohuiZhang International Journal of Advanced Manufacturing Technology 87 2013 * A Neural Network Model and Algorithm for The Hybrid Flow Shop Scheduling Problem in a Dynamic Environment LixinTang WL J I Y I NLi U Journal Of Intelligent Manufacturing 16 2005. 2005 * Multi-Objective Scheduling of Dynamic Job Shop using Variable Neighborhood Search MAAdibi MZ M Expert Systems with Applications 37 Amiri 2010 * Hybrid Scheduling and Maintenance Problem Using Artificial Neural Network Based Meta-Heuristics MehdiAbedi HS Journal of Modelling In Management 2017 Hamed Fazlollahtabar * Genetic Algorithms for Task Scheduling Problem FAOmara MMArafa Journal of Parallel and Distributed Computing 70 2010 * Survey of Dynamic Scheduling in Manufacturing Systems DOuelhadj PS Journal of Scheduling 27 2009 * PaoloPriore DD L F RaúlPino JavierPuente Dynamic Scheduling of Flexible Manufacturing Systems using Neural Networks and Inductive Learning 2001 * Real-Time Scheduling of Flexible Manufacturing Systems using Support Vector Machines And Case-Based Reasoning PaoloPriore RP JoseParreño JavierPuente Business and Management 3 2015 Journal of Economics * Multi Agents Approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search Method MARakesh Kumar The 20th World Multi-Conference on Systemics, Cybernetics and Informatics Wmsci Haryana 2016 * Ant Colony Optimization for Train Scheduling: an Analysis SKSahana AJain PKMahanti International Journal of Intelligent Systems and Applications 6 2014 * KRSana Alyaseri K.-M Multi Objective Bee Colony Optimization Framework for Grid Job Scheduling. the 4th International Conference on Computing and Informatics 2013 * A Neural Network Approach To Dynamic TEguchi FO THirai Job Shop Scheduling. K. Mertins Et Al. 1999 Global Production Management * Dynamic Schedule Execution In an Agent Based Holonic Manufacturing System BBTarun Kanti Jana SoumenPaul BijanSarkar JyotirmoySaha Journal of Manufacturing Systems 32 2013 * Dynamic Schedule Execution in an Agent Based Holonic Manufacturing System BBTarun Kanti Jana SoumenPaul BijanSarkar JyotirmoySaha Journal of Manufacturing Systems 32 2013 * Dynamic Scheduling of Manufacturing Systems With Setups And Random Disruptions FTubilla 2011 Massachusetts Institute of Technology Phd Thesis * Dynamic Scheduling Optimization for Instance Aspect Handling In Workflows YipingWen JL ZhigangChen 2014 Buqing Cao * Dynamic Scheduling of A flow Shop with on-Site Wind Generation for Energy Cost Reduction under Real Time Electricity Pricing YuxinZhai KB FuZhao JohnWSutherland Cirp Annals -Manufacturing Technology 66 2017 * Dynamic Scheduling Algorithm for Variants Of Hypercube Interconnection Networks JSZaki Ahmad Khan AlamMahfooz Indian Journal of Science and Technology 10 2017 * A Delay-Based Dynamic Scheduling Algorithm for Bag-Of-Task Workflows with Stochastic Task Execution Times in Clouds ZhichengCai XL RubenRuiz QianmuLi Future Generation Computer Systems 71 2017