A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem

Thumbnail
Date
2019
Author
Tasgetiren, M.F.
Yuksel, D.
Gao, L.
Pan, Q.K.
Li, P.
Metadata
Show full item record
Abstract
No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. That is, once a job starts its proce
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082759822&doi=10.1016%2fj.promfg.2020.01.347&partnerID=40&md5=4ca94800d798465f42c4a11d39aa5670
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9863
Collections