A two-phase iterative mathematical programming-based heuristic for a flexible job shop scheduling problem with transportation
In a flexible job shop problem with transportation (FJSPT), a typical flexible manufacturing system comprises transporters that pick up and deliver jobs for processing at flexible job shops. This problem has grown in importance through the wide use of automated transporters in Industry 4.0. In this...
Saved in:
Main Authors: | Lim, Che Han, Moon, Seung Ki |
---|---|
Other Authors: | School of Mechanical and Aerospace Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/169242 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A MILP model for flexible job shop scheduling problem considering low flexibility
by: Liu, Minzheng
Published: (2024) -
Deep reinforcement learning for dynamic scheduling of a flexible job shop
by: Liu, Renke, et al.
Published: (2022) -
Heuristics for scheduling in a flow shop with multiple processors
by: Brah, S.A., et al.
Published: (2013) -
Flexible job-shop scheduling via graph neural network and deep reinforcement learning
by: SONG, Wen, et al.
Published: (2023) -
Improved intelligent water drops optimization for single and multiple objective job shop scheduling
by: Ong, S.K., et al.
Published: (2014)