Minimizing the total completion time for parallel machine scheduling with job splitting and learning
10.1016/j.cie.2016.05.001
Saved in:
Main Authors: | Wang, Chenjie, Liu, Changchun, Zhang, Zhi-hai, Zheng, Li |
---|---|
Other Authors: | INST OF OPERATIONS RESEARCH & ANALYTICS |
Format: | Article |
Language: | English |
Published: |
PERGAMON-ELSEVIER SCIENCE LTD
2019
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/155201 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Scheduling with job-splitting considering learning and the vital-few law
by: Liu, Changchun, et al.
Published: (2019) -
The early-tardy distinct due date machine scheduling problem with job splitting
by: HO KAH YUAN, BERNICE
Published: (2010) -
Job scheduling for maximum revenue on uniform, parallel machines with major and minor setups and job splitting
by: Chua, Geoffrey A., et al.
Published: (2023) -
SCHEDULING UNRELATED PARALLEL BATCH PROCESSING MACHINES WITH VARIOUS CONSTRAINTS
by: HU KANXIN
Published: (2023) -
Design and analysis of algorithms for solving a class of routing shop scheduling problems
by: LIU SHUBIN
Published: (2011)