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...

The TSP problem is one where a seller visits multiple destinations at the same time and they are only allowed to visit once. purpose of this shorten shortest distance, thereby minimizing cost. There various methods solve problem, including greedy algorithm, brute force hill climbing method, ant genetic algorithm. Each process in algorithm affected by several parameters, population size, maximum...

customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. delivery quality has several parameters such as deliver time window options, time window size, etc. in this paper we focus on one of these parameters, namely time window setting. it has a direct impact upon customer satisfaction and busi...