Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers. Early research towards this system proposed a st...

Full description

Bibliographic Details
Main Authors: Eka Pakpahan, Kenneth David Sumarna
Format: Article
Language:English
Published: Jurusan Teknik Industri, Fakultas Teknik Universitas Muhammadiyah Malang 2023-03-01
Series:Jurnal Teknik Industri
Subjects:
scheduling
heuristic algorithms
flexible machines
job shop
makespan
Online Access:https://ejournal.umm.ac.id/index.php/industri/article/view/21466

Internet

https://ejournal.umm.ac.id/index.php/industri/article/view/21466

Similar Items