检索结果-内蒙古大学图书馆

A distributed scheduling and shop floor control method

COMPUTERS & INDUSTRIAL ENGINEERING 1996年第3-4期31卷 583-586页

作者： Kim, KH Bae, JW Song, JY Lee, HY KOREA INST MACHINERY & MET CHANG WONKYUNGNAMSOUTH KOREA

We suggest a market-like framework for scheduling and shop floor control in computer-controlled manufacturing systems where each resource agent and part agent acts like an independent profit maker. A part-resource negotiation procedure is suggested including price-based bid construction and price revising mechanism. Alternative routings for each production order are considered in scheduling and shop floor control. A simulation-based scheduling method is suggested to estimate the start time and the completion time of each task. We develop a prototype software which utilizes the object-oriented concept.

关键词： automated manufacturing systems shop floor control distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling BASED ON DUE DATES AND BUFFER PRIORITIES

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1991年第12期36卷 1406-1416页

作者： LU, SH KUMAR, PR UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801

We are motivated by the problem of scheduling a large semiconductor manufacturing facility, where jobs of wafers, each with a desired due date, follow essentially the same route through the manufacturing system, returning several times to many of the service centers for the processing of successive layers. Neglecting the randomness introduced by yield, such a system can be modeled as a nonacyclic flow line. In such systems, it is important to reduce the mean delay, or equivalently the mean work-in-process, as well as the variance of the delay. We analyze several distributed scheduling policies. We show that for a single nonacyclic flow line the first buffer first serve policy (FBFS), which assigns priorities to buffers in the order that they are visited, is stable, whenever the arrival rate, allowing for some burstiness, is less than the system capacity. Similarly, the last buffer first serve policy (LBFS), where the priority ordering is reversed, is also stable. However, not all buffer priority policies are stable, as witnessed by a counterexample. The well known earliest due date policy (EDD), where priority is based on the due date of a part, as well as another due date based policy of interest called the least slack policy (LS), where priority is based on the "slack" of a part, defined as the due date minus an estimate of the remaining delay, are also proved to be stable. For systems with many part types following different routes, we exhibit stable extensions of these policies. We also present simulations which confirm our intuition that LBFS may well be the best policy for minimizing the mean delay at high load factors, while LS may well be the best policy for minimizing the variance of the delay. Finally, some open problems are posed.

关键词： .ordering due dates distributed scheduling priority Arrival variance buffers manufacturing system scheduling policies service centers flow line serve policy FBFS LBFS

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling approach for dynamic evacuation networks

引用

MATHEMATICAL AND COMPUTER MODELLING OF DYNAMICAL SYSTEMS 2017年第6期23卷 554-569页

作者： Osman, Mojahid Saeed Ram, Bala Amer Univ Sharjah Dept Ind Engn Sharjah U Arab Emirates North Carolina A&T State Univ Dept Ind & Syst Engn Greensboro NC 27401 USA

The aim of this paper is to propose a novel distributed scheduling model for evacuation route scheduling from buildings and out of an affected area. The model is based on a hybrid approach that is spatio-temporal algorithm with optimization models as subproblems. The proposed distributed scheduling approach is an iterative process optimizing the one-step arrival of objects to each intermediate destination nodes at a time. To illustrate such an approach, we consider the problem of finding and scheduling evacuation paths from an urban building and out of a predetermined neighbourhood of the building on foot;the evacuation route involves pathways such as corridors, and stairs in buildings and road networks and sidewalks outside the building, there is a predefined set of exit points out of the target building and out of the road network serving the building. A well-known efficient heuristic algorithm is selected as a reference for comparative analysis and to illustrate the outperformance of the proposed approach in large-scale scenarios. The key results are the step-based optimal route schedules and the competitive evacuation time provided by the proposed distributed scheduling approach.

关键词： distributed scheduling evacuation hybrid network flows integer programming

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Low-Delay and Loss-Resilient Media Streaming With Network Coding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2014年第8期16卷 2294-2306页

作者： Sheikh, Anooq Muzaffar Fiandrotti, Attilio Magli, Enrico Politecn Torino Dept Elect & Telecommun I-10129 Turin Italy

