Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL82X0360229

COMPLEXITY RESULTS FOR SCHEDULING TASKS IN FIXED INTERVALS ON TWO TYPES OF MACHINES

Author
NAKAJIMA K; HAKIMI SL; LENSTRA JK
TEXAS TECH. UNIV., DEP. ELECTR. ENG./LUBBOCK TX 79409/USA
Source
SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 512-520; BIBL. 17 REF.
Document type
Article
Language
English
Keyword (fr)
COMPLEXITE CALCUL ORDONNANCEMENT GESTION TACHE PARALLELISME CALCULABILITE PROBLEME NP-DUR INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
COMPUTING COMPLEXITY INTEGRATED PLANNING PARALLELISM CALCULABILITY COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL82X0360229

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

Searching the Web