Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Implicit memory‐based technique in solving dynamic scheduling problems through Response Surface Methodology – Part I Model and method

Implicit memory‐based technique in solving dynamic scheduling problems through Response Surface... Purpose – This is the first part of a two‐part paper. The purpose of this paper is to report on methods that use the Response Surface Methodology (RSM) to investigate an Evolutionary Algorithm (EA) and memory‐based approach referred to as McBAR – the Mapping of Task IDs for Centroid‐Based Adaptation with Random Immigrants. Some of the methods are useful for investigating the performance (solution‐search abilities) of techniques (comprised of McBAR and other selected EA‐based techniques) for solving some multi‐objective dynamic resource‐constrained project scheduling problems with time‐varying number of tasks. Design/methodology/approach – The RSM is applied to: determine some EA parameters of the techniques, develop models of the performance of each technique, legitimize some algorithmic components of McBAR, manifest the relative performance of McBAR over the other techniques and determine the resiliency of McBAR against changes in the environment. Findings – The results of applying the methods are explored in the second part of this work. Originality/value – The models are composite and characterize an EA memory‐based technique. Further, the resiliency of techniques is determined by applying Lagrange optimization that involves the models. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Intelligent Computing and Cybernetics Emerald Publishing

Implicit memory‐based technique in solving dynamic scheduling problems through Response Surface Methodology – Part I Model and method

Download PDF
29 pages

Loading next page...
 
/lp/emerald-publishing/implicit-memory-based-technique-in-solving-dynamic-scheduling-problems-70xvFEMq0c
Publisher
Emerald Publishing
Copyright
Copyright © 2014 Emerald Group Publishing Limited. All rights reserved.
ISSN
1756-378X
DOI
10.1108/IJICC-12-2013-0053
Publisher site
See Article on Publisher Site

Abstract

Purpose – This is the first part of a two‐part paper. The purpose of this paper is to report on methods that use the Response Surface Methodology (RSM) to investigate an Evolutionary Algorithm (EA) and memory‐based approach referred to as McBAR – the Mapping of Task IDs for Centroid‐Based Adaptation with Random Immigrants. Some of the methods are useful for investigating the performance (solution‐search abilities) of techniques (comprised of McBAR and other selected EA‐based techniques) for solving some multi‐objective dynamic resource‐constrained project scheduling problems with time‐varying number of tasks. Design/methodology/approach – The RSM is applied to: determine some EA parameters of the techniques, develop models of the performance of each technique, legitimize some algorithmic components of McBAR, manifest the relative performance of McBAR over the other techniques and determine the resiliency of McBAR against changes in the environment. Findings – The results of applying the methods are explored in the second part of this work. Originality/value – The models are composite and characterize an EA memory‐based technique. Further, the resiliency of techniques is determined by applying Lagrange optimization that involves the models.

Journal

International Journal of Intelligent Computing and Cybernetics – Emerald Publishing

Published: Jun 3, 2014

Keywords: Evolutionary computation; Genetic Algorithms; Multi‐objective optimization; Response Surface Methodology; Scheduling; Resource‐constrained project; Dynamic environments

