Jobshop scheduling in stochastic environment
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    This paper discusses the jobshop scheduling under the circumstances of stochastic processing time, uncertain delayed time between two operations, induces the problem into a stochastic multi phrase decision by using scenario modeling and utilize the method of Lagrangian relaxation, scenario decomposition to solve the large scale problem. Finally, on the basis of modeling, calculating and analyzing of an example, the result shows that the method is efficient for stochastic jobshop scheduling.

    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