Basit öğe kaydını göster

dc.contributor.authorOztop, H.
dc.contributor.authorTasgetiren, M.F.
dc.contributor.authorTursel Eliiyi, D.
dc.contributor.authorPan, Q.K.
dc.contributor.editor
dc.date.accessioned2021-01-25T20:48:42Z
dc.date.available2021-01-25T20:48:42Z
dc.date.issued2018
dc.identifier10.1007/978-3-319-95957-3_79
dc.identifier.issn03029743
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85051847462&doi=10.1007%2f978-3-319-95957-3_79&partnerID=40&md5=89d05618128ad9e45c4ea35b5fd879ea
dc.identifier.urihttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10020
dc.description.abstractPermutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency and customer satisfaction, st
dc.language.isoEnglish
dc.publisherLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.titleGreen Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
dc.typeConference Paper
dc.relation.firstpage753
dc.relation.lastpage759
dc.relation.volume10956 LNAI
dc.description.affiliationsDepartment of Industrial Engineering, Yasar University, Bornova, Turkey; Department of International Logistics Management, Yasar University, Bornova, Turkey; State Key Laboratory, Huazhong University of Science and Technology, Wuhan, China


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster