In this research, the flexible flow shop sequence dependent group scheduling problem (FFSDGS) with minimization of makespan as the criterion (FFm|fmls, Ssd|Cmax) is investigated. Since the problem is shown to be NP-hard, meta-heuristic algorithms are required to efficiently solve industry size problems. Thus, six different meta-heuristic algorithms based on tabu search (TS) are developed to eff...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

This paper focuses on a Flexible Flow Shop (FFS) problem in a paint company in an attempt to minimize production makespan. The FFS problem is characterized by multiple products being produced in machines in stages with sequence dependent set up times and infinite intermediate storages. As the FFS problem is computationally complex, two heuristic methods are employed to solve the Mixed Integer L...

In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness, total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP...

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

We propose a constructive heuristic approach for the solution of the permutation flow-shop problem. The objective function of all algorithms is the minimization of the makespan. Our approach employs Johnson’s rule to give a good initial solution for the improvement heuristic, also known as metaheuristics. The proposed heuristic algorithm, named MOD, is tested against four other heuristics that ...

This paper presents the application of self organinsing migration algorithm (SOMA) to the scheduling problem of flow shop. Flow shop is regarded as the most widely utilized shop management system. Two different benchmark problems are attempted with good results obatined both in comparison with the optimal and other published heuristics. INTRODUCTION Advanced manufacturing systems often rely on ...

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...