Open AccessJOB SHOP SCHEDULING CONSIDERING MAKESPAN, PENALTIES OF MACHINE IDLING, AND JOB OUT OF TIME
Author(s) -
Jaber S. Alzahrani
Publication year - 2019
Publication title -
international journal of research - granthaalayah
Language(s) - English
Resource type - Journals
eISSN - 2394-3629
pISSN - 2350-0530
DOI - 10.29121/granthaalayah.v7.i1.2019.1036
Subject(s) - job shop scheduling , tardiness , idle , mathematical optimization , computer science , job shop , scheduling (production processes) , job scheduler , genetic algorithm , flow shop scheduling , mathematics , embedded system , computer network , operating system , routing (electronic design automation) , queue
In this study, the job shop scheduling problem is analysed with respect to numerous objectives, and a multi-objective model is developed to optimise the makespan, maximum job earliness, maximum job tardiness, maximum machine idle time, total machine idling penalties, total job untimed penalties, and total penalties (multi-objective) using the genetic algorithm.