Time-Optimal Control of Resource Allocation in a Complex of Operations Framework

DOI10.1109/TSMC.1976.4309456zbMATH Open0336.49022OpenAlexW4251622085MaRDI QIDQ4104473FDOQ4104473

Authors: Jan Węglarz 

Publication date: 1976

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsmc.1976.4309456

Mathematics Subject Classification ID

Mathematical economics (91B99) Hamilton-Jacobi theories (49L99)

Cited In (13)

• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Mathematical programming formulations for machine scheduling: A survey
• Revenue sharing for resource transfer among projects
• A revised critical path method for networks including both overlap relationships and variable-duration activities
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• Optimal resource profiles for program scheduling
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
• Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
• Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic
• On a certain class of power- and energy-related scheduling problems
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Optimal control policies for resource allocation in an activity network

This page was built for publication: Time-Optimal Control of Resource Allocation in a Complex of Operations Framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4104473)