Abstract
There are many service systems (especially in reservation systems, electronic commerce, in tasks synchronized directly with the Internet), where each task has to be executed in some fixed range of time. Exceeding the term is disadvantageous and causes additional penalties. Therefore, it is necessary to establish optimal sequence of tasks (which minimizes penalties) and its starting times. It amounts to some job scheduling problem with earliness and tardiness. Because usually tasks are received in the distributed system (in the web), so to solve the presented problem we propose a parallel coevolutionary algorithm based on the Lamarck evolution and the island model of migration.
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
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)
Bożejko, W., Grabowski, J., Wodecki, M.: A block approach for single machine total weighted tardiness problem. Tabu search algorithm (to appear)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)
Hoogeveen, J.A., Van de Velde, S.L.: A branch and bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing 8, 402–412 (1996)
Lawler, E.L.: A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1, 331–342 (1977)
Lenstra, J.J., Rinnoy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)
Smith, W.E.: Various Optimizers for Single-Stage Production. Naval Research Logist Quartely 3, 59–66 (1956)
Wan, G., Yen, B.P.C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142, 271–281 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bożejko, W., Wodecki, M. (2005). Task Realization’s Optimization with Earliness and Tardiness Penalties in Distributed Computation Systems. In: Szczepaniak, P.S., Kacprzyk, J., Niewiadomski, A. (eds) Advances in Web Intelligence. AWIC 2005. Lecture Notes in Computer Science(), vol 3528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11495772_12
Download citation
DOI: https://doi.org/10.1007/11495772_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26219-0
Online ISBN: 978-3-540-31900-9
eBook Packages: Computer ScienceComputer Science (R0)