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 “"Machine scheduling"”.
-
Algorithms and approximation schemes for machine scheduling problems
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Machine scheduling with changing processing times and rate-modifying activities
In classical scheduling models, it is normally assumed that the processing times of jobs are fixed. However, in the recent years, there has been a growing interest in models with variable processing times. Some of the common rationales provided for considering such models, is as follows: the …
-
A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling
<p>In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms …
-
Some combinational optimization problems on radio network communication and machine scheduling
… in this dissertation: network communication and machine scheduling. In the network communication area, the complexity of distributed broadcasting and distributed gossiping is studied in the setting of random networks. Two different models are considered: one is random geometric networks, the main …
-
Parallel Machine Scheduling in Manufacturing Systems: Impact of a Shared Resource and Multiple Stages
… Each stage consists of identical parallel machines. The processing time is assumed to include the setup time. This problem is also modeled as a mathematical program. Solution approaches and lower bounding procedures are discussed. I develop lower bounds and heuristic approaches and …
-
A unified approach to single machine scheduling : heavy traffic analysis of dynamic cyclic policies
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.
-
Cyclic best first search in branch-and-bound algorithms
… (B&B) algorithms. First, we solve a one machine scheduling problem with release and delivery times with the minimum makespan objective with a B&B algorithm using a variant of CBFS called CBFS-depth and a modified heuristic for finding feasible schedules. Second, we investigate the …
-
Application of genetic algorithms for irrigation water scheduling
A typical irrigation scheduling problem is one of preparing a schedule to service a group of outlets. These outlets may either be serviced sequentially or simultaneously. This problem has an analogy with the classical earliness/tardiness machine scheduling problems in operations research (OR). In …
-
Design of Scheduling Algorithms Using Game Theoretic Ideas
<p>Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling …
-
Generating cutting planes through inequality merging on multiple variables in knapsack problems
… problems, profit maximization applications and machine scheduling. Integer programs are computationally difficult and currently require exponential effort to solve. Adding cutting planes is a way of reducing the solving time of integer programs. These cutting planes eliminate linear relaxation …
-
Towards power of preemption on parallel machines
Classical scheduling models typically fall in either of two categories: those that allow interruption of the processing of jobs, and those that do not. In parallel machine environments, scheduling problems for models which allow parallel processing of jobs are typically easier to solve, in terms of …
-
Quantitative Methods For Select Problems In Facility Location And Facility Logistics
… problems. The first problem is a parallel machine scheduling problems that considers multiple unique characteristics including release dates, due dates, limited machine availability and job splitting. The objective of is to minimize the total amount of time required to complete work. A …
-
New neighborhood search algorithms based on exponentially large neighborhoods
… the TSP, VRP, and specific single and multiple machine scheduling problems.
-
Improving Virtual Machine I/O Performance in Cloud Environments via I/O Functionality Offloading
… of the applications running in the virtual machines.</p> <p>In this dissertation, we address the important problem of alleviating the negative impact of virtualization on I/O of the virtual machines. First, we show that virtual machine scheduling negatively impacts the TCP throughput in …
-
Estimating and Optimizing Throughput in an Aluminum Rolling Mill Using Capacity Modeling and Optimization Techniques
… hours lost to product changeover time. The scheduling of a CCL is considered a single machine scheduling problem (SMSP), and the introduction of transition coils is considered a sequence-dependent setup times (SDSTs) problem. This last portion of the paper will focus on the MIP application …
-
Approximation algorithms for stochastic scheduling on unrelated machines
… algorithms for an important class of machine scheduling problems. We study the family of preemptive minimum makespan scheduling problems where jobs have stochastic processing requirements and provide the first approximation algorithms for these problems when machines have unrelated …
-
Approximation algorithms for stochastic scheduling problems
… we study a broad class of stochastic scheduling problems characterized by the presence of hard deadline constraints. The input to such a problem is a set of jobs, each with an associated value, processing time, and deadline. We would like to schedule these jobs on a set of machines …
-
Some topics on deterministic scheduling problems
Sequencing and scheduling problems are motivated 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 …
-
Integer and Matrix Optimization: A Nonlinear Approach
… (b) rank constraints. Indeed, start-up costs in machine scheduling and financial transaction costs exhibit logical relations, while important problems such as reduced rank regression and matrix completion contain rank constraints. These constraints are commonly viewed as separate entities and …
Page 1 of 2