带有资源冲突的Seru在线并行调度算法

With the remarkably increase of mass customization, there comes the seru production system (SPS), which has become a hotspot in both the research and the application fields. This paper discusses the online parallel scheduling problem of serus with resource conflicts, which aims at scheduling serus that are generated with dynamic demands on limited space to minimize the total weighted completion time. First, we consider online parallel scheduling of serus without resource conflicts. Based on the average delayed shortest weighted processing time (AD-SWPT) algorithm, an adjustment parameter is introduced and an optimization algorithm with a constant competitive ratio is proposed. Then for online parallel scheduling of serus with resource conflicts, an α-average delayed shortest weighted processing time-improved (αAD-I) algorithm is proposed, whose competitive ratio is proved to be the same as the one without resource conflicts in special cases via instance reduction. Computational experiments are implemented to test and verify the superiority of our algorithm under both special instances and general instances.