• DocumentCode
    387607
  • Title

    An objective decomposing method based on IBMDC for solving complex production scheduling problem

  • Author

    Liu, Min ; Dong, Ming-Yu ; Wu, Cheng

  • Author_Institution
    Dept. of Autom., Tsinghua Univ., Beijing, China
  • Volume
    3
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    1676
  • Abstract
    Complex scheduling problem is very difficult to solve. In this paper, an objective decomposing method based on IBMDC (intelligent method based on multilevel, decomposing, and coordination) for solving complex scheduling problem is proposed. Many other methods are powerless when the scale of complex scheduling problem is large. Decomposing global objective into local objectives is an effective way to reduce the problem scale. We use the rules extracted by neural networks to decompose due-date reasonably so as to minimize the weighted tardiness. The numerical simulations show that this method has a good performance.
  • Keywords
    knowledge acquisition; minimisation; neural nets; production control; production engineering computing; IBMDC; complex production scheduling problem; coordination; due-date decomposition; multilevel scheduling; neural networks; objective decomposition method; weighted tardiness minimization; Assembly systems; Automation; Intelligent agent; Intelligent structures; Job shop scheduling; Large-scale systems; Multiagent systems; Numerical simulation; Optimization methods; Production;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on
  • Print_ISBN
    0-7803-7508-4
  • Type

    conf

  • DOI
    10.1109/ICMLC.2002.1167499
  • Filename
    1167499