Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

Abstract

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the results are used in second step of the model, which determine a sequence between jobs by the aim of minimizing the total completion time. At the end a numerical example is presented and solved by the Lingo 8.0 mathematical software.