Project Scheduling with Discrete and Continuous Resources

DOI10.1109/TSMC.1979.4310093MaRDI QIDQ3859551zbMATH OpenFDO

Authors Jan Węglarz

Publication date 1979

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.1979.4310093

zbMATH Keywords

approximate algorithmscontinuous resourcesdiscrete resourcesexact algorithmsproject schedulingresource allocation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cited in

(11)

• Resource level minimization in the discrete-continuous scheduling
• New trends in machine scheduling
• PSPLIB -- a project scheduling problem library
• Heuristics for multimode scheduling problems with dedicated resources
• Job-shop scheduling with resource-time models of operations
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
• A revised critical path method for networks including both overlap relationships and variable-duration activities
• On a certain class of power- and energy-related scheduling problems
• Scheduling jobs with controllable processing times as an optimal control problem
• scientific article; zbMATH DE number 1416512 (Why is no real title available?)
• Project scheduling with finite or infinite number of activity processing modes -- a survey

This page was built for publication: Project Scheduling with Discrete and Continuous Resources

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