Yayın:
A flexible flowshop problem with total flow time minimization

Sadeleştirilmiş öğe sayfası
dc.contributor.authorÇakmak, Ergin
dc.contributor.authorErgin Çakmak
dc.contributor.authorSuna Kondakci
dc.contributor.orcid0000-0001-6327-3012
dc.date.accessioned2025-11-13T09:26:06Z
dc.date.issued2001-08-01
dc.identifier.doihttps://doi.org/10.1016/s0377-2217(00)00142-9
dc.identifier.endpage538
dc.identifier.issn0377-2217
dc.identifier.issue3
dc.identifier.openalexW2068727565
dc.identifier.startpage528
dc.identifier.urihttps://hdl.handle.net/11421/1131
dc.identifier.urihttps://doi.org/10.1016/s0377-2217(00)00142-9
dc.identifier.volume132
dc.language.isoen
dc.relation.ispartofEuropean Journal of Operational Research
dc.rightsopenAccess
dc.subjectMathematical optimization
dc.subjectMinification
dc.subjectUpper and lower bounds
dc.subjectComputer science
dc.subjectSchedule
dc.subjectJob shop scheduling
dc.subjectBranch and bound
dc.subjectFlow shop scheduling
dc.subjectFlow (mathematics)
dc.subjectMathematics
dc.titleA flexible flowshop problem with total flow time minimization
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5040280239

Dosyalar

Koleksiyonlar

Publications