All Outputs (3)

Bulk scheduling with the DIANA scheduler (2006)
Journal Article
Anjum, A., McClatchey, R., Ali, A., & Willers, I. (2006). Bulk scheduling with the DIANA scheduler. IEEE Transactions on Nuclear Science, 53(6), 3818-3829. https://doi.org/10.1109/TNS.2006.886047

Results from the research and development of a Data Intensive and Network Aware (DIANA) scheduling engine, to be used primarily for data intensive sciences such as physics analysis, are described. In Grid analyses, tasks can involve thousands of comp... Read More about Bulk scheduling with the DIANA scheduler.

A variable neighbourhood search algorithm for job shop scheduling problems (2006)
Journal Article
Sevkli, M., & Aydin, M. E. (2006). A variable neighbourhood search algorithm for job shop scheduling problems. Lecture Notes in Artificial Intelligence, 3906 LNCS, 261-271. https://doi.org/10.1007/11730095_22

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood within a local search is carried out. In this paper, a variable neighbourh... Read More about A variable neighbourhood search algorithm for job shop scheduling problems.

A forward look at computational support for conceptual design (2006)
Journal Article
Miles, J., Hall, L., Noyes, J., Parmee, I., & Simons, C. (2006). A forward look at computational support for conceptual design. Lecture Notes in Artificial Intelligence, LNCS, volume 4200, 492-499. https://doi.org/10.1007/11888598_44

Future research needs for computational support for conceptual design are examined. The material is the result of the work of a so called design cluster. The cluster has, through a series of workshops, defined what it believes are the salient areas i... Read More about A forward look at computational support for conceptual design.