Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW Applications

Authors:
Ali Allahverdi;Fawaz S. Al-Anzi
Affiliations:
Department of Mechanical and Industrial Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait;Department of Computer Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait
Venue:
Computers and Operations Research
Year:
2002

Citing 10
Cited 6

Principles of distributed database systems

Principles of distributed database systems
Job lateness in a two-machine flowshop with setup times separated

Computers and Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops

Computers and Operations Research
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

Computers and Operations Research
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Improved heuristics for the n-job single-machine weighted tardiness problem

Computers and Operations Research
Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Operations Research
Design and evaluation of data allocation algorithms for distributed multimedia database systems

IEEE Journal on Selected Areas in Communications

Scheduling requests on multi-stage multi-server to increase quality of service

Network control and engineering for Qos, security and mobility II
A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Data & Knowledge Engineering
A two-machine flowshop problem with processing time-dependent buffer constraints-An application in multimedia presentations

Computers and Operations Research
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

The multimedia data objects scheduling problem for WWW applications is modeled using the two-machine flowshop problem of minimizing maximum lateness with separate setup times. We establish three dominance relations, and propose four heuristics. Also, we conduct computational experiments to compare the performance of the proposed heuristics and that of existing ones in the literature. The results of the computational experiments show that the proposed heuristics are quite efficient.