Sciweavers

    200 search results - page 3 / 40
    » Approximation Algorithms for Scheduling on Multiple Machines
    Sort
    View
    CLUSTER
    2006
    IEEE
    154views Distributed And Parallel Com...» more  CLUSTER 2006»
    A 2-Approximation Algorithm for Scheduling Independent Tasks onto a Uniform Parallel Machine and its Extension to a Computationa
    14 years 1 months ago
    A 2-Approximation Algorithm for Scheduling Independent Tasks onto a Uniform Parallel Machine and its Extension to a Computationa
    Download  www-hagi.ist.osaka-u.ac.jp
    Noriyuki Fujimoto, Kenichi Hagihara
    claim paper
    Read More »
    ICALP
    2005
    Springer
    113views Programming Languages» more  ICALP 2005»
    A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
    14 years 1 months ago
    A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
    Download  www.icsi.berkeley.edu
    Martin Gairing, Burkhard Monien, Andreas Woclaw
    claim paper
    Read More »
    INFORMS
    2002
    60views more  INFORMS 2002»
    Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
    13 years 7 months ago
    Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
    Download  www.zib.de
    Tjark Vredeveld, Cor A. J. Hurkens
    claim paper
    Read More »
    IPPS
    2010
    IEEE
    103views Distributed And Parallel Com...» more  IPPS 2010»
    Varying bandwidth resource allocation problem with bag constraints
    13 years 5 months ago
    Varying bandwidth resource allocation problem with bag constraints
    Download  www.cse.iitd.ernet.in
    We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
    Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
    claim paper
    Read More »
    MOR
    2000
    90views more  MOR 2000»
    A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
    13 years 7 months ago
    A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
    Download  www.iasi.cnr.it
    We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
    Martin Skutella, Gerhard J. Woeginger
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.