Abstract
We consider a project consisting of n precedence- and resource-constrained, nonpreemptable activities which require renewable resources of two types: discrete and continuous ones. We assume m discrete resources are available and vector ri1 = [r i, r i2, …, r im], i = 1, …, n, determines the (fixed) discrete resource requirements of activity i. The total number of units of the discrete resource j, j = 1,…, m, is limited by R j . The single continuous, renewable resource can be allotted to activities in (arbitrary) amounts from the interval [0, 1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts E.H.L., J.H.M. Korst. 1989. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley, Chichester.
Aarts E.H.L., J.H.M. Korst, P.J.M. van Laarhoven. 1997. Simulated Annealing. In: Aarts E.H.L. and J.K. Lenstra ed. Local Search in Combinatorial Optimization}. John Wiley, Chichester, 91–120
Černy, V. 1985. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory And Applications 45, 41–51.
Glover F. 1989. Tabu Search — part 1. ORSA J. Computing. 1, 190–206.
Glover F. 1990. Tabu Search — part 2. ORSA J. Computing 2, 4-32.
Glover F., M. Laguna. 1993. Tabu Search. In: Reeves C.R., ed. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford.
Józefowska J., M. Mika, R. Różycki, G. Waligóra, J. Węglarz. 1998a. Local search metaheuristics for discrete-continuous scheduling problems. European Journal of Operational Research 107.
Józefowska J., M. Mika, R. Różycki, G. Waligóra, J. Węglarz 1998b. Scheduling precedence constrained nonpreemptable jobs on parallel machines with additional, discrete-continuous resources. Proc. Int. Conf. MMAR’98 to appear.
Józefowska J., and J. Węglarz. 1998. On a methodology for discrete-continuous scheduling. European Journal of Operational Research, 107.
Kirkpatrick S., C.D. Gelatt Jr., M.P. Vecchi. 1983. Optimization by simulated annealing. Science 220, 671–680.
van Laarhoven P.J.M., E.H.L. Aarts. 1987. Simulated Annealing: Theory and Applications. Reidel, Dordrecht.
Lawrence C., J.L. Zhou, A.L. Tits. 1995. Users guide for CFSQP Version 2.3. Available by e-mail: andre@eng.umd.edu.
Metropolis N., A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller. 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics 21, 1087–1092.
Michalewlcz Z. 1992. Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, Berlin — Heidelberg.
W’glarz J. 1982. Modelling and control of dynamic resource allocation project scheduling scheduling systems. In: S. G. Tzafestas (ed.), Optimization and Control of Dynamic Operational Research Models. North-Holland, Amsterdam.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Józefowska, J., Mika, M., Różycki, R., Waligóra, G., Węglarz, J. (1999). Project Scheduling under Discrete and Continuous Resources. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5533-9_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7529-6
Online ISBN: 978-1-4615-5533-9
eBook Packages: Springer Book Archive