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

MaRDI QIDQ3429258zbMATH OpenFDO

Authors Huaping Chen, Chunsheng Gu

Publication date 30 March 2007

zbMATH Keywords

schedulingasymptotic optimalpolicy of heuristicstochastic flexible flow shop scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• scientific article; zbMATH DE number 1418273
• On the asymptotic optimality of algorithms for the flow shop problem with release dates
• A note on weighted completion time minimization in a flexible flow shop

Cited in

(2)

• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

This page was built for publication: Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429258)