Show simple item record

dc.contributor.authorEkici, Ali
dc.contributor.authorElyasi, Milad
dc.contributor.authorÖzener, Okan Örsan
dc.contributor.authorSarıkaya, M. B.
dc.date.accessioned2020-06-26T08:17:40Z
dc.date.available2020-06-26T08:17:40Z
dc.date.issued2019-11
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/10679/6651
dc.identifier.urihttps://www.sciencedirect.com/science/article/abs/pii/S0305054819301674
dc.description.abstractIn this paper, we analyze a variant of the unrelated parallel machine scheduling problem with the objective of minimizing the total tardiness and earliness in the presence of sequence-dependent setups, unequal release times, machine-job compatibility restrictions and workload balance requirements. This study is motivated by the production scheduling operations at a television manufacturer, Vestel Electronics. Vestel produces LCD/LED TVs and has a significant market share in the consumer electronics sector in Europe. TV manufacturing is planned based on a make-to-order strategy, and Vestel uses 15 assembly lines to produce 110 different product groups and 3817 different models. Once the orders are received, production scheduling is performed at the beginning of each month, and the goal is to satisfy the demand on time as much as possible. The decision maker has to consider several factors including job-assembly line compatibility, the release and due dates of the jobs and a workload balance among different assembly lines when forming the production schedule. To address this problem, we propose a wide range of heuristics including (i) a sequential algorithm, (ii) a tabu search algorithm, (iii) a random set partitioning approach, and (iv) a novel matheuristic approach utilizing the local intensification and global diversification powers of a tabu search algorithm. Through a computational study, we observe that all the proposed approaches not only significantly outperform the current practice but also provide solutions with around 5% less optimality gap compared to a benchmark algorithm in the literature.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofComputers & Operations Research
dc.rightsrestrictedAccess
dc.titleAn application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronicsen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatusPublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0002-9627-4780 & YÖK ID 124801) Ekici, Ali
dc.contributor.authorID(ORCID 0000-0002-9291-1877 & YÖK ID 21945) Özener, Örsan
dc.contributor.ozuauthorEkici, Ali
dc.contributor.ozuauthorÖzener, Okan Örsan
dc.identifier.volume111en_US
dc.identifier.startpage130en_US
dc.identifier.endpage140en_US
dc.identifier.wosWOS:000483411600010
dc.identifier.doi10.1016/j.cor.2019.06.007en_US
dc.subject.keywordsUnrelated parallel machinesen_US
dc.subject.keywordsSequence-dependent setupsen_US
dc.subject.keywordsTabu searchen_US
dc.subject.keywordsSet partitioningen_US
dc.subject.keywordsMatheuristicen_US
dc.identifier.scopusSCOPUS:2-s2.0-85067895382
dc.contributor.ozugradstudentElyasi, Milad
dc.contributor.authorMale3
dc.relation.publicationcategoryArticle - International Refereed Journal - Institutional Academic Staff and PhD Student


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page