A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect

Basit Öğe Kaydı
dc.contributor.authorEren, Tamer
dc.date.accessioned2020-06-25T17:48:32Z
dc.date.available2020-06-25T17:48:32Z
dc.date.issued2009
dc.departmentKırıkkale Üniversitesi
dc.description.abstractConventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the "learning effect". In this paper a m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes maximum lateness. A mathematical programming model is developed for the problem which belongs to NP-hard classes. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with 18 jobs and four machines. We also proposed heuristic approach for solving large jobs problems. (C) 2008 Elsevier Inc. All rights reserved.en_US
dc.identifier.citationclosedAccessen_US
dc.identifier.doi10.1016/j.amc.2008.12.003
dc.identifier.endpage190en_US
dc.identifier.issn0096-3003
dc.identifier.issue2en_US
dc.identifier.scopus2-s2.0-60349120916
dc.identifier.scopusqualityQ1
dc.identifier.startpage186en_US
dc.identifier.urihttps://doi.org/10.1016/j.amc.2008.12.003
dc.identifier.urihttps://hdl.handle.net/20.500.12587/4485
dc.identifier.volume209en_US
dc.identifier.wosWOS:000263597700004
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Incen_US
dc.relation.ispartofApplied Mathematics And Computation
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectParallel machine schedulingen_US
dc.subjectMaximum latenessen_US
dc.subjectLearning effecten_US
dc.subjectMathematical programming modelen_US
dc.titleA note on minimizing maximum lateness in an m-machine scheduling problem with a learning effecten_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect.pdf
Boyut:
199.61 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin/Full Text
İndir

Koleksiyon

WOS İndeksli Yayınlar Koleksiyonu
Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu