Abstract:
In this study, consider three general flowshop scheduling
problems: (1) with the objective function of the total weighted tardiness
and the assumption of having ready times for jobs, (2) with the objective
function of the makespan and the constraints of time lags and (3) with
the makespan as objective and the constraints of the Sequence Dependent
Setup Times (SDST). We present a Mixed Integer Linear Programming (MILP)
model for each of them. The modeling formulations of this paper can generate
the non-permutation schedules and cover the missing operations assumption.
The implementation of the proposed formulations is demonstrated using
some numerical examples.
Subscribe Today 
