Stability Rescheduling of Virtual Cell Based on Backtracking Search Algorithm under New Order Insertion
- 10.2991/assehr.k.220504.139How to use a DOI?
- virtual cell; rescheduling; slack time; backtracking search algorithm
In view of the frequent adjustment of virtual cell scheduling plan brought about by the arrival of new orders, and considering the impact of rescheduling on production stability, this paper proposes an insertion rescheduling strategy based on slack time. The slack time is subdivided into idle time, partial Relaxation time and total relaxation time. Under the guidance of this strategy, considering the constraints of order delivery time, a nonlinear integer programming model with the goal of minimizing the maximum completion time and the minimum instability coefficient is constructed, and is solved by introducing a backtracking search algorithm of non-dominated sorting. Finally, the feasibility of the scheme proposed in this paper is verified through a numerical example study.
- © 2022 The Authors. Published by Atlantis Press SARL.
- Open Access
- This is an open access article distributed under the CC BY-NC 4.0 license.
Cite this article
TY - CONF AU - Wenmin Han AU - Junjie Fan AU - Chenglong You PY - 2022 DA - 2022/06/01 TI - Stability Rescheduling of Virtual Cell Based on Backtracking Search Algorithm under New Order Insertion BT - Proceedings of the 2022 8th International Conference on Humanities and Social Science Research (ICHSSR 2022) PB - Atlantis Press SP - 760 EP - 766 SN - 2352-5398 UR - https://doi.org/10.2991/assehr.k.220504.139 DO - 10.2991/assehr.k.220504.139 ID - Han2022 ER -