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 84 for “"Makespan"”.
-
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 …
-
Job shop scheduling to minimize makespan with explicit material handling considerations
The efficient operation of a Flexible Manufacturing System (FMS) can be achieved by exploiting (i) Routing Flexibility and (ii) Scheduling Flexibility. Routing flexibility allows the selection of a machine on which an operation should be performed. Scheduling flexibility allows the determination of …
-
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 …
-
Stochastic flow shop scheduling
… we present new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between …
-
Optimal draining of fluid networks with parameter uncertainty
… in semiconductor wafer fabrication. The makespan of a fluid network is defined as the time to drain the system, when there is fluid present in the buffers initially. Based on this definition, the question of determining the allocation of resources so as to minimize the makespan of a fluid …
-
Stochastic flow shop scheduling
In this thesis we present new results for the makespan and the flowtime in a flow shop without intermediate storage between machines. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job which has finished processing at one …
-
Mixed integer linear programming approach for solving assembly scheduling problems
… objective of the problem is to reduce the total makespan (cumulative lead time) of production of final product. In addition to that, move sizes and batch sizes of operations are taken into consideration to see their impact on total makespan. Predetermined move size is used which facilitates batch …
-
Resource constrained scheduling problem at U.S. Naval Shipyards
… the overall length of each project, the "makespan," is the primary objective function of this thesis. This thesis uses a commercially available simulation package, @Risk, to analyze a realistic submarine repair schedule. Simulation is used to analyze uncertainty in the task durations and …
-
Bottleneck-based heuristic for permutation flowshop scheduling
… applied into this study in order to boost the makespan performance of the proposed heuristic. Two phases (bottleneck identification phase and initial sequence arrangement phase) were newly introduced and combined with the existing famous Nawaz, Enscore and Ham (NEH) insertion technique. There …
-
Scheduling of Wafer Test Processes in Semiconductor Manufacturing
… problem with the objective of minimizing the makespan required to test all wafer devices on a set of test stations. The heuristic approaches generate a sorted list of wafer devices as a dispatching sequence and then schedule the wafer lots on test stations in order of appearance on the list. …
-
Project Scheduling in the Presence of Productivity Functions
… to each activity in the project to minimize the makespan of the project. We consider projects whose activities' durations are defined by convex, non-increasing time-resource trade-off functions and whose activities are not pre-emptable (i.e., once some amount of resource has been allocated to an …
-
Models and algorithms for a flexible manufacturing system
… optimize various objectives such as minimizing makespan or maximizing machine utilization, or minimizing total flowtime. This problem is mathematically modeled, and heuristic algorithms are presented along with computational results for the case of minimizing the makespan.
-
Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
… 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. Therefore, ABC algorithm is proposed to solve …
-
Resource-Constrained Project Scheduling with Autonomous Learning Effects
… autonomous, intra-project learning on optimal makespan and problem difficulty. A learning extension is proposed to the standard RCPSP scheduling problem. Multiple parameters are considered, including project size, learning frequency, and learning intensity. A test instance generator is …
-
Job scheduling on high performance computer systems: Complexity and algorithms
… of the scheduling 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 …
-
Scheduling techniques that accommodate complexity: industrial practices and new approaches.
… leading to the calculation of a revised makespan. The resulting affected schedule vividly demonstrates the discrete consequences of these traits within the determined complexity strings while also aiding in identifying activities directly and indirectly affected by the traits. The thesis …
-
An integrated approach to the optimal sequencing of robot operations in a workcell
… total time needed to complete all jobs (known as makespan). The integrated approach consists of determining optimal robot task sequences using a branch and bound procedure. and a graphical simulation procedure to display the robots as they perform transport operation. The branch and bound …
-
Scheduling and Admission Control
… selected. If schedule quality is measured with makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same amount of work. We also show that the multiprocessor problem …
Page 1 of 5