Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time , Part I : Constructive Algorithms

@inproceedings{Brsel2005HeuristicAF,
  title={Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time , Part I : Constructive Algorithms},
  author={Heidemarie Br{\"a}sel and Andr{\'e} Herms and Marc M{\"o}rig and Thomas Tautenhahn and Jan Tusch and Frank Werner},
  year={2005}
}
In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The quality of the solutions is estimated by a lower bound for the corresponding preemptive open shop problem and… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Basic Scheduling Problems

View 4 Excerpts
Highly Influenced

Two-Machine Open Shop Scheduling with Secondary Criterion

J.N.D. Gupta, F. Werner, G. Wulkenhaar
Intl. Trans. Oper. Res., • 2003
View 1 Excerpt

Approximation Algorithms for Shop Scheduling Problems with Minsum Objective

M. Queyranne, M. Sviridenko
Journal of Scheduling, • 2002
View 1 Excerpt

A hybrid genetic algorithm for the open shop scheduling problem

European Journal of Operational Research • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…