نتایج جستجو برای: finite scheduling

تعداد نتایج: 325343  

Journal: :CoRR 2013
Nikolai Krivulin

A new multidimensional optimization problem is considered in the tropical mathematics setting. The problem is to minimize a nonlinear function defined on a finite-dimensional semimodule over an idempotent semifield and given by a conjugate transposition operator. A special case of the problem, which arises in just-in-time scheduling, serves as a motivation for the study. To solve the general pr...

2011
Zvi Rosberg Ji Li Moshe Zukerman

We study flow scheduling to lightpaths in an optical flow switching network where flow arrivals are modeled as a time dependent Poisson process and their holding times are Pareto distributed. Scheduling decisions are taken at fixed time intervals (larger than 100 ms) in a central node and scheduled flows cannot be interrupted before their completion. The scheduling problem is represented as a d...

2006
Premaratne Samaranayake

Aircraft maintenance planning and scheduling constitute planning, control and execution of materials (spare parts), operations (inspection, disassembly and assembly activities) and resources (labour, machines, transport equipment, etc.). This is a complex problem due to large number of components involved at various planning and execution levels, and the size/nature of resource-intensive mainte...

2013
Gérard Verfaillie Cédric Pralet

This paper presents a framework dedicated to the modeling of deterministic planning and scheduling problems. This framework is based on the notions of timelines (evolutions of state variables and of resource levels), events which impact timelines, and constraints on and between events. Building it has been motivated by the observation that many real planning and scheduling problems involve a fi...

2003
Richard West Karsten Schwan Christian Poellabauer

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for realtime multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes str...

2004
Belinda M. Carter Joe Y.-C. Lin Maria E. Orlowska

Workflow technology has met with success in a variety of industries, although several limitations have emerged. One such drawback is the inflexibility of specification languages, including a lack of support for inter-task dependencies. Expressiveness of the specification language is believed to be a determining factor of workflows applicability and its industrial value as solution for process s...

Journal: :IEEE Trans. Systems, Man, and Cybernetics 1993
Zhen-Yu Zhao Masayoshi Tomizuka Satoru Isaka

This paper describes the development of a fuzzy gain scheduling scheme of PID controllers for process control. Fuzzy rules and reasoning are utilized on-line to determine the controller parameters based on the error signal and its first difference. Simulation results demonstrate that better control performance can be achieved in comparison with ZieglerNichols controllers and Kitamori’s PID cont...

2005
Amitava Majumdar Adam Birnbaum Dong Ju Choi Abhishek Trivedi Simon K. Warfield Kim K. Baldridge Petr Krysl

In the future, advanced biomechanical simulations of brain deformation during surgery will require access to multi-teraflop parallel hardware, supporting operating room infrastructure. This will allow surgeons to view images of intra-operative brain deformation within the strict time constraints of the surgical procedure typically on the order of minutes, multiple times during a six or eight ho...

1992
D. G. Messerschmitt E. A. Lee

Dataflow graphs that are strongly consistent and have finite complete cycles can always be scheduled statically and executed in bounded memory. Some strongly consistent graphs without finite complete cycles can also be executed in bounded memory. We have described a clustering technique that can identify such graphs and construct their schedules. However, some perfectly correct graphs may not f...

Ali Khosrozadeh ghomi Azadeh Divsalar Behnam Barzegar, Homayun Motameni

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید