A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
Artikel
Artikel
Abstract The flexible job shop scheduling problem (FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem...
LCC LCC:Ocean engineering; TENDOk1lY2hhbmljYWwgZW5naW5lZXJpbmcgYW5kIG1hY2hpbmVyeQ~~Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access