Minimizing the maximum flow time for flexible job shop problem with parallel machines
10.1080/21681015.2019.1646508
Saved in:
Main Authors: | Xiang, Nengjie, LIU CHANGCHUN |
---|---|
Other Authors: | INST OF OPERATIONS RESEARCH & ANALYTICS |
Published: |
Informa UK Limited
2019
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/158046 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Minimizing the total completion time for parallel machine scheduling with job splitting and learning
by: Wang, Chenjie, et al.
Published: (2019) -
A scheduling in flexible flow shop problem with unrelated parallel machines and sequence-dependent setup times
by: Jitti Jungwattanakit
Published: (2010) -
Planning in parallel machine shops and scheduling of flexible process plans in mould manufacturing shop
by: SARAVANAKUMAR MOHANRAJ
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) -
A MILP model for flexible job shop scheduling problem considering low flexibility
by: Liu, Minzheng
Published: (2024)