Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Sequencing And Scheduling (F.2.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 79 Reviews about "Sequencing And Scheduling (F.2.2...)": Date Reviewed   Distributed and sequential algorithms for bioinformatics Erciyes K., Springer International Publishing, New York, NY, 2015. 367 pp.  Type: Book (978-3-319249-64-3) The analysis of vast amounts of biological data has the potential to significantly impact and aid further development of bioengineering processes that can be used for medical purposes such as the treatment of diseases. Traditionally mo... Sep 6 2016   Optimal online scheduling with arbitrary hard deadlines in multihop communication networks Mao Z., Koksal C., Shroff N. IEEE/ACM Transactions on Networking 24(1): 177-189, 2016.  Type: Article This carefully written paper from Mao et al. makes important contributions to optimal online packet scheduling in the context of hard deadlines and a multihop wired network. A modification of the familiar earliest deadline first (EDF) ... Jul 26 2016   Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times Kodaganallur V., Sen A., Mitra S. Computers and Industrial Engineering 6710-19, 2014.  Type: Article Single machine scheduling problems have received significant attention in the relevant literature. For most practical industrial situations, explicit “consideration of sequence-dependent setup times” is extremely im... May 8 2015   A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints Yuan J., Li W., Yuan J. Theoretical Computer Science 457174-180, 2012.  Type: Article The authors of this paper analyze the scheduling of a set of precedence constrained tasks with equal lengths of time on two identical parallel machines. The information related to the precedence relations is only available when the job... Feb 6 2013   Scheduling on parallel identical machines with job-rejection and position-dependent processing times Gerstl E., Mosheiov G. Information Processing Letters 112(19): 743-747, 2012.  Type: Article Three new theorems, solving upper bounds for scheduling n jobs on m parallel identical machines, are derived in this paper. The scheduling problem is reduced to a restricted linear assignment probl... Nov 27 2012   Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters Jain N., Menache I., Naor J., Yaniv J.  SPAA 2012 (Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, Pittsburgh, PA, Jun 25-27, 2012) 255-266, 2012.  Type: Proceedings The nearly simultaneous emergence of cloud computing and big data analytics has brought on new sets of challenges. Organizations have started to replace their own infrastructure with large computing clusters hosted by cloud providers, ... Aug 17 2012   Complex scheduling (2nd ed.) Brucker P., Knust S., Springer Publishing Company, Incorporated, Berlin, Germany, 2012. 350 pp.  Type: Book (978-3-642239-28-1) This book is a joint production by two veteran researchers in the field of scheduling algorithms. This second edition comes six years after the first and adds close to 60 pages of new material. Most notable is the addition of informati... Jun 20 2012   An improved approximation algorithm for resource allocation Calinescu G., Chakrabarti A., Karloff H., Rabani Y. ACM Transactions on Algorithms 7(4): 1-7, 2011.  Type: Article The resource allocation problem finds the most profitable subset of tasks for a given limited resource. It is also known as the bandwidth allocation problem, resource constrained scheduling, or call admission control, and is nondetermi... Jan 18 2012   Introduction to scheduling Robert Y., Vivien F., CRC Press, Inc., Boca Raton, FL, 2009. 333 pp.  Type: Book (978-1-420072-73-0) According to the editors, the aim of this book is twofold: to introduce basic concepts in scheduling theory and to provide a precise account of the most recent and interesting developments in the area. It derives from invited talks at ... Oct 26 2010   Mapping filtering streaming applications with communication costs Agrawal K., Benoit A., Dufossé F., Robert Y.  SPAA 2009 (Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, Calgary, AB, Canada, Aug 11-13, 2009) 19-28, 2009.  Type: Proceedings The paper addresses the problem of mapping filtering streaming applications on parallel platforms, “with [an] emphasis on communication models and their impact.”... Jul 27 2010       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy