Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

This paper deals with the cyclic flow shop robotic cell scheduling problem with multiple single and dual gripper robots, in which multiple part types are processed on multiple machines successively with free, time-windows and no-wait pickup criteria. The robots execute the transportation of parts between the machines. A novel comprehensive mixed-integer linear programming model has been propose...

In this article we present an Ant Colony Optimization approach to the Flow Shop Problem. ACO is a new algorithmic approach, inspired by the foraging behavior of real ants, that can be applied to the solution of combinatorial optimization problems. Artificial ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. Comparisons with o...

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

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

We consider a robotic ow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a xed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production o...

In this paper we consider the problem of cyclic schedules such as arise in manufacturing. We introduce a new formulation of this problem that is a very simple modi cation of a standard job shop scheduling formulation, and which enables us to use existing constraint reasoning techniques to generate cyclic schedules. We present evidence for the e ectiveness of this formulation, and describe exten...