Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem

Kongzhi Lilun Yu Yingyong/Control Theory and Applications

Volumn 23, Issue 4, 2006, Pages 523-525

  Chen, Hua Ping ^a   Gu, Chun Sheng ^a,b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b JIANGSU UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Asymptotic optimal; Policy of heuristic; Scheduling; Stochastic flexible Flow shop scheduling

Indexed keywords

ASYMPTOTIC OPTIMAL; POLICY OF HEURISTIC; PROBABILISTIC ANALYSIS; STOCHASTIC FLEXIBLE FLOW SHOP SCHEDULING;

HEURISTIC METHODS; PROCESSING;

SCHEDULING;

EID: 33845546787     PISSN: 10008152     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. GAREY M R, JHONSON D S, SETHI R. The complexity of flowshop and jobshop scheduling[J]. Mathematics of Operations Research, 1976, 1(2): 117-129.
2. PINEDO M. Scheduling: Theory, Algorithms and Systems[M]. Engle-wood Cliffs, NJ: Prentice Hall, 1995: 352-373.
3. ROTHKOPF M H. Scheduling with random service times[J]. Management Science, 1966, 12(9): 707-713.
4. CHOU C M. Asymptotic performance analyses of machine scheduling problems with release dates[D]. Evanston, Illinois: Northwestern University, 2001.
5. MOHRING R H, SCHULZ A S, UETZ M. Approximation in stochastic scheduling: the power of LP-based priority policies[J]. Journal of the ACM, 1999, 46(6): 924-942.
6. LIU H. Probabilistic analysis and practical algorithms for machine scheduling problems with or without release date constraints[D]. Evanston, Illinois: Northwestern University, 2001.