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

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

We study the problem of minimizing the makespan in a two-stage assembly flow shop scheduling problem with uniform parallel machines. This problem is a generalization of the assembly flow shop problem with concurrent operations in the first stage and a single assembly operation in the second stage. We propose a heuristic with an absolute performance bound which becomes asymptotically optimal as ...

We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class...

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

In this paper we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immed...

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