Single-Machine Order Acceptance and Scheduling Problem Considering Setup Time and Release Date Relations


Bicakci P. S., KARA İ., Sagir M.

Arabian Journal for Science and Engineering, cilt.46, sa.2, ss.1549-1559, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 46 Sayı: 2
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1007/s13369-020-04759-1
  • Dergi Adı: Arabian Journal for Science and Engineering
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, Metadex, Pollution Abstracts, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.1549-1559
  • Anahtar Kelimeler: Order acceptance, Single-machine scheduling, Order rejection, Mathematical formulation, Sequence-dependent setup times, Release dates, JOB-SELECTION, ALGORITHM, SHOP
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

© 2020, King Fahd University of Petroleum & Minerals.This 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 with O(n2) binary decision variables and O(n2) 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.