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

DOI10.1007/s10852-005-9027-9zbMath1087.68633OpenAlexW2066516261WikidataQ57717983 ScholiaQ57717983MaRDI QIDQ2583511

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

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

Related Items

A survey of scheduling problems with setup times or costs

Cites Work

• Unnamed Item
• 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
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Scheduling alternative operations in two-machine flow-shops
• Minimizing makespan in parallel flowshops
• Minimizing Makespan in a Class of Reentrant Shops
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Tabu search for a class of single-machine scheduling problems