The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the...

This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

The use of intelligent techniques in the manufacturing field has been growing the last decades due to the fact that most manufacturing optimization problems are combinatorial and NP hard. This paper examines recent developments in the field of evolutionary computation for manufacturing optimization. Significant papers in various areas are highlighted, and comparisons of results are given wherev...

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...

In this paper, we present an approach to deal with fuzzy constraints in a flow shop problem. The flexible constraints on job release date and due date, as well as job processing time are described by fuzzy sets. We propose a method to calculate the satisfaction degree of the schedule with respect to fuzzy release dates and fuzzy due dates of jobs. The objective is to obtain a schedule which has...

this paper presents a summary of the results from the simulation of a given two-stages production system which uses jit. the system consists of an assembly line with two automated assembly cells and two assembly stock points and one manufacturing cell with three manufacturing stock points for storing reserved parts and one receiving stock. carts with fixed capacity are used for handling the par...

This paper deals with multi-operation models, which are different from the flow shop and job shop models. In the flow shop or job shop models, the routes of all jobs are known in advance. In practice, the route of the job is often immaterial and up to the scheduler to decide. When the routes of the jobs are open, the model is referred to as an open shop. This paper describes the development of ...