We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...

Stability analysis consists of identifying conditions under which the number of jobs in a system is guaranteed to remain bounded over time. To date, such longrun performance guarantees have not been available for periodic approaches to dynamic scheduling problems. However, stability has been extensively studied in queueing theory. In this paper, we introduce stability to the dynamic scheduling ...

The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...

The two-stage hybrid flow shop problem under setup times is addressed in this paper. This NP-Hard. on the other hand, studied modeling different real-life applications especially manufacturing and high performance-computing. Tackling kind of requires development adapted algorithms. In context, a metaheuristic using genetic algorithm three heuristics are proposed These approximate solutions opti...

Considering current situation of production scheduling with uncertainties in modern manufacturing enviroments, flow shop production scheduling model is established based on the theory of fuzzy programming, in which fuzzy processing time is considered and the duration time of intermediate is unlimited. The maximum membership function of mean value has been applied to solve the non-linear fuzzy s...

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...