• Online hierarchical scheduling...

Result: Online hierarchical scheduling: An approach using mathematical programming

Title:
Online hierarchical scheduling: An approach using mathematical programming
Authors:
ZHIYI TAN, AN ZHANG
Source:
Theoretical computer science. 412(3):246-256
Publisher Information:
Oxford: Elsevier, 2011.
Publication Year:
2011
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Récursivité, Recursion theory, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Divers, Miscellaneous, Logiciel, Software, Performances des systèmes informatiques. Fiabilité, Computer systems performance. Reliability, Algorithme compétitif, Competitive algorithms, Algorithme optimal, Optimal algorithm, Algoritmo óptimo, Borne inférieure, Lower bound, Cota inferior, Informatique théorique, Computer theory, Informática teórica, Machine parallèle, Parallel machines, Maximum, Máximo, Ordonnancement, Scheduling, Reglamento, Programmation mathématique, Mathematical programming, Programación matemática, Solution bornée, Bounded solution, Solución acotada, Temps total achèvement, Makespan, Tiempo total acabamiento, 03D55, 65K05, 65Kxx, 68M20, 68Wxx, Competitive ratio, Hierarchy, Online
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, China
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=23726189
Rights:
Copyright 2015 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

Mathematics
Accession Number:
edscal.23726189
Database:
PASCAL Archive

Further Information

This paper considers an online hierarchical scheduling problem on parallel identical machines. We are given a set of m machines and a sequence of jobs. Each machine has a different hierarchy, and each job also has a hierarchy associated with it. A job can be assigned to a machine only if its hierarchy is no less than that of the machine. The objective is to minimize the makespan, i.e., the maximum load of all machines. Two models are studied in the paper. For the fractional model, we present an improved algorithm and lower bounds. Both the algorithm and the lower bound are based on solutions of mathematical programming. For any given m, our algorithm is optimal by numerical calculation. For the integral model, we present both a general algorithm for any m, and an improved algorithm with better competitive ratios of 2.333 and 2.610 for m = 4 and 5, respectively.