- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem ; 1996, 536
Preprint Reihe Mathematik ; 1996, 536
- Klassifikation
-
Mathematik
- DOI
-
10.14279/depositonce-14234
- Handle
-
11303/15461
- URN
-
urn:nbn:de:101:1-2022011307075902521888
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:39 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Ähnliche Objekte (12)
Semidefinite Relaxations for Parallel Machine Scheduling
Presolving techniques and linear relaxations for cumulative scheduling
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Relaxations
Improved lower bounds for the proportional lot sizing and scheduling problem
Parallel scheduling : 14.07. - 18.07.97
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Work efficient parallel scheduling algorithms
Work efficient parallel scheduling algorithms
Parallel path progression DAG scheduling
Work efficient parallel scheduling algorithms
Semidefinite Relaxations for Parallel Machine Scheduling
Presolving techniques and linear relaxations for cumulative scheduling
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Relaxations
Improved lower bounds for the proportional lot sizing and scheduling problem
Parallel scheduling : 14.07. - 18.07.97
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Work efficient parallel scheduling algorithms
Work efficient parallel scheduling algorithms
Parallel path progression DAG scheduling
Work efficient parallel scheduling algorithms
Semidefinite Relaxations for Parallel Machine Scheduling
Presolving techniques and linear relaxations for cumulative scheduling
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Relaxations
Improved lower bounds for the proportional lot sizing and scheduling problem
Parallel scheduling : 14.07. - 18.07.97
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Work efficient parallel scheduling algorithms
Work efficient parallel scheduling algorithms
Parallel path progression DAG scheduling