Analysis for Maximal Optimized Penalty for the Scheduling of Jobs with Specific Due Date on a Single Machine with Idle Time

In the real world the Scheduling of Jobs in industries is provided without any idle time which is very tedious. Practically it becomes difficult when any of the spare part has started to malfunction and has to be changed in the machine then some idle time is needed in order to undergo the change. In this proposed work some amount of idle time is allotted to schedule the jobs in a single machine which includes three stages namely scheduling strategy, inserting idle time and optimizing the net penalty value of all the jobs.