Basit öğe kaydını göster

dc.contributor.authorEren, Tamer
dc.date.accessioned2020-06-25T17:51:18Z
dc.date.available2020-06-25T17:51:18Z
dc.date.issued2010
dc.identifier.citationclosedAccessen_US
dc.identifier.issn0307-904X
dc.identifier.issn1872-8480
dc.identifier.urihttps://doi.org/10.1016/j.apm.2009.04.005
dc.identifier.urihttps://hdl.handle.net/20.500.12587/4792
dc.descriptionWOS: 000271598100004en_US
dc.description.abstractIn this study, a bicriteria m-machine flowshop scheduling with sequence-dependent setup times is considered. The objective function of the problem is minimization of the weighted sum of total completion time and makespan. Only small size problems with up to 6 machines and 18 jobs can be solved by the proposed integer programming model. Also the model is tested on an example. We also proposed three heuristic approaches for solving large jobs problems. To solve the large sizes problems up to 100 jobs and 10 machines, special heuristics methods is used. Results of computational tests show that the proposed model is effective in solving problems. (c) 2009 Elsevier Inc. All rights reserved.en_US
dc.language.isoengen_US
dc.publisherElsevier Science Incen_US
dc.relation.isversionof10.1016/j.apm.2009.04.005en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectm-Machine flowshop schedulingen_US
dc.subjectBicriteriaen_US
dc.subjectSequence-dependent setup timesen_US
dc.subjectInteger programming modelen_US
dc.subjectHeuristic methodsen_US
dc.titleA bicriteria m-machine flowshop scheduling with sequence-dependent setup timesen_US
dc.typearticleen_US
dc.contributor.departmentKırıkkale Üniversitesien_US
dc.identifier.volume34en_US
dc.identifier.issue2en_US
dc.identifier.startpage284en_US
dc.identifier.endpage293en_US
dc.relation.journalApplied Mathematical Modellingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US


Bu öğenin dosyaları:

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

Basit öğe kaydını göster