This Paper is an attempt to study two stage open shop scheduling problem in which processing time of the jobs are given. The objective of the paper is to obtain an algorithm to minimize the rental cost of the machines in two stage open shop scheduling problem under specified rental policy. A numerical illustration is given to justify the proposed algorithm.

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

The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...

We consider the ow-shop scheduling problem. The objective is to schedule the jobs on the machines so that we minimize the time by which all jobs are completed. We studied and implemented diierent versions of the algorithm of Sevast'yanov based on linear programming to solve this problem. Using CPLEX, we did computational tests with random instances having up to 1000 jobs and 100 machines. If th...

General job-shop scheduling is a difficult problem to be solved. The complexity of the problem is highlighted by the fact that in a general job-shop having m machines and n jobs the total number of schedules can be as high as (n!), hence if “n=20 m=10” the number of possible solutions is 7.2651x10. Many approaches such as Branch and Bound, Simulated Annealing, Tabu Search and others have been t...

Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems, and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new genetic coding for the...

Scheduling problems have the standard consideration in the field of manufacturing. Among the various types of scheduling problems, the job shop scheduling problem is one of the most interesting NP-hard problems. As the job shop scheduling is an optimization problem, Genetic algorithm was selected to solve it In this study. Selection scheme is one of the important operators of Genetic algorithm....