Bou Ghosn, Steve
(Lebanese American University, 2011-11-14)
In this paper we investigate the use of two different heuristic techniques to the openshop scheduling problem and we make a comparison between them. The open-shop scheduling problem is NP hard and due to that it's very ...