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 8 of 8 for “"Total Completion Time"”.
-
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. …
-
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) …
-
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 …
-
Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
… flowshop scheduling problem are to minimize the total completion time or formally called as makespan and tardiness. Artificial Bee Colony (ABC) algorithm is one of the methods used to solve the flowshop scheduling problem but only a few researches have been found using this method in this area. …
-
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 …
-
Optimal and Approximate Algorithms for the Multiple-Lots-per-Carrier Scheduling and Integrated Automated Material Handling and Lot Scheduling Problems in 300mm Wafer Fabs
… problem for the objective of minimizing the total completion time (MLCSP1). The wafer carrier is a front-opening unified pod (FOUP) that can hold a limited number of wafers. The problem is easy to solve when all the lots are of the same size. For the case of different lot sizes, we first …
-
The Application Of "crashing" A Project Network To Solve The Time/cost Tradeoff In Recapitalization Of The Uh-60a Helicopter
… asked to perform "more with less" in expeditious time while attempting to balance the inevitable challenge of the time/cost tradeoff. This is especially true within the Department of Defense today in prosecuting the Global War on Terrorism both in Afghanistan and Iraq. An unprecedented and …
-
Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity
… where each job has an associated processing time dependent on the agent performing it. The goal is to minimize the maximum total completion time (makespan) across all agents. This canonical scheduling problem appears naturally in a wide array of applications. Given its broad applicability and …