A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
Abstract
This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum completion time so called makespa
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894900480&doi=10.1016%2fj.apm.2013.07.038&partnerID=40&md5=f5d8b2e8b51f25bceb1a7ba4fdf6f0eahttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10386
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..