Depending on the type of processor, the classical problem of scheduling n jobs on a multiprocessor system with m processors has a number of variations. R.S. Chang and R.C.T. Lee (1988) developed two polynomial algorithms to find an optimal schedule under the condition that each processor can only execute a subset of jobs. Such a condition is useful in many areas such as scheduling a set of cannons to fire a set of targets; each cannon can only fire a subset of targets because of the cannon's range and angle. Two polynomial algorithms with less time complexities than Chang and Lee's algorithms are proposed to the same problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Scheduling unit-time jobs on processors with different capabilities


    Additional title:

    Planung von Einheitszeit-Aufgaben fuer Prozessoren unterschiedlicher Leistungsfaehigkeit in einem Multiprozessorsystem


    Contributors:
    Chen, Y.L. (author) / Chin, Y.H. (author)

    Published in:

    Publication date :

    1989


    Size :

    9 Seiten, 14 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

    Brucker, P. / Kravchenko, S. A. | British Library Online Contents | 2006


    Efficiently Scheduling Tape-resident Jobs

    Shi, J. / Xing, C. / Zhou, L. et al. | British Library Conference Proceedings | 2002


    A Delay Scheduling Algorithm for Short Jobs

    Liu, Qiang / Dong, Xiaoshe / Zhu, Zhengdong et al. | British Library Online Contents | 2015


    JOBS SCHEDULING WITH EARLY-TARDY PENALTIES IN MANUFACTURING SYSTEMS

    Liu, C. / International Council of the Aeronautical Sciences | British Library Conference Proceedings | 2004


    Jobs! Jobs! Jobs!

    Kling, Meinrad | IuD Bahn | 1995