Decentralized operational resource scheduling based on e-commerce bidding structure
A combat resource scheduling method based on e-commerce multi-round bidding structure is proposed for modern warfare mission planning,which enables multiple suppliers to coordinate task resource requests from multiple consumers in an asynchronous and decentralized manner.Each task is associated with a time window,and some tasks require multiple resource synchronization services of different types.The bidding is initiated by consumers,and suppliers initiate bids for various resource requests.Consumers adopt different strategies based on the three states of tasks in the bidding results,and send bid winning information to suppliers to execute tasks or initiate the next round of bidding.A mathematical model for supplier and consumer scheduling problems is established,and a two-stage heuristic solution method is proposed based on an improved saving algorithm and an adaptive large neighborhood search(ALNS)algorithm for the nondeterministic polynomial(NP)complete problem of supplier resource scheduling.The consumer model uses mixed integer linear programming to select the lowest cost bid combination to meet task requirements.The effectiveness of the proposed method is verified through case analysis.
e-commercetime windowsupplier scheduling problemsynchronization constraintadaptive large neighborhood search
NETL
NSTL
万方数据
