Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs

DOI10.1016/S0377-2217(98)00282-3zbMath0945.90018OpenAlexW2072301649MaRDI QIDQ1307810

Konstantin Kogan, Avraham Shtub

Publication date: 11 October 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00282-3

zbMATH Keywords

maximum principleproject schedulingtime-decomposition methods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Decomposition methods (49M27)

Related Items (1)

Resource loading with time windows

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal segmentation of projects -- Schedule and cost considerations
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Solving resource-constrained project scheduling problems by a* search

This page was built for publication: Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs