Dynamic single machine scheduling problem

Autor: Jobish Vallikavungal Devassia
Coautor(es): Francisco Angel Bello
This work is dealing with a single machine scheduling problem on the dynamic context. Sequence-dependent setup time and release time are the major constraints involved. The unknown release time, prior to the scheduling, leads to the dynamic nature of the problem. We present a mathematical model of the problem and implemented in order to find solutions by means of Gurobi and CPLEX for the problem and a comparative study is carried out. Key words: Single machine scheduling, sequence dependent setup time, MILP, release time