References

  • Bi‐objective resource‐constrained project scheduling with robustness and makespan criteria
    Abbasi, B.; Shadrokh, S.; Arkat, J.
  • An adaptive approach for solving dynamic scheduling with time‐varying number of tasks – Part I
    Abello, M.B.; Bui, L.T.; Michalewicz, Z.
  • Multi‐objective resource‐constrained project scheduling with a time‐varying number of tasks
    Abello, M.B.; Michalewicz, Z.
  • A reactive‐proactive approach for solving dynamic scheduling with time‐varying number of tasks
    Abello, M.B.; Michalewicz, Z.; Bui, L.T.
  • Application of memory‐based approach to multi‐objective optimization on dynamic resource‐constrained project scheduling with time‐varying number of tasks
    Abello, M.B.; Michalewicz, Z.; Bui, L.T.
  • A portfolio optimization model with three objectives and discrete variables
    Anagnostopoulos, K.P.; Mamanis, G.
  • Multi‐objective Tabu search based algorithm for progressive resource allocation
    Belfares, L.; Klibi, W.; Lo, N.; Guitouni, A.
  • Investigating the performance of genetic algorithm‐based software test case generation
    Berndt, D.J.; Watkins, A.
  • A modified path of steepest ascent for split‐plot experiments
    Borror, C.M.; Montgomery, D.C.
  • ECT sensor optimization based on RSM and GA
    Brandisky, K.; Sankowski, D.; Banasiak, R.
  • Evolutionary Optimization in Dynamic Environments
    Branke, J.
  • Robust Pareto front genetic programming parameter selection based on design of experiments and industrial data
    Castillo, F.; Kordon, A.; Smits, G.
  • An evolutionary algorithm that makes decision based on the entire previous search history
    Chow, C.K.; Yuen, S.Y.
  • An investigation of niche and species formation in genetic function optimization
    Deb, K.; Goldberg, D.E.
  • A fast and elitist multiobjective genetic algorithm: NSGA‐II
    Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T.
  • An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
    Engin, O.; Ceran, G.; Yilmaz, M.K.
  • An effective shuffled frog‐leaping algorithm for resource‐constrained project scheduling problem
    Fang, C.; Wang, L.
  • Efficient surrogate construction by combining response surface methodology and reduced order modeling
    Gogu, C.; Passieux, J.‐C.
  • Experimental evaluation of state‐of‐the‐art heuristics for the resource‐constrained project scheduling problem
    Hartmann, S.; Kolisch, R.
  • Introduction to Operations Research
    Hillier, F.S.; Lieberman, G.J.
  • Evolutionary algorithms based design of multivariable PID controller
    Iruthayarajan, M.W.; Baskar, S.
  • Modelling and analysis of factors influencing surface roughness and delamination of milling of GFRP laminates using RSM
    Jenarthanan, M.P.; Jeyapaul, R.; Naresh, N.
  • Evolutionary optimization in uncertain environments – a survey
    Jin, Y.; Branke, J.
  • Trade‐off between performance and robustness: an evolutionary multiobjective approach
    Jin, Y.; Sendhoff, B.
  • Optimization of IC encapsulation considering fluid/structure interaction using Response Surface Methodology
    Khor, C.Y.; Abdullah, M.Z.
  • Ant colony optimization for resource‐constrained project scheduling
    Merkle, D.; Middendorf, M.; Schmeck, H.
  • Genetic Algorithms + Data Structures=Evolution Programs
    Michalewicz, Z.
  • Design and Analysis of Experiments
    Montgomery, D.C.
  • Model development for quality features of resistance spot welding using multi‐objective Taguchi method and response surface methodology
    Muhammad, N.; Manurung, Y.H.P.; Jaafar, R.; Abas, S.K.; Tham, G.; Haruman, E.
  • Response Surface Methodology. Process and Product Optimization Using Designed Experiments
    Myers, R.H.; Montgomery, D.C.
  • Multiple and bi‐criteria scheduling: a literature survey
    Nagar, A.; Haddock, J.; Heragu, S.
  • A Tabu search algorithm for solving economic lot scheduling problem
    Raza, S.A.; Akgunduz, A.; Chen, M.Y.
  • Analyzing heuristic performance with response surface models: prediction, optimization and robustness
    Ridge, E.; Kudenko, D.
  • Response Surface Methodology and Genetic Algorithm use to optimize the cutting condition for surface roughness parameters in CNC turning
    Routara, B.C.; Sahoo, A.K.; Parida, A.K.; Padhi, P.C.
  • A new nonlinear stochastic staff scheduling model
    Sadjadi, S.J.; Soltani, R.; Izadkhah, M.; Saberian, F.; Darayi, M.
  • Model reduction and optimization of a reactive dividing wall batch distillation column inspired by response surface methodology and differential evolution
    Safea, M.; Khazraeeb, S.M.; Setoodeha, P.; Jahanmiria, A.H.
  • Time‐dependent performance comparison of evolutionary algorithms
    Shilane, D.; Martikainen, J.; Ovaska, S.J.
  • Real world disassembly modeling and sequencing problem: optimization by Algorithm of Self‐Guided Ants (ASGA)
    Tripathi, M.; Agrawal, S.; Pandey, M.K.
  • Optimization of electric discharge machining process using the Response Surface Methodology and Genetic Algorithm Approach
    Tzeng, C.‐J.; Chen, R.‐Y.
  • Using metaheuristics in multiobjective resource constrained project scheduling
    Viana, A.; de Sousa, J.P.
  • An effective estimation of distribution algorithm for the multi‐mode resource‐constrained project scheduling problem
    Wang, L.; Fang, C.
  • Optimal design of medium channels for water‐assisted rapid thermal cycle mold using multi‐objective evolutionary algorithm and multi‐attribute decision‐making method
    Wang, M.; Dong, J.; Wang, W.; Zhou, J.; Dai, Z.; Zhuang, X.; Yao, X.
  • Modeling the performance of evolutionary algorithms on the root identification problem: a case study with PBIL and CHC algorithms
    Yeguas, E.; Joan‐Arinyo, R.; Luzón, M.V.
  • Multi‐criteria dynamic scheduling methodology for controlling a semiconductor wafer fabrication system
    Zhang, H.; Jiang, Z.; Hu, H.
  • Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach
    Zitzler, E.; Thiele, L.