Cargando…
Machine scheduling to minimize weighted completion times: the use of the α-point
This work reviews the most important results regarding the use of the α-point in Scheduling Theory. It provides a number of different LP-relaxations for scheduling problems and seeks to explain their polyhedral consequences. It also explains the concept of the α-point and how the conversion algorith...
Autor principal: | Gusmeroli, Nicoló |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2018
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-319-77528-9 http://cds.cern.ch/record/2316204 |
Ejemplares similares
-
Stochastic project networks: temporal analysis, scheduling and cost minimization
por: Neumann, Klaus
Publicado: (1990) -
Complete and compact minimal surfaces
por: Yang, Kichoon
Publicado: (1989) -
Scheduling control-based theory and polynomial-time algorithms
por: Kogan, Konstantin, et al.
Publicado: (2000) -
Minimal free resolutions over complete intersections
por: Eisenbud, David, et al.
Publicado: (2016) -
Complete minimal surfaces of finite total curvature
por: Yang, Kichoon
Publicado: (1994)