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

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

2011
Xabier Iturbe Khaled Benkrid Tughrul Arslan Mikel Azkarate-askasua Imanol Martinez

This paper describes a fault-tolerant scheduler that uses the AreaTime response Balancing algorithm (ATB) for scheduling real-time hardware tasks onto partially reconfigurable FPGAs. The architecture of the ATB scheduler incorporates fault-tolerance by design features; including Triple Modular Redundancy (TMR), parity protection of its memories and finite state machines, as well as spatial and ...

Journal: :Journal of the Operations Research Society of Japan 1987

Journal: :Transactions of the Institute of Systems, Control and Information Engineers 1997

2005

This paper discusses the use of the finite capacity planning model as a basis for a job-shop scheduling system. The suitability of this approach for constructing short term schedules with very short lead times is examined. This paper introduces a rule-based scheduling system whose operation, unlike previous monolithic schedulers, is based around distinct though interlinked processes. Scheduling...

1994
Norman Sadeh

A major challenge for research in production management is to develop new finite-capacity scheduling techniques and tools that (1) can account more precisely for actual production management constraints and objectives, (2) are better suited for handling production contingencies, and (3) allow the user to interactively manipulate the production schedule to reflect idiosyncratic constraints and p...

2008
Mohamed Ali Aloulou Federico Della Croce

We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...

Journal: :IEEE Trans. Robotics and Automation 2003
Jin Young Choi Spyros A. Reveliotis

The basic definition of the re-entrant line, which constitutes the typical abstraction for the formal modelling and analysis of the fab scheduling problem, considers only the job contest for the finite processing capacity of the system workstations, ignoring completely the effects and complications arising from additional operational issues like the finite buffering capacity of the system works...

Journal: :Oper. Res. Lett. 2008
Mohamed Ali Aloulou Federico Della Croce

We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...

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

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