Utilization of Johnson's Algorithm for Enhancing Scheduling Efficiency and Identifying the Best Operation Sequence: An Illustrative Scenario

Abstract

This study's primary objective is the
enhancement of makespan optimization,
thereby minimizing unproductive time for
both machinery and tasks. The research
employs a case study methodology, focusing
on job scheduling within an Electronics
manufacturing facility, with a particular
emphasis on resource availability. It
implements Johnson's algorithm and its
expanded versions designed for both twomachine and three-machine scenarios within
the context of flow shop scheduling. The
principal aim is to identify optimal sequences
for scheduling. Within this framework, the
investigation computes idle time and
makespan metrics for individual machines,
utilizing task processing durations and in-out
timestamps. The findings reveal an optimal
idle time of 6.21 minutes and a makespan of
142.06 minutes for scenarios involving two
machines. Furthermore, the research extends
its analysis to scenarios with three machines,
where two machines are combined in each
group, resulting in an optimal idle time of
5.22 minutes for combined machine A2, 14.98
minutes for combined machine A3, and a
makespan of 192 minutes. This study
provides valuable insights applicable to
industries dealing with diverse machinery
and components, ultimately contributing to
improved scheduling and productivity.