Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Problem Solving, Control Methods, And Search (I.2.8) > Scheduling (I.2.8...)  
  1-10 of 17 Reviews about "Scheduling (I.2.8...)": Date Reviewed
  Scheduling analysis of imprecise mixed-criticality real-time tasks
Liu D., Guan N., Spasic J., Chen G., Liu S., Stefanov T., Yi W. IEEE Transactions on Computers 67(7): 975-991, 2018.  Type: Article

Many systems have several criticality levels: the safety-critical level, which is a higher criticality level, including all the tasks in which a deadline failure would provoke catastrophic effects on the system or even on humans; and m...

Nov 12 2018
  Forward delay-based packet scheduling algorithm for multipath TCP
Le T., Bui L. Mobile Networks and Applications 23(1): 4-12, 2018.  Type: Article

Multipath TCP (MPTCP) allows packets to be transmitted over multiple paths, “and hence utilizes the network resources more effectively than the traditional single-path [transmission control protocol, TCP].” However,...

Jun 8 2018
  A personal meeting scheduling agent
Shakshuki E., Hossain S. Personal and Ubiquitous Computing 18(4): 909-922, 2014.  Type: Article

This paper presents a methodology for the organization of meetings, which is rigorous and intuitive at the same time, comprehensive of both a formal description and an algorithm that can be developed in any programming language (the au...

Jun 24 2015
  Case studies of successful train crew scheduling optimisation
Kwan R. Journal of Scheduling 14(5): 423-434, 2011.  Type: Article

Scheduling crews for rail line operations is a difficult (nondeterministic polynomial-time (NP) hard) problem to solve considering the limited resources available and the many considerations imposed on the problem, mainly of a regulato...

May 14 2012
  A water-flow algorithm for flexible flow shop scheduling with intermediate buffers
Tran T., Ng K. Journal of Scheduling 14(5): 483-500, 2011.  Type: Article

The title of this paper does not hint at the cleverness of the research described. Tran and Ng study the traditional industrial engineering challenge of how to best schedule jobs (often processed in parallel) when there are several ste...

May 9 2012
  Scheduling for parallel processing
Drozdowski M., Springer Publishing Company, Incorporated, Dordrecht, the Netherlands, 2009. 386 pp.  Type: Book (978-1-848823-09-9)

This book deals with various aspects of scheduling for parallel processing, from theoretical models to technical foundations of scheduling in parallel systems, to algorithms. Thus, it will be useful not only to researchers in the field...

Sep 3 2010
  A comparison of five heuristics for the multiple depot vehicle scheduling problem
Pepin A., Desaulniers G., Hertz A., Huisman D. Journal of Scheduling 12(1): 17-30, 2009.  Type: Article

The authors compare five heuristics for the multiple depot vehicle scheduling problem of determining the least cost schedule for vehicles assigned to several depots, such that each timetabled task is accomplished exactly once by each v...

Jun 4 2009
  Evolutionary scheduling: a review
Hart E., Ross P., Corne D. Genetic Programming and Evolvable Machines 6(2): 191-220, 2005.  Type: Article

For those who need an update on research material that applies evolutionary computing methods to scheduling problems, this review paper is of substantial value. The last major survey was performed in 1999, when a major statement emerge...

Sep 27 2006
  A novel threshold accepting meta-heuristic for the job-shop scheduling problem
Lee D., Vassiliadis V., Park J. Computers and Operations Research 31(13): 2199-2213, 2004.  Type: Article

This paper describes a new list-based threshold algorithm (LBTA) for the job shop scheduling problem. The algorithm belongs to the family of job shop scheduling algorithms that start with a feasible solution, and, through a series of s...

Dec 1 2004
  Performance bounds of algorithms for scheduling advertisements on a Web page
Dawande M., Kumar S., Sriskandarajah C. Journal of Scheduling 6(4): 373-393, 2003.  Type: Article

Consider a set of n advertisements (called ads) A=A1, A2, ... , An, competing to be placed in a planning ho...

Nov 12 2004
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy