Result: Semi-online problems on identical machines with inexact partial information

Title:
Semi-online problems on identical machines with inexact partial information
Authors:
ZHIYI TAN, YONG HE
Source:
COCOON 2005 : computing and combinatorics (Kunming, 16-29 August 2005)Lecture notes in computer science. :297-307
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Algorithme compétitif, Competitive algorithms, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Borne inférieure, Lower bound, Cota inferior, Information utile, Useful information, Información útil, Ordonnancement, Scheduling, Reglamento, Problème combinatoire, Combinatorial problem, Problema combinatorio
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, and State Key Lab of CAD & CG Zhejiang University, Hangzhou 310027, China
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17096470
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.17096470
Database:
PASCAL Archive

Further Information

In semi-online scheduling problems, we always assume that some partial additional information is exactly known in advance. This may not be true in some application. This paper considers semi-online problems on identical machines with inexact partial information. Three versions are considered, where we know in advance that the total size of all jobs, the optimal value, and the largest job size are in given intervals, respectively, while their exact values are unknown. We give both lower bounds of the problems and competitive ratios of algorithms as functions of a so-called disturbance parameter r ∈ [1,∞). We establish that for which r the inexact partial information is useful to improve the performance of a semi-online algorithm with respect to its pure online problem. Optimal or near optimal algorithms are then obtained.