Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect

Basit Öğe Kaydı
dc.contributor.authorİşler, Mesut Cemil
dc.contributor.authorToklu, Bilal
dc.contributor.authorÇelik, Veli
dc.date.accessioned2020-06-25T18:06:31Z
dc.date.available2020-06-25T18:06:31Z
dc.date.issued2012
dc.departmentKırıkkale Üniversitesi
dc.description.abstractIn the literature, earliness/tardiness (E/T) problem was known as weighted absolute deviation problem, and both tardiness and earliness is very important performance criteria for scheduling problem. While total tardiness criteria provides adaptation for due date (ignoring results of earliness done jobs), it deals with only cost of tardiness. However this phenomenon has been started to change with just-in-time (JIT) production concept. On JIT production, earliness is as important as tardiness. The phenomenon of the learning effect has been extensively studied in many different areas of operational research. However, there have been a few studies in the general context of production scheduling such as flow-shop scheduling. This paper addresses the minimization of the total earliness/tardiness penalties under learning effects in a two-machine flow-shop scheduling problem. Jobs have a common due date. We present mathematical model to obtain an optimal schedule for a given job sequence. We also present heuristics that use genetic algorithm and tabu search, based on proposed properties. Furthermore, random search was used for showing the significance of the study by comparison purpose. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. The experimental results show that the performance of proposed approach is quite well, especially for the instances of large size.en_US
dc.identifier.citationclosedAccessen_US
dc.identifier.doi10.1007/s00170-011-3777-5
dc.identifier.endpage1137en_US
dc.identifier.issn0268-3768
dc.identifier.issn1433-3015
dc.identifier.issue9-12en_US
dc.identifier.scopus2-s2.0-84877123752
dc.identifier.scopusqualityQ1
dc.identifier.startpage1129en_US
dc.identifier.urihttps://doi.org/10.1007/s00170-011-3777-5
dc.identifier.urihttps://hdl.handle.net/20.500.12587/5224
dc.identifier.volume61en_US
dc.identifier.wosWOS:000307285400025
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer London Ltden_US
dc.relation.ispartofInternational Journal Of Advanced Manufacturing Technology
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSchedulingen_US
dc.subjectEarliness and tardinessen_US
dc.subjectCommon due dateen_US
dc.subjectFlow-shopen_US
dc.subjectHeuristicsen_US
dc.titleScheduling in a two-machine flow-shop for earliness/tardiness under learning effecten_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
Scheduling in a two-machine flow-shop for earliness tardiness under learning effect.pdf
Boyut:
195.11 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