A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem
MetadataShow full item record
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
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..