A bi-criteria single machine scheduling with rate-modifying-activity

dc.contributor.author	Ozturkoglu, Y.
dc.date.accessioned	2021-01-25T20:50:43Z
dc.date.available	2021-01-25T20:50:43Z
dc.date.issued	2013
dc.identifier.issn	13039709
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875987841&partnerID=40&md5=49946c768627fd571f499905fa2d5ef1
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10516
dc.description.abstract	In this paper, we consider a single machine scheduling problem with two criteria: minimizing both total flow time with total tardiness and minimize maximum tardiness with number of tardy jobs. Unlike the classical scheduling problems, we use a job positio
dc.language.iso	English
dc.publisher	Gazi University Journal of Science
dc.title	A bi-criteria single machine scheduling with rate-modifying-activity
dc.type	Article
dc.relation.firstpage	97
dc.relation.lastpage	106
dc.relation.volume	26
dc.relation.issue	1
dc.description.affiliations	Yaşar University, International Logistics Management, Bornova, Ïzmir, 35100, Turkey

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.