Job shop scheduling with buffer constraint

被引：0
|
作者：
Luo H. [1 ]
Chen H. [1 ]
Song X. [1 ]
Zhang J. [1 ]
机构：
[1] School of Mechanical Engineering, Southwest Jiaotong University, Chengdu
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2021年 / 27卷 / 10期
关键词：
Buffer constraints; Genetic algorithms; Job shop scheduling; Prescision;
D O I：
10.13196/j.cims.2021.10.012
中图分类号：
学科分类号：
摘要：
To solve the low accuracy problem for solving the job shop scheduling with cache constraints applied by existing heuristic algorithm, the solution extended from the job level to the process level was proposed, and the genetic algorithm was used to get a higher precision solution. To avoid premature convergence and falling into local optimum of traditional genetic algorithm, the algorithm was improved by combining the adaptive crossover mutation probability with improved crossover operator. The experimental results showed that the proposed algorithm could obtain higher precision solutions with the same buffer capacity. © 2021, Editorial Department of CIMS. All right reserved.
引用
收藏
页码：2880 / 2888
页数：8
相关论文
共 18 条
  • [1] AHMADIAN M M, SALEHIPOYR A, CHENG T., A meta-heuristic to solve the just-in-time job-shop scheduling problem, European Journal of Operational Research, 288, 1, pp. 14-29, (2021)
  • [2] JAMRUS T, CHIEN C F, GEN M, Et al., Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing[J], IEEE Transactions on Semiconductor Manufacturing, 31, 1, pp. 32-41, (2017)
  • [3] GU Jiuchun, JIANG Tianhua, ZHU Huiqi, Energy-saving job shop scheduling problem with multi-objective discrete grey wolf optimization algorithm[J/OL], Computer Integrated Manufacturing Systems, pp. 1-18
  • [4] LACOMME P, LARABI M, TCHERNEV N., Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles, International Journal of Production Economics, 143, 1, pp. 24-34, (2013)
  • [5] TOBA H., A Tight flow control for job-shop fabrication lines with finite buffers, Proceedings of the International Symposium on Semiconductor Manufacturing Conference, (1997)
  • [6] ZENG C K, TANG J F, FAN Z P, Et al., Scheduling of a job-shop problem with limited output buffers[J], Journal of Northeastern University, 52, 1, pp. 53-73, (2020)
  • [7] PRANZO M, PACCIARELLI D., An iterated greedy metaheuristic for the blocking job shop scheduling problem, Journal of Heuristics, 22, 4, pp. 587-611, (2016)
  • [8] LOUAQAD S, KAMACH O., Mixed integer linear programs for blocking and no wait job shop scheduling problems in robotic cells, International Journal of Computer Applications, 153, 10, pp. 1-7, (2016)
  • [9] BRUCKER P, HEITMANN S, JOHANN H, Et al., Job-shop scheduling with limited capacity buffers, OR Spectrum, 28, 2, pp. 151-176, (2006)
  • [10] WITT A, VOss S., Simple heuristics for scheduling with limited intermediate storage, Computers and Operations Research, 34, 8, pp. 2293-2309, (2005)
12