ISSN: 2997-6197
Authors: Kathirvel A*
The algorithm The algorithm must decide how much to increase or modify the completion times of each job because the completion times in the original schedule are the earliest potential completion times. Since each cluster's jobs are all shifted by the same amount, the goal of this research can be satisfied by computing the best shift for each cluster. By inserting idle time for job clusters, inventory and overall completion time for single machine scheduling are minimized. According to the results of the numerical experiment, if idle time is properly included before jobs, Earliness and Tardiness cost values can be greatly decreased. Finding the best schedule to minimize the fines for being early or late is the issue under consideration here. The article suggests a method for fitting idle time in while still meeting deadlines. The suggested algorithm reduces the penalty by inserting idle time up until the point where further reduction of the objective function is not possible.
Keywords: Clustering; Earliness and Tardiness; Inventory Cost; Idle Time; Single Machine
