Abstract
This project adresses the single-machine scheduling problem to minimize total tardiness. In this case, each job has a completion time, a due date and a certain amount of resource. At any time, the total resource consumption must not outnumber the total resource supply. Otherwise, the machine has to be idle until the total resource supply is sufficient to process the job. That said, this p…