[13].P. Brandimarte, 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research.41, 157-183. 程欣悦(荆楚理工学院本科二年级:1293900389@qq.com)
(2007). Flexible job shop scheduling with tabu search algo- rithms. The International Journal of Advanced Manufacturing Technology, 32(5-6), 563-570.M. Saidi-mehrabad, P. Fattahi, Flexible job shop scheduling with tabu search algorithms, International Journal of Advanced Manufacturing Technology ...
[13].P. Brandimarte, 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research.41, 157-183.
tabu searchThe flexible job shop problem is an extension of the classical job shop scheduling problem which allows an operation to be performed by one ... M Mastrolilli,LM Gambardella - 《Journal of Scheduling》 被引量: 147发表: 2015年 Flexible job shop scheduling with tabu search algorithms ...
1. Introduction: the flexible job shop scheduling problem In the classical Job Shop (JS) scheduling problem [15] the process plan of a part consists of the sequence of the machines the part must visit: there is an a priori assignment of operations to machines. In the Flexible Job Shop (...
For the case considered, a two level approach has been devised, based on the decomposition in a routing and a job shop scheduling subproblem, which is obtained by assigning each operation of each job to one among the equivalent machines. Both problems are tackled by tabu search. Coordination ...
This paper studies the flexible double shop scheduling problem (FDSSP) that considers simultaneously job shop and assembly shop. It brings about the problem of scheduling association of the related tasks. To this end, a reinforcement learning algorithm w
The optimization problem addressed in this paper is an advanced form of the flexible job shop scheduling problem (FJSP) which also covers process plan flexibility and separable/non-separable sequence dependent setup times in addition to routing flexibility. Upon transforming the problem into an equivale...
Wodecki. Multi-gpu tabu search metaheuristic for the flexible job shop scheduling problem. In Advanced Methods and Applications in Com- putational Intelligence, volume 6 of Topics in Intelligent Engineering and Informatics, pages 43-60, 2014.Bożejko, W., Uchroński, M., Wodecki, M.: Multi...
It is concluded that the proposed algorithm is superior to the very recent algorithms in term of both search quality and computational efficiency. Keywords-flexible job shop scheduling problem; artificial bee colony; tabu search 展开 关键词: Pareto optimisation job shop scheduling search problems ...