Abstract
In this paper a complex scheduling problem is investigated and in particular a solution procedure is presented which is based upon a decomposition approach of the problem. Further research efforts will be devoted to the investigation of properties of the procedure, such as identification of the instances in which it finds the optimal solution, and to the computational testing of the procedure.
Preview
Unable to display preview. Download preview PDF.
References
Bianco, L., Dell’Olmo, P. and Speranza, M.G. (1991), Nonpreemptive Scheduling of Independent Tasks with Dedicated Resources, Technical Report 320, I.A.S.I.-C.N.R..
Blazewicz, J., Dell’Olmo, P., Drozdowski, M. and Speranza, M.G. (1991), Scheduling Independent Tasks on Three Dedicated Processors, Technical Report 31, Dept. of Quantitative Methods, University of Brescia.
Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco.
Golumbic, M.C. (1980), Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
Serafini, P. and Speranza, M.G. (1991), A Multistage Decomposition Approach for a Resource Constrained Scheduling Problem, Technical Report 24, Dept. of Quantitative Methods, University of Brescia.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 International Federation for Information Processing
About this paper
Cite this paper
Bianco, L., Dell’Olmo, P., Grazia Speranza, M. (1992). A decomposition approach to a scheduling problem with multiple modes. In: Davisson, L.D., et al. System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0113355
Download citation
DOI: https://doi.org/10.1007/BFb0113355
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55577-3
Online ISBN: 978-3-540-47220-9
eBook Packages: Springer Book Archive