Martin Skutella, Marc Uetz  Home/Search
Context
Related
| adeit.uv.es/pms2002/papers/N88.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: adeit.uv.es/pms...def_det.htm#thu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time w j C j , where w j 0. Building upon a linear programming relaxation by Mohring, Schulz, and Uetz [5] and an idle time charging scheme by Chekuri, Motwani, Natarajan, and Stein [2], we... (Update)
Active bibliography (related documents): More All
0.6: List Scheduling in Order of alpha-Points on a Single Machine - Skutella (2002) (Correct)
0.4: Fachbereich 3 - Mathematik Scheduling.. (2000) (Correct)
0.4: Approximation in Stochastic Scheduling: The Power of.. - Möhring, Schulz, Uetz (1998) (Correct)
Similar documents based on text: More All
0.5: Stochastic Machine Scheduling with Precedence Constraints - Martin Skutella Fakultat (2002) (Correct)
0.4: Scheduling Unrelated Machines by Randomized Rounding - Schulz, Skutella (1999) (Correct)
0.3: Approximation in Stochastic Scheduling: The Power of.. - Möhring, Schulz, Uetz (1998) (Correct)
BibTeX entry: (Update)
@misc{ skutella-approximation,
author = "Martin Skutella and Marc Uetz",
title = "Approximation Algorithms for Stochastic Machine Scheduling With Precedence
Constraints",
url = "citeseer.ist.psu.edu/skutella02approximation.html" }
Citations (may not include all citations):170 Bounds for certain multiprocessing anomalies (context) - Graham - 1966
54 Approximation techniques for average completion time schedul.. - Chekuri, Motwani et al. - 2001
8 Scheduling partially ordered tasks with probabilistic execut.. (context) - Chandy, Reynolds - 1975
6 Polynomial time approximation algorithms for machine schedul.. - Schuurman, Woeginger - 1999
5 Approximation in stochastic scheduling: The power of LP-base.. - Mohring, Schulz et al. - 1999
5 Stochastic scheduling problems I: General strategies (context) - Mohring, Radermacher et al. - 1984
4 Scheduling precedence constrained jobs with stochastic proce.. (context) - Skutella, Uetz - 2001
Documents on the same site (http://www.adeit.uv.es/pms2002/prog_def_det.htm#thu): More
Dominance Properties for Permutation Flow Shop Problems - Portmann, Amet, Kovalyov (2002) (Correct)
Comparative Analysis on approximation algorithms for the.. - Coelho, Tavares (2002) (Correct)
On-line Multiprocessor Tasks Scheduling with Rejection - Caramia, Dell'Olmo, al. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC