Optimization Method of Flexible Job-shop Scheduling Based on Multiobjective Particle Swarm Optimization Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To solve flexible job-shop multiobjective scheduling problem, the optimization model was set up. Considering of the makespan, manufacturing cost and earliness/tardiness penalties, a crowding distance sorting based on multiobjective particle swarm optimization algorithm was proposed. With the elitism strategy, dominant individuals were preserved in evolution process. The shrink of the external population and update of the global best were achieved by the individuals’ crowding distance sorting in descending order. A small ratio mutation was introduced to enhance the diversity of solutions and the global searching capacity of the algorithm. Finally, the feasibility and validity of the method was proved by the simulation results of a flexible job-shop multiobjective scheduling in a workshop.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code