نتایج جستجو برای: sequencing and scheduling
تعداد نتایج: 16856732 فیلتر نتایج به سال:
The CMU MIDI Toolkit supports the development of complex interactive computer music performance systems. Four areas supported by the system are: input handling, memory management, synchronization, and timing (scheduling and sequencing). These features are described and then illustrated by their use in two performance systems.
Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scalable static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between different degrees of execution speed and execution price, and at th...
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. Key-Words: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing. (Forthco...
One of the basic and significant problems that a shop or a factory manager encounters is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is just-in-time scheduling. Motivated by just-intime manufacturing, we consider the multi-objective problem. These objectives minimize total weighted tardiness, earliness and minimize total flow time with fuzzy paramete...
A reconfigurable manufacturing system (RMS) is an advanced system designed at the outset for rapid changes in its hardware and software components in order to quickly adjust its production capacity and functionally. Among various operational decisions, this study considers the scheduling problem that determines the input sequence and schedule at the same time for a given set of parts. In partic...
This paper addresses a scheduling problem motivated by scheduling of diffusion operations in the wafer fabrication facility. In the target problem, jobs arrive at the batch machines at different time instants, and only jobs belonging to the same family can be processed together. Parallel batch machine scheduling typically consists of three types of decisions – batch forming, machine assignment,...
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. KeyWords: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing.
| Code generation methods for DSP applications are hampered by the combination of tight timing constraints imposed by the performance requirements of DSP algorithms, and resource constraints imposed by a hardware architecture. In this paper, we present a method for register binding and instruction scheduling based on the exploitation and analysis of resource-and timing constraints. The analysis...
We study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problem of scheduling jobs with release dates on identical parallel machines, to minimize the sum of weighted completion times: Both preemptive and non-preemptive versions are analyzed. Using linear programming techniques, borrowed from the single machine c...
Planning or scheduling systems that handle tasks with uncertain durations might use an extension of the Simple Temporal Network with a distinction between controllable and contingent variables and constraints. Temporal consistency is then redefined in terms of Dynamic Controllability, which means the ability to decide the precise timing of tasks only at execution time, depending on observations...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید