Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

A recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

Author
DELLA CROCE, F1 ; T'KINDT, V2
[1] DAI, Politecnico di Torino, Turin, Italy
[2] E3I, Université de Tours, Tours, France
Source

The Journal of the Operational Research Society. 2002, Vol 53, Num 11, pp 1275-1280, 6 p ; ref : 20 ref

CODEN
JORSDZ
ISSN
0160-5682
Scientific domain
Control theory, operational research
Publisher
Palgrave, Basingstoke
Publication country
United Kingdom
Document type
Article
Language
English
Keyword (fr)
Algorithme recherche Complétude Méthode heuristique Ordonnancement Problème NP difficile Temps polynomial Temps total achèvement Recovering beam search Temps achèvement
Keyword (en)
Search algorithm Completeness Heuristic method Scheduling NP hard problem Polynomial time Makespan Completion time
Keyword (es)
Algoritmo búsqueda Completitud Método heurístico Ordonamiento Problema NP duro Tiempo polinomial Tiempo total acabamiento
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A12 Scheduling, sequencing

Discipline
Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
13988629

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

Access to the document

Searching the Web