In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...

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

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

In a shop floor of the industry, the routings which are based upon the jobs that need to be processed on different machines are one among the major activities and therefore the resource requirements are not based upon the quantity as in a flow shop but rather the routings for the products being produced. However, both job shop and flow shop production cope with a scheduling problem to find a fe...

In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...

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 this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

An interesting research area is to solve scheduling problems using network flow models and algorithms. Most of the existing papers in this research area deal with scheduling problems with parallel machines (identical and / or uniform machines). This paper considers the specialized case and develops network flow models and algorithms to solve open shop and flow and job shop problems.