z-logo
open-access-imgOpen Access
An Evolutionary Approach for Solving the N-Jobs M-Machines Permutation Flow-Shop Scheduling Problem with Break-Down Times
Author(s) -
Armando Rosas-González,
Dulce-María Clemente-Guerrero,
SantiagoOmar CaballeroMorales,
Jorge-Carmen Flores-Juan
Publication year - 2013
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/14409-2488
Subject(s) - computer science , flow shop scheduling , permutation (music) , scheduling (production processes) , job shop scheduling , mathematical optimization , parallel computing , operations research , theoretical computer science , mathematics , operating system , schedule , physics , acoustics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom