Job Shop scheduling with uncertain processing time and distinct due windows
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The Job Shop scheduling problem with distinct due windows is discussed. Uncertain processing time is also considered , which is denoted by triangular fuzzy number , and two fuzzy operators are introduced also. Fuzzy programming model is established for the scheduling problem. Based on the algorithmof maximizing the membership function of middle value , the fuzzy programming model is transformed into deterministic programming model and an effective genetic algorithm is presented also. A great deal of simulation results are given to illustrate the efficiency of the proposed model and the scheduling algorithm.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the th visitor Address:Room 908, Building A, 25th Teaching Building, Tianjin University, 92 Weijin Road, Nankai District, Tianjin Postcode:300072
Telephone:022-27403197 Email:jmsc@tju.edu.cn