3.9 Conclusions
In this chapter, we have studied the problem of assessing resource usage in scheduling with incompatibilities. Contrary to what appears in the literature, we have proposed a local search algorithm which simultaneously takes into consideration three different objective functions, i.e., the minimization of the resource imbalance, and the minimization of the peak of resource usage and the makespan. Extensive experiments on synthetic data, as well as a comparison with lower bounds and known heuristics have been presented. The latter tests have been performed by adapting our algorithm to incorporate precedence constraints. What has emerged is that the proposed local search is able to find high quality solutions, especially if we consider the difficulty of dealing simultaneously with the three problems considered. Two case studies are presented at the end of the chapter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2006). Resource Levelling. In: Effective Resource Management in Manufacturing Systems. Springer Series in Advanced Manufacturing. Springer, London. https://doi.org/10.1007/1-84628-227-6_3
Download citation
DOI: https://doi.org/10.1007/1-84628-227-6_3
Publisher Name: Springer, London
Print ISBN: 978-1-84628-005-4
Online ISBN: 978-1-84628-227-0
eBook Packages: EngineeringEngineering (R0)