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 develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand BHFSP, we will construct its mixed integer linear programming (MILP) model and use Gurobi solver to demonstrate correctness. Since BHFSP exists parallel machines in some processing stages, different decoding strategies can obtain makespan values for a given job sequence multiple as...

This paper develops a fast tabu search algorithm to minimize makespan in a flow shop problem with blocking. We present a fast heuristic algorithm based on tabu search approach. In the algorithm the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and guide the search process to more promising areas of the solutions space, where good ...

Given a job set J = f1; 2; :::; ng where each job has to be processed non preemptively on m machines M1; M2;..., Mm in that order. The processing time of job j on machine Mi is pij : At time t = 0; all jobs are available at an input device denoted by M0: After completion, each job must be taken from Mm to an output device denoted Mm+1 (for convenience, we set pm+1;j = 0;8j 2 J): The transfer be...

A frequently occurring operational problem is one of processing a given number of jobs (commodities) on a specified number of machines (facilities) referred to by various investigators as scheduling, dispatching, sequencing, or combinations thereof (Gupta and Stafford, 2006). In most manufacturing environments, a set of processes is needed to be serially performed in several stages before a job...

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