Network coding (NC) has been shown to be very effective for collaborative media streaming applications. A pivotal issue in media streaming with NC lies in the packet scheduling policy at the network nodes, which affects the perceived media quality. In this paper, we address the problem of finding the packet scheduling policy that maximizes the number of media segments recovered in the network. We cast this as a distributed minimization problem and propose heuristic solutions that make the proposed framework robust to infrequent or inaccurate feedback information. Moreover, the proposed framework accounts for the properties of layered and multiple description encoded media to provide graceful quality degradation in case of packet losses or lack of upload bandwidth. Experimental results on a local testbed as well as PlanetLab suggest that our scheduling framework achieves better media quality, lower playback delay, and lower bandwidth consumption than a random-push scheme.

关键词： distributed scheduling media streaming network coding P2P

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling: a review of concepts and applications

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第18期48卷 5235-5262页

作者： Toptal, Ayseguel Sabuncuoglu, Ihsan Bilkent Univ Dept Ind Engn TR-06800 Ankara Turkey

distributed scheduling (DS) is an approach that enables local decision makers to create schedules that consider local objectives and constraints within the boundaries of the overall system objectives. Local decisions from different parts of the system are then integrated through coordination and communication mechanisms. distributed scheduling attracts the interest of many researchers from a variety of disciplines, such as computer science, economics, manufacturing, and service operations management. One reason is that the problems faced in this area include issues ranging from information architectures, to negotiation mechanisms, to the design of scheduling algorithms. In this paper, we provide a survey and a critical analysis of the literature on distributed scheduling. While we propose a comprehensive taxonomy that accounts for many factors related to distributed scheduling, we also analyse the body of research in which the scheduling aspect is rigorously discussed. The focus of this paper is to review the studies that concern scheduling algorithms in a distributed architecture, not, for example, protocol languages or database architectures. The contribution of this paper is twofold: to unify the literature within our scope under a common terminology and to determine the critical design factors unique to distributed scheduling and in relation to centralised scheduling.

关键词： distributed scheduling heterarchical systems hierarchical systems agents decomposition

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling Scheme for Video Streaming over Multi-Channel Multi-Radio Multi-Hop Wireless Networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2010年第3期28卷 409-419页

作者： Zhou, Liang Wang, Xinbing Tu, Wei Muntean, Gabriel-Miro Geller, Benoit ENSTA ParisTech Lab UEI Paris France Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China Nokia Siemens Networks Shanghai Peoples R China Dublin City Univ Network Innovat Ctr Dublin 9 Ireland

An important issue of supporting multi-user video streaming over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resources while, at the same time, to meet each video's Quality of Service (QoS) requirement. In this work, we study the problem of video streaming over multi-channel multi-radio multi-hop wireless networks, and develop fully distributed scheduling schemes with the goals of minimizing the video distortion and achieving certain fairness. We first construct a general distortion model according to the network's transmission mechanism, as well as the rate distortion characteristics of the video. Then, we formulate the scheduling as a convex optimization problem, and propose a distributed solution by jointly considering channel assignment, rate allocation, and routing. Specifically, each stream strikes a balance between the selfish motivation of minimizing video distortion and the global performance of minimizing network congestions. Furthermore, we extend the proposed scheduling scheme by addressing the fairness problem. Unlike prior works that target at users' bandwidth or demand fairness, we propose a media-aware distortion-fairness strategy which is aware of the characteristics of video frames and ensures maxmin distortion-fairness sharing among multiple video streams. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

关键词： multi-channel multi-radio video transmission distributed scheduling QoS fairness

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling OF TASKS WITH DEADLINES AND RESOURCE REQUIREMENTS

引用

IEEE TRANSACTIONS ON COMPUTERS 1989年第8期38卷 1110-1123页

作者： RAMAMRITHAM, K STANKOVIC, JA ZHAO, W UNIV MASSACHUSETTS DEPT COMP & INFORMAT SCIAMHERSTMA 01003

A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource requirements in a distributed system. When a task arrives at a node, the local scheduler at that node attempts to guarantee that the task will complete execution on that node before its deadline. If the attempt fails, the scheduling components on individual nodes cooperate to determine which other node in the system has sufficient resource surplus to guarantee the task. Simulation studies are performed to compare the performance of these algorithms with respect to each other as well to two baselines. The first baseline is the noncooperative algorithm where a task that cannot be guaranteed locally is not sent to any other node. The second is an (ideal) algorithm that behaves exactly like the bidding algorithm but incurs no communication overheads. The simulation studies examine how communication delay, task laxity, load differences on the nodes, and task computation times affect the performance of the algorithms. The results show that distributed scheduling is effective even in a hard real-time environment and that the relative performance of these algorithms is a function of the system state

