Application of Johnson’s algorithm in processing jobs through two-machine system

The purpose of this research is to effectively schedule jobs in a production company using heuristic Johnson’s algorithm. A popular pure water production factory, Iterlene industrial services limited (IISL) located at Effurun, Nigeria was investigated and it was noticed that different sizes of jobs (bottled water) are produced ranging from 25 cl, 50 cl, 60 cl, 75 cl, and 150 cl respectively, which are processed through the filling machine (FM1) and capping machine (CM2). In the order FM1CM2. Each job has to pass through the same sequence of operations. Jobs are assigned in such a way that a job is assigned on FM1 first and once processing is completed on FM1, it is assigned to CM2 and passing is not allowed. The idle time for the production of 500 bottles of water was estimated to be 1020 seconds (17.00 mins.). Johnson’s algorithm was applied to minimize the idle time for both FM1 and CM2 by determining the optimal sequence of the processed jobs. This was achieved within 780 seconds (13.00 mins.). Conclusively, the minimization of total elapsed time between the completion of first and last job was achieved. This would greatly improve productivity, effectiveness, and profitability at iterlene factory.