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 7 of 7 for “"Makespan Minimization"”.
-
An analysis tableau and algorithm for flow-shop makespan minimization
… concepts in developing a heuristic algorithm for makespan minimization. Computer implementation of this algorithm revealed promising results when compared with several state of-the-art heuristic algorithms. The tableau can be conceived as a three-dimensional matrix with the first two indices …
-
Fair allocation of operations and makespan minimization for multiple robotic agents
… and efficient manner while also minimizing the makespan. We first present the Operation Trading Algorithm that generates allocations satisfying the DEQx (Duplicated Equitability up to any operation) fairness criterion while also guaranteeing an upper bound of 2 on the makespan for identical …
-
Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity
The makespan minimization problem involves assigning a set of n jobs to a set of m agents or machines, 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 …
-
Optimizing Integrated Continuous Biomanufacturing Throughput: Resource Constraints and Process Scheduling
… for resource constraints. To this end, makespan minimization models will be created to evaluate optimal process scheduling given resource constraints. The analysis results showed that, at this time, labor is not a constraint to the system’s available capacity and that improvements to …
-
Online packet buffering
… A well-known example of an online problem is makespan minimization in job scheduling. <br> <br>In order to measure how well it copes with the difficulty of incomplete knowledge about the input, we compare an online algorithm to an optimal offline algorithm that knows the whole input sequence …
-
Lot Streaming in Two-Stage Flow Shops and Assembly Systems
… to obtain optimal sublot sizes that minimize the makespan when the effect of learning reduces processing times, sublot-attached setup times, or, both. Then, we provide a general method to transform a large family of scheduling problems related to lot streaming in the presence of learning, to their …