Sciweavers

    121
    Voted
    IPCO
    1998
    99views Optimization» more  IPCO 1998»
    Non-approximability Results for Scheduling Problems with Minsum Criteria
    15 years 4 months ago
    Non-approximability Results for Scheduling Problems with Minsum Criteria
    Download  www.win.tue.nl
    We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
    Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.