Results 261 to 270 of about 8,566,720 (303)

A genetic algorithm for flow shop scheduling problems

Journal of the Operational Research Society, 2004
Summary: Many scheduling problems are NP-hard problems. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we develop a genetic algorithm-based heuristic for the flow shop scheduling problem with makespan as the criterion. The performance of the algorithm is compared
Wilson, J, Toklu, B, Atak, MEHMET, Etiler, O   +3 more
openaire   +2 more sources

On the Flow-Shop Sequencing Problem with No Wait in Process

Operational Research Quarterly (1970-1977), 1972
The optimization problem of minimizing the completion time in flow-shop sequencing with an environment of no intermediate storage is considered. Application of this problem in computer systems is pointed out and techniques are developed to solve the problem.
Reddi, S. S., Ramamoorthy, C. V.
openaire   +1 more source

Flow Shop Problem with Machine Time Couplings

2019
The work presents a multi-machine flow shop problem with minimization of the completion time of all tasks. Different temporal couplings concerning machine operation have been proposed, resulting from the analysis of practical cases. Their mathematical models were presented, an exact algorithm and two approximate algorithms were implemented.
Wojciech Bozejko, Radoslaw Idzikowski, Mieczyslaw Wodecki   +2 more
openaire   +1 more source

Solvable Cases of the No-Wait Flow-Shop Scheduling Problem

Journal of the Operational Research Society, 1991
It is well-known that the no-wait flow-shop scheduling problem with a makespan objective function \((n| m| F,\hbox{no-wait}| C_{\max})\) can be formulated as a travelling salesman problem (TSP). The authors show that special cases can be transformed to polynomial solvable cases of the TSP.
van der Veen, Jack A. A., van Dal, René
openaire   +2 more sources

Alternative Formulations of a Flow-shop Scheduling Problem

Journal of the Operational Research Society, 1989
This paper presents an alternative approach to a model of \textit{W. J. Selen} and \textit{D. D. Hott} [ibid. 37, No.12, 1121-1128 (1986; Zbl 0646.90041)] to formulate a problem of sequencing N jobs on M machines in a standard flow-shop. The objectives of the model are to minimize makespan and flow-time. The new formulation involves substantially fewer
openaire   +2 more sources

A General Bounding Scheme for the Permutation Flow-Shop Problem

Operations Research, 1978
Branch-and-bound methods are commonly used to find a permutation schedule that minimizes maximum completion time in an m-machine flow-shop. In this paper we describe a classification scheme for lower bounds that generates most previously known bounds and leads to a number of promising new ones as well.
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan   +2 more
openaire   +1 more source

On the combinatorial structure of the permutation flow shop problem

ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research, 1991
A set of jobs has to be processed on a finite set of machines in identical order. The maximum completion time has to be minimized. The algorithm of Johnson determines the optimal solution for problems with only two machines. The maximum completion time is computed via the critical path in a corresponding network.
openaire   +2 more sources

The flow shop problem with no-idle constraints: A review and approximation

European Journal of Operational Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaroslav Goncharov, Sergey Sevastyanov
openaire   +2 more sources

Different approaches to a flow shop problem

European Journal of Operational Research, 1994
Abstract In a note by Rosling (1994) he pointed out that the model presented in the paper “Balancing capacity and lot sizes” in European Journal of Operational Research (1985) can be viewed as an approximate queueing model and that the results of the model in such a context can lead to inappropriate interpretations.
Olhager, Jan, Rapp, Birger
openaire   +2 more sources

The resolution of the no-idle flow-shop problem

ACS/IEEE International Conference on Computer Systems and Applications, 2003. Book of Abstracts., 2004
Summary form only given. In a flow-shop organisation, all jobs follow the same route (machine sequence) and each job has exactly one operation on each machine. A permutation flow-shop is a flow-shop where all machines process the jobs in the same sequence.
N. El Houda Saadani, M. Moalla
openaire   +1 more source