scheduling of production in flexible manufacturing systems (fmss) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. the generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. genetic algorithms are used in this paper to obtain an initial...

This thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at an...

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flo...

In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...