in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

Today, in large projects such as constructing oil, gas and petrochemical refineries, it is inevitable to use modern management methods and project timing. On the other hand, in classic scheduling case, the focus is on balance between time and cost of carrying out projects, which in such a situation, one of possible solutions to shorten time of implementing project is to accelerate activities. T...

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...