Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 26 for “"Total Completion Time"”.
-
Energy-aware scheduling with day ahead electricity pricing
… non-preemptive single machine to minimize total tardiness and total energy cost; preemptive single machine to minimize total completion time and total energy cost; preemptive single machine with non-preemptive sequence-independent setup time to minimize total completion time and total …
-
Algorithms and complexity analyses for some combinational optimization problems
… A job may also have an arbitrary release time before which the preprocessing task is not available to be processed. The main objective in this dissertation is to minimize the total completion time or the makespan. Both the complexity and algorithmic issues of these problems are considered. …
-
Εξελικτικοί αλγόριθμοι για στοχαστικά προβλήματα διαχείρισης της εφοδιαστικής αλυσίδας
… schedule, however, is not determined solely by completion time, but also by additional factors such as energy consumption and operating cost. Within this context, two energy-efficient variants of the classical problem are proposed, incorporating both energy-related objectives and parameters …
-
UAS Teaming For Search And Rescue Applications
… through simulations measuring path length, total completion time, and target supply wait times across different SAR scenarios. UAS teaming configurations were tested and validated, considering leader speed, follower speed, supply drop times, and the number of followers as key parameters. …
-
Job scheduling on high performance computer systems: Complexity and algorithms
… problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) …
-
Scheduling jobs on two uniform parallel machines to minimize the makespan
… 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 …
-
Optimal Ship Maintenance Scheduling Under Restricted Conditions and Constrained Resources
… ship maintenance scheduling problems to minimize total completion time. The thesis consists of two major parts; the first corresponds to the first appended paper and deals with the computational complexity of mixed shop scheduling problems. A modified Genetic algorithm is proposed to solve the …
-
Dynamic Scheduling and Sequencing of Machines and Automated Guided Vehicles Using Genetic Algorithms
… guided vehicles in the system. A specific time frame was assumed for each job set to schedule machines and automated guided vehicles dynamically. The genetic algorithm was initially validated by bench mark problems from previous studies. Ten job sets previously scheduled by other …
-
Sustainability based decisions in manufacturing systems with production, reliability, and maintenance constraints
… decisions, and minimize energy consumption, total completion time and the failure probability of the machine.
-
Optimal and Suboptimal Scheduling of the Dual Resource Job Shop Problem with Multi-Skilled Workforce
… sequence-dependent setup and cleaning times, operation-type constraints, and worker qualification requirements. The approaches are benchmarked on 100 synthetic instances and evaluated on real production instances in terms of solution quality and computational efficiency. The benchmark …
-
A computation-implementation parallelization approach to time-sensitive applications
In this thesis, we study time-sensitive applications where it is important to minimize the completion time, i.e., time passing between receiving the instance and finishing the implementation of the solution. Different from the traditional approach, we are directly focusing on the minimization of …
-
Algorithms for Data Dissemination and Collection
… two hosts. We focus on improving the task completion time by re-routing the data through intermediate hosts and show that under certain network conditions we can reduce the total completion time by a factor of two. This is done by developing an approach for computing coordinated data …
-
Μίμηση της συμπεριφοράς αποικίας μυρμηγκιών για την ανάθεση και χρονοδρομολόγηση εργασιών σε πολύπλοκα δίκτυα υπολογιστών
… computational resources achieving to reduce the total completion time of the submitted jobs within a complex computer network. Also, it develops new integration mechanisms for the heterogeneous complex network systems while simultaneously it deals with the existing problems of the …
-
Programming frameworks for mobile sensing
… frameworks do not provide support for real-time fusing of data from motion and visual sensors in a simple manner, and no existing framework collectively utilizes sensors from multiple personal devices and personal IoT sensors, and (2) a lack of collaborative/distributed computing frameworks …
-
The permutation flowshop scheduling problem: analysis, solution procedures and problem extensions
… processed for each resource in each instant of time, i.e. establishes the schedules of the resources along the horizon under consideration. In order to determine the best schedule for the shop floor, both the specific constraints and the goal of the shop have to be considered. In these …
-
Collaborative Truck--Multi-Drone Delivery Systems: Scheduling and En-Route Operational Optimization
… of completed deliveries or to minimize the total completion time. Building on this foundation, this study examines truck–drone delivery systems across three scenarios: (1) multi-drone delivery with randomly located points, (2) multi-drone delivery on structured “proper” instances with …
-
Optimization of the distributed permutation flowshop scheduling problem
… flowshop scheduling problem is studied for total flow time and makespan objectives. Additional constraints of no-wait and heterogenous nature of the factories are also considered while solving DPFSP for more realistic problems. The problems are solved by using mathematical model, …
-
Integrated location and routing problems: Models, algorithms and applications
… cover all locations not visited, at the minimum total travel time. It is assumed that the USV is loaded with a scanning device that can cover a specified range around it. We propose to model this problem with a variant of the Shortest Covering Path Problem in which the USV can cover while …
-
Scaling a convolutional neural network based Flower counting application in a distributed GPU cluster
… is computationally expensive and it takes longer time to complete. To address the first challenge, experiments were run with both "ground truth" estimated using a modified version of the previous flower counter, and ground truth from manual annotation. To address the problem of long training time, …
-
Some topics on deterministic scheduling problems
… by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives. This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel …
Page 1 of 2