Sharif Digital Repository

In this research a no-wait flowshop sequence dependent setup time scheduling problem with weighted earliness-tardiness penalties as the criterion (F_m |nwt,S_ijk |∑▒〖w_j^' E_j+w_j^" T_j 〗) is investigated. It is assumed that n jobs are assigned to a flowshop with m machines. The jobs are not allowed to wait between two successive machines according to no-wait requirement. Moreover each machine needs a setup time before processing a new job. The value of this setup time is dependent on the previous processed job on that machine.
A mixed integer linear programming model is proposed to solve the problem. As the problem is shown to be strongly NP-hard, a particle swarm optimization (PSO)... 

The present thesis is focused upon the flow shop sequence dependent group scheduling problem (FSDGS) with no wait assumption. Generally, production sequencing and scheduling is considered as one of the most important factors in productivity and cost saving of organizations. Therefore, determining an appropriate sequencing of groups and jobs according to the logical constraints is expected to improve the performance and productivity of the production system.
In this thesis, due to the importance and multiple applications of this problem, we will consider the FSDGS problem and propose new heuristic and metaheuristic algorithms to tackle this problem. Since the good performance of... 

This paper deals with no-wait open shop scheduling with sequence dependent setup times and release dates, minimizing total completion times. In spite of practibility of the problem, there is no substantial work dealing the problem. We present three formulation of the problem based on different decision variable paradigms and investigate some computational and efficacy aspects of the models. For large size problems, we first propose a novel encoding and decoding scheme of and present four particle Swarm Optimization (PSO)-based algorithms and four Tabu Search (TS)-base algorithms. To evaluate the performance of the algorithms we carry out two cpmputational experiments; in the first experiment...