References
- Błażewicz, J., Ecker, K., Schmidt, G., Pesch, E. and Węglarz, J. (2007). Handbook of Scheduling: From Theory to Applications, Springer, Berlin.
- Gorczyca, M. and Janiak, A. (2010). Resource level minimization in the discrete-continuous scheduling, European Journal of Operational Research203(1): 32–41.
- Janiak, A. (1991). Single machine scheduling problem with a common deadline and resource dependent release dates, European Journal of Operational Research53(3): 317–325.
- Karmarkar, N.K. (1984). A new polynomial time algorithm for linear programming, Combinatorica4(4): 373–395.
- Kis, T. (2005). A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, Mathematical Programming103(3): 515–139.
- Leachman, R.C. (1983). Multiple resource leveling in construction systems through variation of activity intensities, Naval Research Logistics Quarterly30(3): 187–198.
- Leachman, R.C., Dincerler, A. and Kim, S. (1990). Resource-constrained scheduling of projects with variable-intensity activities, IIE Transactions22(1): 31–39.
- Różycki, R. and Węglarz, J. (2012). Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines, European Journal of Operational Research218(1): 68–75.
- Waligóra, G. (2011). Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan, Computational Optimization and Applications48(2): 399–421.
- Waligóra, G. (2014). Discrete-continuous project scheduling with discounted cash inflows and various payment models—a review of recent results, Annals of Operations Research213(1): 319–340.
- Węglarz, J. (1976). Time-optimal control of resource allocation in a complex of operations framework, IEEE Transactions on Systems, Man and Cybernetics6(11): 783–788.