Publicación:
PERFORMANCE GUARANTEE OF THE JUMP NEIGHBORHOOD FOR SCHEDULING JOBS ON UNIFORMLY RELATED MACHINES

Vista sencilla de ítem
dc.creatorFELIPE TOMÁS MUÑOZ VALDÉS
dc.date2022
dc.date.accessioned2025-01-10T15:32:37Z
dc.date.available2025-01-10T15:32:37Z
dc.date.issued2022
dc.description.abstractWE STUDY THE WORST CASE PERFORMANCE GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS FOR THE PROBLEM OF SCHEDULING JOBS ON UNIFORMLY RELATED PARALLEL MACHINES WITH THE OBJECTIVE OF MINIMIZING THE TOTAL WEIGHTED COMPLETION TIME. THE QUALITY OF LOCALLY OPTIMAL SOLUTIONS UNDER THE JUMP NEIGHBORHOOD IS ANALYZED, WHICH CONSISTS OF ITERATIVELY MOVING A SINGLE JOB FROM ONE MACHINE TO ANOTHER, IMPROVING THE TOTAL WEIGHTED COMPLETION TIME IN EACH ITERATION AND STOPPING ONCE IMPROVEMENT IS NO LONGER POSSIBLE. WE PROPOSE AN UPPER BOUND FOR THE TOTAL WEIGHTED COMPLETION TIME FOR THE SOLUTIONS OBTAINED BY THIS LOCAL SEARCH, AND UPPER AND LOWER BOUNDS FOR THE PERFORMANCE GUARANTEE OF THE OBTAINED LOCALLY OPTIMAL SOLUTIONS. ADDITIONALLY, THE CASE OF IDENTICAL PARALLEL MACHINES IS ANALYZED.
dc.formatapplication/pdf
dc.identifier.doi10.1051/ro/2022045
dc.identifier.issn2804-7303
dc.identifier.issn1290-3868
dc.identifier.issn0399-0559
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/12511
dc.languagespa
dc.publisherRAIRO-OPERATIONS RESEARCH
dc.relation.uri10.1051/ro/2022045
dc.rightsPUBLICADA
dc.titlePERFORMANCE GUARANTEE OF THE JUMP NEIGHBORHOOD FOR SCHEDULING JOBS ON UNIFORMLY RELATED MACHINES
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos