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.
One-machine scheduling problems with resource constraints
1986-01-01
7 pages
Article/Chapter (Book)
Electronic Resource
English
A decentralized scheduling method for flowshop problems with resource constraints
Online Contents | 2004
|Scheduling Optimization of Prefabricated Buildings under Resource Constraints
Springer Verlag | 2021
|Message Scheduling and Asymptotic Stability of System with Resource Constraints
British Library Online Contents | 2008
|Networked Control System Feedback Scheduling Approach under Resource Constraints
British Library Online Contents | 2008
|Optimization of Electric Bus Scheduling Considering Charging Station Resource Constraints
Transportation Research Record | 2023
|