Sciweavers

    2 search results - page 1 / 1
    » Dense open-shop schedules with release times
    Sort
    View
    TCS
    2008
    116views Theoretical Computer Science» more  TCS 2008»
    Dense open-shop schedules with release times
    13 years 11 months ago
    Dense open-shop schedules with release times
    Download  scs.lakeheadu.ca
    We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
    Rongjun Chen, Wanzhen Huang, Guochun Tang
    claim paper
    Read More »
    IPCO
    1998
    99views Optimization» more  IPCO 1998»
    Non-approximability Results for Scheduling Problems with Minsum Criteria
    14 years 15 days 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
    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.