Minimizing Maximum Lateness in a Single Machine Scheduling Problem with a Fixed Availability Constraint

Most studies conducted on scheduling problems are assumed that the machine is continuously available for processing jobs. This assumption is not true for several reasons including maintenance, machine breakdown, and etc. This study aimed to examine a single machine scheduling problem with a constant availability constraint period. It is assumed that the machine is not available during a predetermined period. The goal is minimizing maximum lateness of jobs. A highly efficient branch and bound (B&B) algorithm was presented to solve this problem which was able to solve problems with 5000 jobs.