Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

DOI10.1007/S10852-005-9027-9MaRDI QIDQ2583511zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fawaz S. Al-Anzi, Ali Allahverdi

Publication date 17 January 2006

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-9027-9

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing flow time variance in a single machine system using genetic algorithms
• Solving the response time variability problem by means of a genetic algorithm
• Minimizing the Flow-time Variance in Single-machine Systems
• Response time variability
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Cites work

• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A tight lower bound for the completion time variance problem
• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in parallel flowshops
• Operations scheduling with applications in manufacturing and services. With 3.5 disk package
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Scheduling alternative operations in two-machine flow-shops
• Tabu search for a class of single-machine scheduling problems
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

Cited in

(1)

• A survey of scheduling problems with setup times or costs

This page was built for publication: Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583511)