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

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

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

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 effects of acetylcholine, ischemia, and anoxia on myocardial cyclic GMP and cyclic AMP were investigated in isolated rat hearts perfused under either constant flow (14 ml/min) or constant pressure (100 cm H,O) conditions with physiological saline gassed with 95% O,-5% COj. In paced, constant flow-perfused hearts, cyclic GMP increased from a control of 35 to 62 fmol/mg protein and remained e...

In this paper, a bi- objective Operating Theater scheduling is proposed. The problem subject to order and assignment constraints. first the minimization of operating theater opening total time also called makespan in manufacturing systems while second maximize constraints satisfaction. considered as two-stage hybrid flow shop with blocking. Several metaheuristics are compared: firefly algorithm...