Basit öğe kaydını göster

dc.contributor.authorBicakci, Papatya S.
dc.contributor.authorKara, Imdat
dc.contributor.authorSagir, Mujgan
dc.date.accessioned2021-05-31T10:12:20Z
dc.date.available2021-05-31T10:12:20Z
dc.date.issued2020
dc.identifier.issn2193-567Xen_US
dc.identifier.urihttp://hdl.handle.net/11727/5953
dc.description.abstractThis paper focuses on a make-to-order production system, where rejection of some orders is inevitable due to limited production capacity. In such a system, accepting all orders may cause overloads, order delays, and customer dissatisfaction. For this reason, firms tend to reject some orders. The order acceptance and scheduling problem is defined as deciding simultaneously which orders to be selected and how to schedule these selected orders. An extension of this problem with sequence-dependent setup times and release dates has been rarely studied, and the existing studies suggest that setup activities wait for the release date to be performed. However, in real production environments this may not be the case. Therefore, this paper examines the relationships between setup times and release dates considering the overall scheduling literature. Previous scheduling studies define two different relationships concerning setup times and release dates. One of them considers setup time is completely dependent on release date, and the other one claims that they are completely independent. In this paper, a new relationship is addressed to propound that setup time may be partially dependent on the release date. The paper also proposes a new mixed integer linear programming formulation withO(n(2)) binary decision variables andO(n(2)) constraints. It includes a detailed computational analysis by solving available instances in the literature, which suggests that existing formulation can solve the test problems to optimality with up to 10 orders in a given time limit. Our proposed formulation, however, can solve the test problems to optimality with up to 50 orders within the same time limit. According to the findings, our approach seems to be more suitable for real-life applications, and the proposed formulation is extremely faster than the existing one.en_US
dc.language.isoengen_US
dc.relation.isversionof10.1007/s13369-020-04759-1en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectOrder acceptanceen_US
dc.subjectSingle-machine schedulingen_US
dc.subjectOrder rejectionen_US
dc.subjectMathematical formulationen_US
dc.subjectSequence-dependent setup timesen_US
dc.subjectRelease datesen_US
dc.titleSingle-Machine Order Acceptance and Scheduling Problem Considering Setup Time and Release Date Relationsen_US
dc.typearticleen_US
dc.relation.journalARABIAN JOURNAL FOR SCIENCE AND ENGINEERINGen_US
dc.identifier.volume46en_US
dc.identifier.issue2en_US
dc.identifier.startpage1549en_US
dc.identifier.endpage1559en_US
dc.identifier.wos000549244200001en_US
dc.identifier.scopus2-s2.0-85088113443en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergien_US


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

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

Basit öğe kaydını göster