Parallel and sequential evolutionary algorithms for the flow shop scheduling problem
Text / resource
Text / resource
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system (makespan) become a very difficult problem when there are more than two machines in the flow shop. Due both to its econ...
Idioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access