Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time
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...
Saved in:
Main Authors: | Li, Haidong, Li, Zhen, Zhao, Yaping, Xu, Xiaoyun |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2020
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/gsb-pubs/2 https://www.tandfonline.com/doi/full/10.1080/01605682.2020.1718010?casa_token=n2bqFEKBSW8AAAAA%3ADM3iliOLhXNtbwI3ndT_eLvyyu1pvuoaQR5uOTZdbiNVZFQcwvJ6XvM6tGytkoVzGv6ZyvIxXZN-XA |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |
相似書籍
-
SCHEDULING UNRELATED PARALLEL BATCH PROCESSING MACHINES WITH VARIOUS CONSTRAINTS
由: HU KANXIN
出版: (2023) -
Stochastic Customer Order Scheduling on Heterogeneous Parallel Machines With Resource Allocation Consideration
由: Zhao, Yaping, et al.
出版: (2021) -
Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
由: Zhao, Yaping, et al.
出版: (2022) -
Minimizing the Makespan for Unrelated Parallel Machines
由: GUO, Yunsong, et al.
出版: (2007) -
Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
由: CHEN, Changyu, et al.
出版: (2022)