Optimizing Makespan and Minimizing Risk in Job Shop Scheduling: A Review

The job shop deals with customized product deliverables because of which the product mix is high, but the volume is low. For smooth functioning of the Job shop facility, it is important to plan for multiple factors. The review deals with the challenges that come with job shop scheduling (JSP) and provides predictive schedules to optimize some of the performance measures like makespan, makespan risk, stability risk and tardiness. Due to the high variety of products and unpredictable demand the scheduling complexity is substantial. This complexity further increases when we consider unpredictable machine breakdowns, increased setup times and absence of manpower. In order to come up with a robust and reliable scheduling plan the study will mainly focus on using buffered strategies (additional idle time), use of an Artificial Neural Network to correctly estimate the variable solutions for makespan and tardiness and using genetic algorithms to reduce and mitigate risk.

Authors

Institutions

Publication Details

Journal
The American Journal of Applied Sciences
Published
2025-09-25
DOI
https://doi.org/10.37547/tajas/volume07issue09-08
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing Makespan and Minimizing Risk in Job Shop Scheduling: A Review

Paritosh Shinde
The American Journal of Applied Sciences
Scheduling and Optimization Algorithms
article

Optimizing Makespan and Minimizing Risk in Job Shop Scheduling: A Review

Paritosh Shinde
article en

Abstract

The job shop deals with customized product deliverables because of which the product mix is high, but the volume is low. For smooth functioning of the Job shop facility, it is important to plan for multiple factors. The review deals with the challenges that come with job shop scheduling (JSP) and provides predictive schedules to optimize some of the performance measures like makespan, makespan risk, stability risk and tardiness. Due to the high variety of products and unpredictable demand the scheduling complexity is substantial. This complexity further increases when we consider unpredictable machine breakdowns, increased setup times and absence of manpower. In order to come up with a robust and reliable scheduling plan the study will mainly focus on using buffered strategies (additional idle time), use of an Artificial Neural Network to correctly estimate the variable solutions for makespan and tardiness and using genetic algorithms to reduce and mitigate risk.

The American Journal of Applied SciencesVol. 07(09)
Reckitt Benckiser (Netherlands) (NL)
Openalex Percentile: Top 63%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.