Bilgilendirme: Sürüm Güncellemesi ve versiyon yükseltmesi nedeniyle, geçici süreyle zaman zaman kesintiler yaşanabilir ve veri içeriğinde değişkenlikler gözlemlenebilir. Göstereceğiniz anlayış için teşekkür ederiz.

Browsing by Author "Catmakas, Hale Akkocaoglu"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Citation - Scopus: 10
    Customer Order Scheduling With Job-Based Processing on a Single-Machine To Minimize the Total Completion Time
    (Growing Science, 2021) Yeloglu, Pinar; Catmakas, Hale Akkocaoglu; Cetinkaya, Ferda Can; 50129; 01. Çankaya Üniversitesi; 06. Mühendislik Fakültesi; 06.04. Endüstri Mühendisliği
    This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order's completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders' total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times. (C) 2021 by the authors; licensee Growing Science, Canada