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

distributed project scheduling with information sharing in supply chains: part I - an agent-based negotiation model

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2005年第22期43卷 4813-4838页

作者： Lau, JSK Huang, GQ Mak, KL Liang, L Univ Hong Kong Dept Ind & Mfg Syst Engn Hong Kong Hong Kong Peoples R China Univ Sci & Technol China Sch Business Hefei Peoples R China

distributed project scheduling problem (DPSP) in supply chains is concerned with configuration, and scheduling of multiple projects in a network of independent and autonomous enterprises. Individual enterprises must collaborate with each other during two main stages: the configuration of a project-selection of contractors for performing project operations and the project scheduling-determining when the operations start. However, the collaboration is especially difficult because none of these enterprises holds the global information about the entire supply chain and all constituent enterprises. Instead, they have to capitalize whatever information is shared between them in order to solve their own local problems in a distributed and autonomous fashion. It is essential for the solution process to strike an overall balance between effectiveness and efficiency. The research, reported in this two-part paper, is aimed at proposing a negotiation-based algorithm for solving DPSP. Its emphasis is how to improve the convergence and quality of the solution by taking advantage of inter-enterprise information sharing especially the sharing of schedule flexibility information (SFI). The first part of this paper describes a new agent-based approach to DPSPs in supply chains while the second part will present detailed discussion on the theoretical and experimental analysis.

关键词： supply chain project scheduling distributed scheduling negotiation-based scheduling information sharing agent-based modelling

来源：评论

学校读者我要写书评

暂无评论

Improving the performances of distributed coordinated scheduling in IEEE 802.16 mesh networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2008年第4期57卷 2531-2547页

作者： Wang, Shie-Yuan Lin, Chih-Che Chu, Han-Wei Hsu, Teng-Wei Fang, Ku-Han Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan Cyberlink Corp Taipei 231 Taiwan

The IEEE 802.16 mesh network is a promising next-generation wireless backbone network. In such a network, setting the holdoff time for nodes is essential to achieving good performances of medium-access-control-layer scheduling. In this paper, we propose a two-phase holdoff time setting scheme to improve network utilization. Both static and dynamic approaches of this scheme are proposed, and their performances are compared against those of the original schemes. Our simulation results show that both approaches significantly increase the utilization of the control-plane bandwidth and decrease the time required to establish data schedules. In addition, both approaches provide efficient and fair scheduling for IEEE 802.16 mesh networks and generate good application performances.

关键词： distributed scheduling IEEE 802.16(d) mesh network

来源：评论

学校读者我要写书评

暂无评论

A generic formal model for the comparison and analysis of distributed job-scheduling algorithms in grid environment

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2019年 132卷 331-343页

作者： Ben Hafaiedh, Imene Univ Tunis El Manar UTM Higher Inst Comp Sci Tunis ISI Dept Software Engn & Informat Syst Tunis Tunisia

Nowadays, high-end Systems consist of thousands of individual devices which are in general heterogeneous. Grid computing environments are an example of high-end systems which are composed of many diverse and heterogeneous resources distributed within multiple geographical areas. The performance of such systems depends considerably on job scheduling and resource allocation algorithms. Indeed, to improve the global throughput of these environments, effective and efficient load balancing algorithms are fundamentally important. In this paper, we propose a completely distributed formal model for the description of grid architecture. Our model, is then parameterized to describe different job-scheduling algorithms in a completely parallel architecture. In particular, we focus on the modeling and description of distributed load-balancing algorithms. To reach this purpose, we define a set of parallel schedulers communicating together to achieve a given load-balancing policy. To show the applicability of our approach, we propose to specify and compare different well-known job-scheduling policies in grid environments. The formal verification of different properties of the studied protocols has been performed automatically using Model-checking and a set of performance analysis results are also provided. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Formal verification distributed scheduling Grid computing environment Load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

Concurrent Transmission Based on distributed scheduling for Underwater Acoustic Networks

引用

SENSORS 2019年第8期19卷 1871.-1871.页

作者： Zhang, Jun Lai, Hanhua Xiong, Yan South China Univ Technol Sch Elect & Informat Engn Guangzhou 510641 Guangdong Peoples R China Guangdong Univ Educ Dept Comp Sci Guangzhou 510303 Guangdong Peoples R China

Handshaking is a common technique used to avoid collisions in terrestrial and underwater content-based networks. However, due to the long propagation delay of the underwater acoustic channel, the conventional handshaking mechanism, which only allows one successful handshake and one pair of nodes to communicate per transmission cycle, becomes less effective in underwater acoustic networks. This paper proposes a new distributed scheduling method for underwater acoustic networks that supports multiple handshakes and concurrent transmissions in one transmission cycle for one-hop clusters. A deterministic scheduling algorithm was developed to optimize the sending sequence and time of the source nodes jointly so that the total data transmission time is shortened while avoiding collisions among multiple concurrent transmissions. The deterministic scheduling algorithm can also reduce the scheduling overhead and enables the synchronization of the data concurrent transmissions in a distributed manner via the standard two-way handshaking. Simulation results show that the proposed method outperforms several conventional underwater medium access control protocols in normalized throughput, packet delivery rate, average end-to-end delay, and average energy consumption.

关键词： underwater acoustic networks handshaking concurrent transmission distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling method based on hybrid optimization

引用

Zhongguo Jixie Gongcheng/China Mechanical Engineering 2006年第18期17卷 1908-1912页

作者： Bao, Zhenqiang Li, Changyi Zhou, Xin Yangzhou University Yangzhou 225009 China Shandong University of Technology Zibo 255049 China

In agile manufacturing environment, the extended organization model of workshop is not just a manufacturing workshop which comprises manufacturing resources gathered up in practical, but one with the resources distributed in different regions of enterprise alliance. This paper defined the concept of partial global optimized scheduling, which classified tasks into some groups according to their priority and then performs optimization. Direct to the conflicts between optimization and dynamic responding to urgent events during distributed scheduling, a hybrid scheduling mechanism, which integrated optimization scheduling and distributed dynamic scheduling, was presented. The structure of dynamic scheduling system was designed based on multi-Agent theory, and the running processes of different agents were shown. This paper also analyzed urgent events and methods to deal with them respectively. At the end, a instance was given WTO confirm the above-introduced mechanism.

关键词： distributed scheduling Hybrid scheduling Multi-Agent Partial global optimized scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed Charge scheduling of Plug-In Electric Vehicles Using Inter-Aggregator Collaboration

引用

IEEE TRANSACTIONS ON SMART GRID 2017年第1期8卷 331-341页

作者： Mukherjee, Joy Chandra Gupta, Arobinda Indian Inst Technol Kharagpur Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

Plug-in electric vehicles (PEVs) are emerging as an eco-friendly and cost-effective alternative to conventional vehicles driven by internal combustion engines. However, uncoordinated charging of a large number of PEVs may cause grid failure. Therefore, charge scheduling of PEVs is an important problem. However, the charge scheduling by a single aggregator does not scale well as the PEV population grows. We propose a distributed framework for efficient PEV charging with multiple aggregators in a city where a PEV raises its charging request to a specific aggregator, and each aggregator has partial information about others. The aggregators collaborate among themselves for scheduling PEVs for charging in different charging stations owned by it or others. In this paper, we formulate a bi-objective charge scheduling optimization problem that attempts to maximize the total profit of the aggregators while maximizing the total number of PEVs charged. We first prove that the problem is NP-complete. We then propose distributed offline and online algorithms to solve the problem, and present simulation results for some realistic traffic scenarios.

关键词： Plug-in electric vehicle charging inter-aggregator collaboration distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

A Non-Cooperative Game-Based distributed Beam scheduling Framework for 5G Millimeter-Wave Cellular Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第1期21卷 489-504页

作者： Zhang, Xiang Sarkar, Shamik Bhuyan, Arupjyoti Kasera, Sneha Kumar Ji, Mingyue Univ Utah Dept Elect & Comp Engn Salt Lake City UT 84112 USA Univ Utah Sch Comp Salt Lake City UT 84112 USA Idaho Natl Lab INL Wireless Secur Inst Idaho Falls ID 83415 USA

This paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

关键词： Games Interference Optimization Throughput Cellular networks Resource management Antennas mm-Wave networks network utility distributed scheduling Lyapunov stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Network configuration distributed production scheduling problem: A constraint programming approach

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2024年 188卷

作者： Ziadlou, Ghazal Emami, Saeed Asadi-Gangraj, Ebrahim Babol Noshiravani Univ Technol Dept Ind Engn Babol *** Iran

Nowadays, many massive factories are forced to distribute their products in several manufacturing units. This issue has caused the emergence of a novel category of problems called distributed production scheduling, which is vital in today's growing world. In this paper, the distributed production scheduling problem by considering network configuration with two echelons is addressed. The first and second echelon factories have different job configurations and have a hybrid flow shop and a flexible job shop environment, respectively. For this problem, A bi-objective mixed integer linear programming (MILP) model is presented to minimize the maximum completion time of jobs and transportation costs between the selected factories in two echelons, respectively. Consequently, the epsilon constraint method is used to deal with this bi-objective model. In addition, since distributed scheduling problems are classified as NP-Hard problems, it is very challenging to solve them for largesized instances. For this reason, a constraint programming model (CP) is also proposed. To evaluate the performance of the proposed MILP model and CP model, a total of 180 numerical instances are randomly generated in small, medium, and large sizes. The obtained results demonstrate the significant ability of the constraint programming approach in solving complex distributed scheduling problems even for large-sized instances with 30 jobs, 10 stages/operations for each job, 6 machines for each stage/operation, and 4 factories at each echelon in a reasonable time and proof that the CP model can outperform the MILP model in this problem.

关键词： distributed scheduling Multi-factory scheduling Network configuration Constraint programming Epsilon constraint method

来源：评论

学校读者我要写书评

暂无评论

A modified genetic algorithm approach for scheduling of perfect maintenance in distributed production scheduling

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2009年第7期22卷 1005-1014页

作者： Chung, S. H. Chan, Felix T. S. Chan, H. K. Hong Kong Polytech Univ Dept Ind & Syst Engn Hong Kong Hong Kong Peoples R China Univ E Anglia Norwich Business Sch Norwich NR4 7TJ Norfolk England

distributed scheduling (DS) problems have attracted attention by researchers in recent years. DS problems in multi-factory production are much more complicated than classical scheduling problems because they involve not only the scheduling problems in a single factory, but also the problems in the higher level, which is: how to allocate the jobs to suitable factories. It mainly focuses on solving two issues simultaneously: (i) allocation of jobs to suitable factories and (ii) determination of the corresponding production schedules in each factory. Its objective is to maximize system efficiency by finding an optimal plan for a better collaboration among various processes. However, in many papers, machine maintenance has usually been ignored during the production scheduling. In reality, every machine requires maintenance, which will directly influence the machine's availability, and consequently the planned production schedule. The objective of this paper is to propose a modified genetic algorithm approach to deal with those DS models with maintenance consideration, aiming to minimize the makespan of the jobs. Its optimization performance has been compared with other existing approaches to demonstrate its reliability. This paper also tests the influence of the relationship between the maintenance repairing time and the machine age to the performance of scheduling of maintenance during DS in the studied models. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： distributed scheduling Multi-factory production Production scheduling Perfect maintenance Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A distributed switch scheduling algorithm

引用

PERFORMANCE EVALUATION 2007年第9-12期64卷 1053-1061页

作者： Momcilovic, Petar Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48105 USA

The maximum weight matching algorithm is a high-performance scheduling algorithm for cross-bar switches. It is known that it performs optimally under heavy loads. However, its centralized nature and high computational complexity limit the algorithm's applicability. This paper presents a randomized algorithm for distributed switch scheduling that is capable of delivering high throughput. (c) 2007 Elsevier B.V. All rights reserved.

关键词： cross-bar switch distributed scheduling randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：