Results 271 to 280 of about 8,566,720 (303)
Some of the next articles are maybe not open access.

Solving the flow shop problem by parallel programming

Journal of Parallel and Distributed Computing, 2009
The matter of using scheduling algorithms in parallel computing environments is discussed in this paper. There are proposed methods of parallelizing the criterion function calculations for a single solution and a group of concentrated solutions (local neighborhood) dedicated to being used in metaheuristic approaches.
openaire   +1 more source

Heuristic solution methods for the stochastic flow shop problem

European Journal of Operational Research, 2012
We investigate the stochastic flow shop problem with m machines and general distributions for processing times. No analytic method exists for solving this problem, so we looked instead at heuristic methods. We devised three constructive procedures with modest computational requirements, each based on approaches that have been successful at solving the ...
Kenneth R. Baker, Dominik Altheimer
openaire   +2 more sources

A novel Ant algorithm for permutation flow shop problem

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010
A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search.
Wenjin Yang, Yantao Zhou, Kenli Li 0001
openaire   +1 more source

Parallel hybrid heuristics for the permutation flow shop problem

Annals of Operations Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martín Gómez Ravetti   +4 more
openaire   +2 more sources

Complexity results for flow shop problems with synchronous movement

European Journal of Operational Research, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Waldherr, Sigrid Knust
openaire   +3 more sources

A review of the static stochastic flow-shop scheduling problem

Journal of Decision Systems, 2000
We consider a m machine stochastic flow-shop and a set of n jobs, with known release dates, to be processed. In this paper, we distinguish two types of random events: processing times (job processing times are random variables which follow a probability distribution function) and breakdowns (time between failure and repair time are random variables ...
Gourgand, Michel   +2 more
openaire   +3 more sources

Efficiency of reductions of job-shop to flow-shop problems

European Journal of Operational Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Multicriteria Flow-Shop Scheduling Problem

2010
Quality is, in real-life, a multidimensional notion. A schedule is described and valued on the basis of a number of criteria, for example: makespan, work-in-process inventories, idle times, observance of due dates, etc. An appropriate schedule cannot be obtained unless one observes the whole set of important criteria. The multidimensional nature of the
openaire   +1 more source

Flow Shop-Probleme — ein Literaturüberblick

2000
Ein Klassifizierungsschema der Flow Shop-Probleme sowie Losungsverfahren zu diesen Problemklassen wurden im vorangehenden Abschnitt beschrieben. Dieses Kapitel beschaftigt sich mit Losungsverfahren von Flow Shop-Problemen aus der Literatur. Der Fokus der besprochenen Quellen liegt dabei insbesondere auf den fur diese Arbeit relevanten Themengebieten
openaire   +1 more source

Home - About - Disclaimer - Privacy