Abstract One-machines scheduling problems with maximum lateness and maximum tardiness criteria are generalized on the case with allocation of continuously-divisible constrained nonrenewable resource. Models of operation are assumed to be duration versus resource amount linear functions. For the problems with maximum lateness and the maximum tardiness criteria under equal release dates (i.e. moments at which operations are available for processing) polynomial-time algorithms are found. It is shown that the problem with maximum lateness criterion under unequal release dates is NP-hard. For this problem a branch-and-bound algorithm (utilizing properties shown) is outlined.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    One-machine scheduling problems with resource constraints


    Beteiligte:
    Janiak, Adam (Autor:in)


    Erscheinungsdatum :

    01.01.1986


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Scheduling Optimization of Prefabricated Buildings under Resource Constraints

    He, Wei / Li, Wenjing / Meng, Xiaofeng | Springer Verlag | 2021


    Message Scheduling and Asymptotic Stability of System with Resource Constraints

    Li, Z.-x. / Wang, W.-l. / Cheng, X.-m. | British Library Online Contents | 2008


    Networked Control System Feedback Scheduling Approach under Resource Constraints

    Wang, J.-d. / Tang, X.-m. / Yu, J.-s. | British Library Online Contents | 2008


    Optimization of Electric Bus Scheduling Considering Charging Station Resource Constraints

    Zhang, Mingye / Yang, Min / Li, Yu et al. | Transportation Research Record | 2023