Optimal model and algorithm for flexible job-shop scheduling problem based on demand time window
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

曾强,杨育,王小磊,邢青松.应用需求时间窗的柔性作业车间调度优化模型[J].重庆大学学报,2011,34(2):86~94

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 15,2010
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code