Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures

Simple item page
dc.contributor.authorSkutella, Martin
dc.contributor.authorVerschae, José
dc.date.accessioned2020-07-11T21:29:53Z
dc.date.available2020-07-11T21:29:53Z
dc.date.issued2016
dc.format.extent31 páginas
dc.fuente.origenConveris
dc.identifier.doi10.1287/moor.2015.0765
dc.identifier.issn0364-765X
dc.identifier.issn1526-5471
dc.identifier.urihttps://doi.org/10.1287/moor.2015.0765
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/33018
dc.issue.numeroNo. 3
dc.language.isoen
dc.pagina.final1021
dc.pagina.inicio991
dc.revistaMathematics of Operations Researches_ES
dc.rightsacceso restringido
dc.subject.ddc000
dc.subject.deweyCiencias de la computaciónes_ES
dc.subject.ods12 Responsible consuption and production
dc.subject.odspa12 Producción y consumo responsable
dc.subject.otherAlgoritmos computacionaleses_ES
dc.subject.otherProgramas de Computadoreses_ES
dc.subject.otherMatemáticases_ES
dc.titleRobust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departureses_ES
dc.typeartículo
dc.volumenVol. 41
sipa.codpersvinculados243006
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.pdf
Size:
3.1 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Artículos de revistas