Cite
HARVARD Citation
Gupta, D. et al. (2013). A Heuristic Approach to n×m Flow Shop Scheduling Problem in Which Processing Times Are Associated with Their Respective Probabilities with No-Idle Constraint. ISRN operations research. p. . [Online].