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

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

Journal: :journal of industrial engineering, international 2010
h javanshir s.r seyedalizadeh ganji

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...

2002
Dan Henriksson Anton Cervin Karl-Erik Årzén

The paper presents TRUETIME, a MATLAB/Simulink-based simulator for real-time control systems. TRUETIME makes it possible to simulate the temporal behavior of multi-tasking real-time kernels containing controller tasks and to study the effects of CPU and network scheduling on control performance. The simulated real-time kernel is event-driven and can handle external interrupts as well as fine-gr...

2015
K. Chanthirasekaran M. A. Bhagyaveni Rama Parvathy

Multi-user multi-input multi-output (MU-MIMO) system has attracted the 4 generation wireless network as one of core technique for performance enrichment. In this system rate control is a challenging problem and another problem is optimization. Proper scheduling can resolve these problems by deciding which set of user and at which rate the users send their data. This paper proposes a new multi-p...

Journal: :پژوهش آب در کشاورزی 0
اژدر عُنّابی میلانی عضو هیئت علمی مرکز تحقیقات کشاورزی استان آذربایجان شرقی و دانشجوی دکتری دانشگاه تبریز. صدقعلی زمانی کارشناس ارشد مرکز تحقیقات کشاورزی استان آذربایجان شرقی.

proper use of water resources in arid and semi-arid regions is important and vital. this study was conducted to evaluate the effect of irrigation scheduling by various methods on crop yield and water use efficiency (wue) by wheat, and determining suitable irrigation-scheduling method for irrigation of wheat in saeedabad, tabriz. a field experiment was conducted with 10 irrigation treatments (i1...

2017
Sameer Sharma

This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are u...

Journal: :CoRR 2008
Mugurel Ionut Andreica

In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, I present a novel, heuristic, algorithm for scheduling files with divisible sizes on multiple disjoint paths, in order to maximize the total profit (the problem is equivalent to the multiple knapsack problem with divis...

2003
J. Zutt C. Witteveen

We discuss a distributed transport planning problem with competitive autonomous actors that carry out time-constrained pick-up delivery orders from customers. The agents have to find conflict-free routes to execute a series of orders they have accepted. Hatzack and Nebel [2] were the first to suggest that finding such a conflict-free schedule can be reduced to solving a job shop scheduling prob...

1994
R. Govindarajan Guang R. Gao Palash Desai

reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract In this paper we address the problem of minimizing buuer storage requirement in constructing rate-optimal compile-time schedules fo...

2009
Renaud Chicoisne Daniel Espinoza Marcos Goycoolea Eduardo Moreno Enrique Rubio

For the purpose of production scheduling, open pit mines are discretized into threedimensional arrays known as block models. Production scheduling consists in deciding which blocks should be extracted, when they should be extracted and how each extracted block should be processed. Blocks which are on top should be extracted first, and capacity constraints limit the production each time period. ...

2012
Cheng Zhong Zeng-Yan Qu Feng Yang Meng-Xiao Yin Xia Li

By distributing adaptively the data blocks to the processing cores to balance their computation loads and applying the strategy of “the extremum of the extremums” to select the data with the same keys, a cache-efficient and thread-level parallel algorithm for sorting Multisets on the multi-core computers is proposed. For the sorting Multisets problem, an aperiodic multi-round data distribution ...

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

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