DSpace@Çankaya

Customer order scheduling with job-based processing on a single-machine to minimize the total completion time

Basit öğe kaydını göster

dc.contributor.author Çetinkaya, Ferda Can
dc.contributor.author Yeloğlu, P.
dc.contributor.author Çatmakaş, H.A.
dc.date.accessioned 2022-03-31T13:20:53Z
dc.date.available 2022-03-31T13:20:53Z
dc.date.issued 2021
dc.identifier.citation Çetinkaya, Ferda Can; Yeloğlu, P.; Çatmakaş, H.A. (2021). "Customer order scheduling with job-based processing on a single-machine to minimize the total completion time", International Journal of Industrial Engineering Computations, Vol. 12, No. 3, pp. 273-292. tr_TR
dc.identifier.issn 1923-2926
dc.identifier.uri http://hdl.handle.net/20.500.12416/5227
dc.description.abstract 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. © 2021 by the authors; licensee Growing Science, Canada. tr_TR
dc.language.iso eng tr_TR
dc.relation.isversionof 10.5267/j.ijiec.2021.3.001 tr_TR
dc.rights info:eu-repo/semantics/openAccess tr_TR
dc.subject Customer Order Scheduling tr_TR
dc.subject Job-Based Processing tr_TR
dc.subject Mixed-Integer Linear tr_TR
dc.subject Order-Based Processing tr_TR
dc.subject Programming tr_TR
dc.subject Tabu Search tr_TR
dc.subject Total Completion Time tr_TR
dc.title Customer order scheduling with job-based processing on a single-machine to minimize the total completion time tr_TR
dc.type article tr_TR
dc.relation.journal International Journal of Industrial Engineering Computations tr_TR
dc.contributor.authorID 50129 tr_TR
dc.identifier.volume 12 tr_TR
dc.identifier.issue 3 tr_TR
dc.identifier.startpage 273 tr_TR
dc.identifier.endpage 292 tr_TR
dc.contributor.department Çankaya Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü tr_TR


Bu öğenin dosyaları:

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

Basit öğe kaydını göster