Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Solving the response time variability problem by means of a psychoclonal approach

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The response time variability problem (RTVP) is a combinatorial scheduling problem that has recently appeared in the literature. This problem has a wide range of real life applications in fields such as manufacturing, hard real-time systems, operating systems and network environments. Originally, the RTVP occurs whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the instants at which they receive the necessary resources is minimized. Since the RTVP is hard to solve, heuristic techniques are needed for solving it. Three metaheuristic—multi-start, GRASP and PSO—algorithms proposed for solving the RTVP in two previous studies have been the most efficient to date in solving non-small instances of the RTVP. We propose solving the RTVP by means of a psychoclonal algorithm based approach. The psychoclonal algorithm inherits its attributes from Maslow’s hierarchy of needs theory and the artificial immune system (AIS) approach, specifically the clonal selection principle. In this paper, we compare the proposed psychoclonal algorithm with the three aforementioned metaheuristic algorithms and show that, on average, the psychoclonal algorithm strongly improves on the results obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Adenso-Díaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54, 99–114 (2006)

    Article  MATH  Google Scholar 

  • Balinski, M.L., Young, H.P.: Fair Representation: Meeting the Ideal of One Man, One Vote. Yale University Press, New Haven (1982)

    Google Scholar 

  • Corominas, A., Kubiak, W., Pastor, R.: Solving the Response Time Variability Problem (RTVP) by means of mathematical programming. Working paper IOC-DT, Universitat Politècnica de Catalunya, Spain (2006)

  • Corominas, A., Kubiak, W., Moreno, N.: Response time variability. J. Sched. 10, 97–110 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • De Castro, L.N., Timmis, J.: Artificial Immune Systems: A New Computational Intelligence Approach. Springer, London (2002)

    MATH  Google Scholar 

  • De Castro, L.N., von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Trans. Evol. Comput. 6(3), 239–251 (2002)

    Article  Google Scholar 

  • Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124–141 (1999)

    Article  Google Scholar 

  • Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–81 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  • García, A., Pastor, R., Corominas, A.: Solving the Response Time Variability Problem by means of metaheuristics. Special Issue Front. Artif. Intell. Appl. Artif. Intell. Res. Dev. 146, 187–194 (2006)

    Google Scholar 

  • García-Villoria, A., Pastor, R.: Introducing dynamic diversity into a discrete particle swarm optimization. Comput. Oper. Res. (2007). doi:10.1016/j.cor.2007.12.001

    Google Scholar 

  • Gaspar, A., Collard, P.: Two models of immunization for time dependent optimization. In: Proceedings of the IEEE International Conference on Systems Manufacturing and Cybernetics, pp. 113–118 (2000)

  • Herrmann, J.W.: Generating cyclic fair sequences using aggregation and stride scheduling. Technical Report, University of Maryland, USA (2007)

  • Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Australia (1995)

  • Kubiak, W.: Minimizing variation of production rates in just-in-time systems: A survey. Eur. J. Oper. Res. 66(3), 259–271 (1993)

    Article  MATH  Google Scholar 

  • Kubiak, W.: Fair sequences. In: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman and Hall, London (2004)

    Google Scholar 

  • Kubiak, W., Sethi, S.P.: A note on level schedules for mixed-model assembly lines in just-in-time production systems. Manag. Sci. 37, 121–122 (1991)

    Article  MATH  Google Scholar 

  • Kumar, A., Prakash, A., Shankar, R., Tiwari, M.K.: Psycho-clonal algorithm based approach to solve continuous flow shop scheduling problem. Expert Syst. Appl. 31(3), 504–514 (2006a)

    Article  Google Scholar 

  • Kumar, A., Prakash, A., Tiwari, M.K., Chan, F.T.S.: Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach. Int. J. Prod. Res. 44(11), 2245–2263 (2006b)

    Article  Google Scholar 

  • Martí, R.: Multi-start methods. In: Glover, Kochenberger (eds.) Handbook of Metaheuristics, pp. 355–368. Kluwer Academic, Dordrecht (2003)

    Google Scholar 

  • Maslow, A.H.: Motivation and Personality. Harper & Bros, New York (1954)

    Google Scholar 

  • Miltenburg, J.: Level schedules for mixed-model assembly lines in just-in-time production systems. Manag. Sci. 35(2), 192–207 (1989)

    Article  MATH  Google Scholar 

  • Monden, Y.: Toyota Production Systems. Industrial Engineering and Management Press, Norcross (1983)

    Google Scholar 

  • Prakash, A., Tiwari, M.K.: Solving a disassembly line balancing problem with task failure using a psycho-clonal algorithm. In: International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, California, USA (2005)

  • Singh, R.K., Prakash A., Kumar, S., Tiwari, M.K.: Psycho-clonal based approach to solve a TOC product mix decision problem. Int. J. Adv. Manuf. Technol. 29, 1194–1202 (2006)

    Article  Google Scholar 

  • Tiwari, M.K., Prakash, A., Kumar, A., Mileham, A.R.: Determination of an optimal sequence using the psychoclonal algorithm. ImechE, Part B: J. Eng. Manuf. 219, 137–149 (2005)

    Article  Google Scholar 

  • Waldspurger, C.A., Weihl, W.E.: Stride scheduling: deterministic proportional-share resource management. Technical Report MIT/LCS/TM-528, Massachusetts Institute of Technology, MIT Laboratory for Computer Science (1995)

  • Wang, X., Gao, X.Z., Ovaska, S.J.: Artificial immune optimization methods and applications—a survey. IEEE Int. Conf. Syst. Man Cybern. 4, 3415–3420 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto García-Villoria.

Additional information

This research was sponsored by the Spanish Ministry of Education and Science’s project DPI2007-61905; co-funded by the FEDER.

Rights and permissions

Reprints and permissions

About this article

Cite this article

García-Villoria, A., Pastor, R. Solving the response time variability problem by means of a psychoclonal approach. J Heuristics 16, 337–351 (2010). https://doi.org/10.1007/s10732-008-9082-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-008-9082-2

Keywords