Optimal model and algorithm for flexible job-shop scheduling problem based on demand time window |
| |
| Authors: | ZENG Qiang YANG Yu WANG Xiao-lei and XING Qing-song |
| |
| Institution: | State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400044, China; Department of Industry Engineering, Henan Polytechnic University, Jiaozuo 454000,Henan, China;;State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400044, China;;State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400044, China; Department of Mechanical Engineering, North China Electric Power University, Baoding 071003,Hebei, China;State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400044, China; |
| |
| Abstract: | Aiming at the scheduling problem for jit delivery under the pulling type production, an optimal method for flexible job-shop scheduling problem (FJSP) based on demand time window is proposed. According to the demand time window of every workpiece, an optimal model for FJSP is constructed to maximize the average membership degree based on the completion time for every workpiece.Then, a tabu search algorithm based on multi-stage hybrid mutation is proposed and designed.To improve the convergence of the algorithm, inverse order mutation and gene segment swap mutation are used to find a good original solution, upon which gene swap mutation is used to find the optimal solution. The effectiveness of the proposed method is validated by applying to a multi-type and small-batch production manufacturing workshop. |
| |
| Keywords: | flexible job-shop scheduling demand time window tabu search algorithm multi-stage hybrid mutation |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
| 点击此处可从《保鲜与加工》下载免费的PDF全文 |
|
