Publicación:
PERFORMANCE GUARANTEES OF LOCAL SEARCH FOR MINSUM SCHEDULING PROBLEMS

Vista sencilla de ítem
dc.creatorFELIPE TOMÁS MUÑOZ VALDÉS
dc.date2020
dc.date.accessioned2025-01-10T15:15:55Z
dc.date.available2025-01-10T15:15:55Z
dc.date.issued2020
dc.description.abstractWE STUDY THE WORST-CASE PERFORMANCE GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS FOR THE PROBLEM OF MINIMIZING THE TOTAL WEIGHTED AND UNWEIGHTED COMPLETION TIME ON PARALLEL MACHINE ENVIRONMENTS. OUR METHOD MAKES USE OF A MAPPING THAT MAPS A SCHEDULE INTO AN INNER PRODUCT SPACE SO THAT THE NORM OF THE MAPPING IS CLOSELY RELATED TO THE COST OF THE SCHEDULE. WE APPLY THE METHOD TO STUDY THE MOST BASIC LOCAL SEARCH HEURISTICS FOR SCHEDULING, NAMELY JUMP AND SWAP, AND ESTABLISH THEIR WORST-CASE PERFORMANCE IN THE CASE OF UNRELATED, RESTRICTED RELATED AND RESTRICTED IDENTICAL MACHINES.
dc.formatapplication/pdf
dc.identifier.doi10.1007/s10107-020-01571-5
dc.identifier.issn1436-4646
dc.identifier.issn0025-5610
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/11192
dc.languagespa
dc.publisherMATHEMATICAL PROGRAMMING
dc.relation.uri10.1007/s10107-020-01571-5
dc.rightsPUBLICADA
dc.titlePERFORMANCE GUARANTEES OF LOCAL SEARCH FOR MINSUM SCHEDULING PROBLEMS
dc.title.alternativeGARANTÍAS DE RENDIMIENTO DE LA BÚSQUEDA LOCAL PARA PROBLEMAS DE PROGRAMACIÓN MINSUM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos