Coordinated Scheduling of Two-Agent Production and Transportation Based on Non-Cooperative Game

A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs of two agents compete for the processing position on a machine,and after the pro-cessed,they compete for the transport position on a transport vehicle to be trans-ported to two agents.The two agents have different objective functions.The objective function of the first agent is the sum of the makespan and the total trans-portation time,whereas the objective function of the second agent is the sum of the total completion time and the total transportation time.Given the competition between two agents for machine resources and transportation resources,a non-cooperative game model with agents as game players is established.The job pro-cessing position and transportation position corresponding to the two agents are mapped as strategies,and the corresponding objective function is the utility func-tion.To solve the game model,an approximate Nash equilibrium solution algo-rithm based on an improved genetic algorithm(NE-IGA)is proposed.The genetic operation based on processing sequence and transportation sequence,as well as the fitness function based on Nash equilibrium definition,are designed based on the features of the two-agent production and transportation coordination scheduling problem.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.When compared to heuristic rules such as the Longest Processing Time first(LPT)and the Shortest Processing Time first(SPT),the objective function values of the two agents are reduced by 4.3%and 2.6% on average.

Coordinated scheduling model for intermodal transit hubs based on GI/M^K/1 queuing system

Coordinated scheduling of multimode plays a pivotal role in the rapid gathering and dissipating of passengers in transport hubs. Based on the survey data, the whole-day reaching time distribution at transfer points of passengers from the dominant mode to the connecting mode was achieved. A GI/M K/1 bulk service queuing system was constituted by putting the passengers' reaching time distribution as the input and the connecting mode as the service institution. Through queuing theory, the relationship between average queuing length under steady-state and headway of the connecting mode was achieved. By putting the minimum total cost of system as optimization objective, the headway as decision variable, a coordinated scheduling model of multimode in intermodal transit hubs was established. At last, a dynamic scheduling strategy was generated to cope with the unexpected changes of the dominant mode. The instance analysis indicates that this model can significantly reduce passengers' queuing time by approximately 17% with no apparently increase in departure frequency, which provides a useful solution for the coordinated scheduling of different transport modes in hubs.

A Projection and Decomposition Approach for Multi-agent Coordinated Scheduling in Power Systems

Aiming at multi-agent coordinated scheduling problems in power systems under uncertainty,a generic projection and decomposition(P&D)approach is proposed in this letter.The canonical min-max-min two-stage robust optimization(TSRO)model with coupling constraints is equivalent to a concise robust optimization(RO)model in the version of mixed-integer linear programming(MILP)via feasible region projection.The decentralized decoupling of the non-convex MILP problem is realized through a dual decomposition algorithm,which ensures the fast convergence to a high-quality solution in the distributed optimization.Numerical tests verify the superior performance of the proposed P&D approach over the existing distributed TSRO method.

Cooperative Game Theory Based Coordinated Scheduling of Two-Machine Flow-Shop and Transportation

A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there is an initial scheduling order for processing jobs on the machines.The cooperative sequencing game models associated with TFS-PTCS problems are established with jobs as players and the maximal cost savings of a coalition as its value.The properties of cooperative games under two different types of admissible rearrangements are analysed.For TFS-PTCS problems with identical processing time,it is proved that,the corresponding games areσ_(0)-component additive and convex under one admissible rearrangement.The Shapley value gives a core allocation,and is provided in a computable form.Under the other admissible rearrangement,the games neither need to beσ_(0)-component additive nor convex,and an allocation rule of modified Shapley value is designed.The properties of the cooperative games are analysed by a counterexample for general problems.

Coordinated Planning Transmission Tasks in Heterogeneous Space Networks:A Semi-Distributed Approach

This paper studies the coordinated planning of transmission tasks in the heterogeneous space networks to enable efficient sharing of ground stations cross satellite systems.Specifically,we first formulate the coordinated planning problem into a mixed integer liner programming(MILP)problem based on time expanded graph.Then,the problem is transferred and reformulated into a consensus optimization framework which can be solved by satellite systems parallelly.With alternating direction method of multipliers(ADMM),a semi-distributed coordinated transmission task planning algorithm is proposed,in which each satellite system plans its own tasks based on local information and limited communication with the coordination center.Simulation results demonstrate that compared with the centralized and fully-distributed methods,the proposed semi-distributed coordinated method can strike a better balance among task complete rate,complexity,and the amount of information required to be exchanged.

Coordinate scheduling approach for EDS observation tasks and data transmission jobs

Electromagnetic detection satellite（EDS） is a type of Earth observation satellite（EOS）. Satellites observation and data down-link scheduling plays a significant role in improving the efficiency of satellite observation systems. However, the current works mainly focus on the scheduling of imaging satellites, little work focuses on the scheduling of EDSes for its specific requirements.And current works mainly schedule satellite resources and data down-link resources separately, not considering them in a globally optimal perspective. The EDSes and data down-link resources are scheduled in an integrated process and the scheduling result is searched globally. Considering the specific constraints of EDS, a coordinate scheduling model for EDS observation tasks and data transmission jobs is established and an algorithm based on the genetic algorithm is proposed. Furthermore, the convergence of our algorithm is proved. To deal with some specific constraints, a solution repairing algorithm of polynomial computing time is designed. Finally, some experiments are conducted to validate the correctness and practicability of our scheduling algorithms.

A framework for building energy management system with residence mounted photovoltaic

Efficient utilization of a residential photovoltaic (PV) array with grid connection is difficult due to power fluctuation and geographical dispersion. Reliable energy management and control system are required for overcoming these obstacles. This study provides a new residential energy management system (REMS) based on the convolution neural network (CNN) including PV array environment. The CNN is used in the estimation of the nonlinear relationship between the residence PV array power and meteorological datasets. REMS has three main stages for the energy management such as forecasting, scheduling, and real functioning. A short term forecasting strategy has been performed in the forecasting stage based on the PV power and the residential load. A coordinated scheduling has been utilized for minimizing the functioning cost. A real-time predictive strategy has been used in the actual functioning stage to minimize the difference between the actual and scheduled power consumption of the building. The proposed approach has been evaluated based on real-time power and meteorological data sets.

Improved resource allocation strategy in SU-CoMP network

Coordinated multi-point transmission and reception （CoMP） for single user, named as SU-CoMP, is considered as an efficient approach to mitigate inter-cell interference in orthogonal frequency division multiple access （OFDMA） systems. Two prevalent approaches in SU-CoMP are coordinated scheduling （CS） and joint processing （JP）. Although JP in SU-CoMP has been proved to achieve a great link performance improvement for the cell-edge user, efficient resource allocation （RA） on the system level is quite needed. However, so far limited work has been done considering JP, and most existing schemes achieved the improvement of cell-edge performance at cost of the cell-average performance degradation compared to the single cell RA. In this paper, a two-phase strategy is proposed for SU-CoMP networks. CS and JP are combined to improve both cell-edge and cell-average performance. Compared to the single cell RA, simulation results demonstrate that, the proposed strategy leads to both higher cell-average and cell-edge throughput.