《2016 Mathematical Models of Flow Shop and Job Shop Scheduling Problems》.pdf

World Academy of Science, Engineering and Technology 31 2007 Mathematical Models of Flow Shop and Job Shop Scheduling Problems Miloš Šeda approximation and heuristic approaches (including tabu Abstract—In this paper, mathematical models for permutation search, simulated annealing, genetic algorithms, and ejection flow shop scheduling and job shop scheduling problems are chains) to scheduling manufacturing processes are presented proposed. The first problem is based on a mixed integer and discussed in [3]. programming model. As the problem is NP-complete, this model can In [11], a case with uncertain processing times is studied only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is and an approach based on fuzzy set theory is proposed. The suitable for solving the problem by stochastic heuristic methods. For problem has some other modifications, e.g. a no-wait the job shop scheduling problem, a mathematical model and its main version in which the start of job processing is delayed on the representation schemes are presented. first machine so that the job need not wait for processing on subsequent machines. In this paper, we deal with another Keywords—Flow shop, job shop, mixed integer model,