Abstract
DNA computing is an alternative approach to performing computations. In general it is possible to design a series of biochemical experiments involving DNA molecules which is equivalent to making transformations of information. In classical computing devices electronic logical gates are elements which allow for storing and transforming information. Designing of an appropriate sequence or a net of “store” and “transform” operations (in a sense of building a device or writing a program) is equivalent to preparing some computations. In DNA computing the situation is analogous, and the main difference is that instead of electronic gates DNA molecules are used for storing and transforming information. From this follows that the set of basic operations is different in comparison to electronic devices but the results of using them may be similar. In this paper DNA based algorithms for solving some single machine with limited availability scheduling problems are presented. To our best knowledge it is the first attempt to solve scheduling problems by molecular algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman, L.: Molecular computations of solutions to combinatorial problems. Science 266 (1994) 1021–1024
Bläzewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer-Verlag, Berlin (1996)
Formanowicz, P.: Selected deterministic scheduling problems with limited machine availability. Pro Dialog 13 (2001) 91–105
Lee, C.-Y.: Machine scheduling with an availability constraint. Journal of Global Optimization 9 (1996) 395–416
Landweber, L.F., Baum E.B. (eds.): DNA Based Computers II. American Mathematical Society, (1999)
Lipton, R.J.: DNA solution of hard computational problems. Science 268 (1995) 542–545
Lipton, R.J., Baum, E.B. (eds.): DNA Based Computers. American Mathematical Society, (1996)
Ouyang, Q., Kaplan, P.D., Liu, S., Libchaber, A.: DNA solution of the maximal clique problem. Science278 (1997) 446–449
Pâun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin (1998)
Pinedo, M.:. Scheduling. Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs, New Jersey (1995)
Urbaniak, R.: New Models of Computation: DNA Computers and Quentum Computers (in Polish). Master thesis, Poznań University of Technology, Poznań (2002)
Watson, J.D., Crick, F.H.C.: A structure of deoxiribose nucleic acid. Nature 173 (1953) 737–738
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Błaźewicz, J., Formanowicz, P., Urbaniak, R. (2003). DNA Based Algorithms for Some Scheduling Problems. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_61
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive