Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem ; 1996, 536
Preprint Reihe Mathematik ; 1996, 536

Classification: Mathematik

Creator: Phillips, Cynthia A.
Schulz, Andreas S.
Shmoys, David Bernard
Stein, Clifford
Wein, Joel

DOI: 10.14279/depositonce-14234

Handle: 11303/15461

URN: urn:nbn:de:101:1-2022011307075902521888

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:39 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Other Objects (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

Arbeitspapier

Improved lower bounds for the proportional lot sizing and scheduling problem

Noten (Musik)

Relaxations

Parallel scheduling : 14.07. - 18.07.97

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Hochschulschrift

Work efficient parallel scheduling algorithms

Hochschulschrift

Work efficient parallel scheduling algorithms

Parallel path progression DAG scheduling

Hochschulschrift | Online-Publikation

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

Arbeitspapier

Improved lower bounds for the proportional lot sizing and scheduling problem

Noten (Musik)

Relaxations

Parallel scheduling : 14.07. - 18.07.97

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Hochschulschrift

Work efficient parallel scheduling algorithms

Hochschulschrift

Work efficient parallel scheduling algorithms

Parallel path progression DAG scheduling

Hochschulschrift | Online-Publikation

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

Arbeitspapier

Improved lower bounds for the proportional lot sizing and scheduling problem

Noten (Musik)

Relaxations

Parallel scheduling : 14.07. - 18.07.97

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Hochschulschrift

Work efficient parallel scheduling algorithms

Hochschulschrift

Work efficient parallel scheduling algorithms

Parallel path progression DAG scheduling

Hochschulschrift | Online-Publikation

Work efficient parallel scheduling algorithms

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (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

Improved lower bounds for the proportional lot sizing and scheduling problem

Relaxations

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

Improved lower bounds for the proportional lot sizing and scheduling problem

Relaxations

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

Improved lower bounds for the proportional lot sizing and scheduling problem

Relaxations

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

Related objects

Reset password