Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling

Página do item simplificado
dc.contributor.authorFuchigami, Helio Yochihiro
dc.contributor.authorSarker, Ruhul
dc.contributor.authorRangel, Socorro [UNESP]
dc.contributor.institutionFederal University of Goias (UFG)
dc.contributor.institutionUniversity of New South Wales (UNSW)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-12-11T16:52:44Z
dc.date.available2018-12-11T16:52:44Z
dc.date.issued2018-04-01
dc.description.abstractThe number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics were proposed and computationally implemented. Instances with up to 10 jobs and five machines are solved by the mathematical model in an acceptable running time (3.3 min on average) while the enumeration method consumes, on average, 1.5 s. The 10 constructive heuristics proposed show they are practical especially for large-scale instances (up to 100 jobs and 20 machines), with very good-quality results and efficient running times. The best two heuristics obtain near-optimal solutions, with only 0.6% and 0.8% average relative deviations. They prove to be better than adaptations of the NEH heuristic (well-known for providing very good solutions for makespan minimization in flow shop) for the considered problem.en
dc.description.affiliationFaculty of Sciences and Technology (FCT) Federal University of Goias (UFG)
dc.description.affiliationSchool of Engineering and Information Technology (SEIT) University of New South Wales (UNSW)
dc.description.affiliationInstituto de Biociências Letras e Ciências Exatas (IBILCE) Universidade Estadual Paulista (UNESP)
dc.description.affiliationUnespInstituto de Biociências Letras e Ciências Exatas (IBILCE) Universidade Estadual Paulista (UNESP)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.description.sponsorshipIdCNPq: 233654/2014-3
dc.description.sponsorshipIdCNPq: 443464/2014-6
dc.description.sponsorshipIdCNPq: 502547/2014-6
dc.description.sponsorshipIdCAPES: BEX 2791/15-3
dc.identifierhttp://dx.doi.org/10.3390/a11040043
dc.identifier.citationAlgorithms, v. 11, n. 4, 2018.
dc.identifier.doi10.3390/a11040043
dc.identifier.file2-s2.0-85044986141.pdf
dc.identifier.issn1999-4893
dc.identifier.scopus2-s2.0-85044986141
dc.identifier.urihttp://hdl.handle.net/11449/170867
dc.language.isoeng
dc.relation.ispartofAlgorithms
dc.relation.ispartofsjr0,217
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectFlow shop
dc.subjectHeuristics
dc.subjectJust-in-time scheduling
dc.titleNear-optimal heuristics for just-in-time jobs maximization in flow shop schedulingen
dc.typeArtigo

Arquivos

Pacote Original
Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
2-s2.0-85044986141.pdf
Tamanho:
907.83 KB
Formato:
Adobe Portable Document Format
Descrição:
Baixar

Coleções

Artigos