In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo ow shops is considered Several heuristic methods for solving Group Technology problem have been proposed in the literature in general not producing a ow shop in each cell unless a great number of extra machines is added We use known techn...

Recent sensor technologies have enabled the capture of users’ behavior data. Given the large amount of data currently available from sensor-equipped environments, it is important to attempt characterization of the sensor data for automatically modeling users in a ubiquitous and mobile computing environment. As described herein, we propose a method that predicts a customer model using features b...

In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Recently, group scheduling has also been proposed and discussed. In the group scheduling, each job belongs to a specific group and all the jobs are processed group by group. In this pape...

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

The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose ...

In this paper the Group Technology problem of grouping parts in families and machines in cells in order to convert a job shop production system to some pseudo ow shops is considered. Several heuristic methods for solving Group Technology problem have been proposed in the literature, in general, not producing a ow shop in each cell|unless a great number of extra machines is added. We use known t...

In this paper a hybrid genetic and harmony search algorithm is proposed to find the possible best sequence of operation solutions for hybrid flow shop scheduling problems. In this work the problem is considered with respect to the objective of minimization of makespan. Hybrid flow shop scheduling problem is considered for the sequencing of jobs in a hybrid flow shop with two or more identical m...

In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...

Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained challenging. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experimen...