Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time

• المؤلفون الرئيسيون: Li, Haidong, Li, Zhen, Zhao, Yaping, Xu, Xiaoyun
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: Customer order scheduling; unrelated parallel machines; total weighted completion time; Operations and Supply Chain Management
• الوصول للمادة أونلاين: https://archium.ateneo.edu/gsb-pubs/2; https://www.tandfonline.com/doi/full/10.1080/01605682.2020.1718010?casa_token=n2bqFEKBSW8AAAAA%3ADM3iliOLhXNtbwI3ndT_eLvyyu1pvuoaQR5uOTZdbiNVZFQcwvJ6XvM6tGytkoVzGv6ZyvIxXZN-XA

This paper addresses the scheduling problem for customer orders on a set of unrelated parallel machines. Each order consists of multiple product types with various workloads that can be assigned to and processed by the machines. The objective is to minimise the total weighted completion time of all...