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...
Main Authors: | Lim, Che Han, Moon, Seung Ki |
---|---|
Other Authors: | School of Mechanical and Aerospace Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/169242 |
Similar Items
-
Reactive Schedule Repair of Job Shops
by: Raheja, Amritpal Singh, et al.
Published: (2003) -
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) -
Flexible job shop scheduling using priority heuristics and genetic algorithm
by: Farashahi, Hamid Ghaani
Published: (2010) -
Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
by: Gao, Kai Zhou, et al.
Published: (2016)