Szukana fraza: [Abstract = "This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem \(FJSP\). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems \(NP\-hard\). We will use genetic algorithms for the optimisation of this type of problems."]
Wyników: 1
AMCS, Volume 16 (2006)
Berkoune, Djamel Mesghouni, Khaled Rabenasolo, Besoa Korbicz, Józef - red. Uciński, Dariusz - red.
2006
artykuł