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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    One-machine scheduling problems with resource constraints


    Contributors:


    Publication date :

    1986-01-01


    Size :

    7 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    Scheduling Optimization of Prefabricated Buildings under Resource Constraints

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


    Optimization of Electric Bus Scheduling Considering Charging Station Resource Constraints

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



    A Dynamic Scheduling Algorithm for Sporadic Tasks under Resource and Timing Constraints

    Silly, M. / British Institute of Regulatory Affairs / International Federation of Automatic Control et al. | British Library Conference Proceedings | 1995