What is it about?
The problem of scheduling n jobs on m machines in an open shop environment is considered so that mean flow time becomes minimal. Since this problem is strongly NP-hard, different constructive and iterative heuristic algorithms are developed and discussed. Computational results are presented for problems with up to 50 jobs and 50 machines. The quality of the solutions is estimated by a lower bound for the corresponding preemptive open shop problem and by an alternative estimation of mean flow time.
Featured Image
Read the Original
This page is a summary of: A COMPARISON OF HEURISTICS FOR MEAN FLOW TIME OPEN SHOP SCHEDULING, IFAC Proceedings Volumes, January 2006, Elsevier,
DOI: 10.3182/20060517-3-fr-2903.00072.
You can read the full text:
Contributors
The following have contributed to this page
