4,001 research outputs found

    Survey of dynamic scheduling in manufacturing systems

    Get PDF

    Multi-objective genetic algorithms for scheduling of radiotherapy treatments for categorised cancer patients

    Get PDF
    Abstract. This paper presents a multi-objective optimisation model and algorithms for scheduling of radiotherapy treatments for categorised cancer patients. The model is developed considering real life radiotherapy treatment processes at Arden Cancer Centre, in the UK. The scheduling model considers various real life constraints, such as doctors ’ rota, machine availability, patient’s category, waiting time targets, (i.e., the time when a patient should receive the first treatment fraction), and so on. Two objectives are defined: minimisation of the Average patient’s waiting time and minimisation of Average length of breaches of waiting time targets. Three Genetic Algorithms (GAs) are developed and implemented which treat radiotherapy patient categories, namely emergency, palliative and radical patients in different ways: (1) Standard-GA, which considers all patient categories equally, (2) KB-GA, which has an embedded knowledge on the scheduling of emergency patient category and (3) Weighted-GA, which operates with different weights given to the patient categories. The performance of schedules generated by using the three GAs is compared using the statistical analyses. The results show that KB-GA generated the schedules with best performance considering emergency patients and slightly outperforms the other two GAs when all patient categories are considered simultaneously. KB-GA and Standard-GA generated better performance schedules for emergency and palliative patient

    Mandelbrot in mathematica: guide to plotting the most famous instance of the mandelbrot set in mathematica

    Get PDF
    In this article the algorithm required for plotting the most famous picture of the Mandelbrot Set was presented and commented upon. In colouring the Mandelbrot Set, the key information required is the number of iterations after which the characteristic equation converges, given a particular starting point in the complex plane

    Antiferromagnetism in semiconducting KFe0.85Ag1.15Te2 single crystals

    Full text link
    We have synthesized single crystals of K1.00(3)Fe0.85(2)Ag1.15(2)Te2.0(1). The materials crystallizes in the ThCr2Si2 structure with I4/mmm symmetry and without K and Fe/Ag deficiencies, unlike in KxFe2-ySe2 and KxFe2-yS2. In contrast to theoretical prediction for higher Tc in KFe2Te2, KFe0.85Ag1.15Te2 is a semiconductor with long-range antiferromagnetic transition at TN = 35 K.Comment: 4 pages, 4 figure
    • …
    corecore