Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Using A Mobile Device To Deliver Visual Schedules To Young Children With Autism, Leslie Nelson
Using A Mobile Device To Deliver Visual Schedules To Young Children With Autism, Leslie Nelson
UNLV Theses, Dissertations, Professional Papers, and Capstones
Young children with autism spectrum disorder (ASD) frequently display an inability to self-regulate (use materials appropriately and refrain from self-stimulatory behavior) and self-monitor (complete each step in a task before continuing to the next step) their behavior and therefore experience a great deal of failure within their respective school and home environments and frequently end up receiving instruction in restrictive, self-contained classrooms. Visual schedules have been used to help students with ASD self-regulate their behaviors in academic and community settings (NPDC, 2010; NSR, 2009). The purpose of this study was to determine whether high-tech visual schedules increase the self-regulation and …
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
UNLV Theses, Dissertations, Professional Papers, and Capstones
The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q2||Cmax using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T2) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is …
Simulated Annealing Approach To Flow Shop Scheduling, Sadhana Yellanki
Simulated Annealing Approach To Flow Shop Scheduling, Sadhana Yellanki
UNLV Theses, Dissertations, Professional Papers, and Capstones
Flow Shop Scheduling refers to the process of allotting various jobs to the machines given, such that every job starts to process on a machine n only after it has finished processing on machine n-1, with each job having n operations to be performed one per machine. To find a schedule that leads to the optimal utilization of resources, expects the schedule to finish in a minimum span of time, and also satisfy the optimality criterion set for the related scheduling problem is NP-Hard, if n > 2. In this thesis, we have developed an algorithm adopting a heuristic called Simulated …