关键词： Deadlines distributed scheduling Real-time systems Resource Constraints Simulation studies

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling with efficient collision detection for end-to-end delay optimization in 6TiSCH multi-hop wireless networks

引用

ANNALS OF TELECOMMUNICATIONS 2019年第5-6期74卷 239-255页

作者： Hosni, Ines Univ Tunis El Manar Natl Engn Sch Tunis Commun Syst Lab LR-99-ES21 Tunis 1002 Tunisia Jouf Univ Coll Comp & Informat Sci Sakakah Saudi Arabia

It is expected that the IEEE 802.15.4e-TSCH designed for wireless industrial sensor networks will be used in IoT systems. This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. Since many applications may require low end-to-end delay (e.g., alarms), we propose here a distributed algorithm to schedule the transmissions while upper bounding the end-to-end source-sink delay. Our strategy constructs stratums, regrouping all the nodes with the same depth in the DODAG Destination Oriented Directed Acyclic Graph constructed by RPL. Then, different time-frequency blocks(bands) are assigned deterministically to each stratum. By appropriately tuning the size of each block and chronologically organizing them, we are able to guarantee any packet is delivered along the path length to the border router before the end of the slotframe. We also provide self-healing mechanism to detect and alleviate local collisions. Experiments on a large-scale testbed prove the relevance of this approach to reduce the end-to-end delay while minimizing the number of collisions, prejudicial to the reliability in multihop networks.

关键词： IEEE 802.154-TSCH End-to-end delay Self-healing distributed scheduling Autonomous Large-scale experiments

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for reactive maintenance of complex systems

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS 2008年第2期38卷 269-273页

作者： Wang, Chun Ghenniwa, Hamada H. Shen, Weiming Univ Western Ontario Dept Elect & Comp Engn London ON N6A 5C2 Canada NRC IMTI London N6G 4X8 England

This correspondence presents a distributed scheduling algorithm for reactive maintenance of complex systems. The algorithm uses an iterative bidding procedure to assign operations of maintenance jobs to engineers with partially overlapped skill sets. In each round, an unassigned operation is selected based on the overlapping degree of engineers' skill sets on the operation and the operation's average processing time among capable engineers. Engineers' availability and cost information are used to determine the winner of an assignment. The effectiveness of this approach is demonstrated through a computational study. Prototype implementation and applications to real-world domains are discussed.

关键词： distributed scheduling multiagent system reactive maintenance

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling and Delay-Aware Routing in Multihop MR-MC Wireless Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第8期65卷 6330-6342页

作者： Cao, Xianghui Liu, Lu Shen, Wenlong Cheng, Yu Southeast Univ Sch Automat Nanjing 210018 Jiangsu Peoples R China IIT Dept Elect & Comp Engn Chicago IL 60616 USA

In multiradio multichannel (MR-MC) networks with significantly expanded network resource space, many existing scheduling/routing algorithms rely on a link-based network model and apply different heuristics in algorithm design to achieve/approximate throughput optimality. In this paper, using a tuple-based multidimensional conflict graph model, we establish a cross-layer framework, which facilitates systematically studying distributed scheduling and routing in multihop multipath MR-MC networks. In this framework, each tuple link is installed with a routing controller, which feeds controlled amounts of data to the tuple-link output queues for scheduling and transmission. We rigorously prove that, under a set of certain conditions, the network is queue stable in the mean sense under the distributed maximal scheduling policy. Based on Lyapunov optimization, we further propose a distributed delay-aware multipath routing method, which aims at minimizing the end-to-end delay of each commodity flow. Extensive simulation results demonstrate that the proposed joint scheduling/routing algorithm outperforms existing link-based single-path and multipath algorithms and tuple-based cross-layer control algorithm.

关键词： distributed delay-aware routing (DDAR) distributed scheduling multiradiomultichannel (MR-MC) networks queue stability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：