Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem


    Contributors:


    Publication date :

    2010-01-01


    Size :

    13 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    DDC:    003.3



    Segmentation-Based Nonpreemptive Channel Scheduling Algorithms for Optical Burst-Switched Networks

    Vokkarane, V. M. / Jue, J. P. | British Library Online Contents | 2005




    BicriteriaHeuristic for Unrelated Parallel Machine Scheduling Problem

    Lin, Y.K. / Lin, H.C. | British Library Conference Proceedings | 2014


    Tasks Scheduling Technique Using League Championship Algorithm for Makespan Minimization in IaaS Cloud

    Abdulhamid, Shafii Muhammad / Latiff, Muhammad Shafie Abd / Idris, Ismaila | ArXiv | 2015

    Free access