Results 261 to 270 of about 3,286,488 (310)
Some of the next articles are maybe not open access.
Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The clustered flow-shop problem
Zeitschrift für Operations Research, 1988This paper considers a generalization of the classical flow-shop problem where n items, grouped into k fixed sequences (clusters) are processed on m machines. A permutation is being sought that minimizes the completion time of processing all items. This paper develops conditions when the clustered problem can be reduced to a classical case.
openaire +3 more sources
Efficiency of reductions of job-shop to flow-shop problems
European Journal of Operational Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Flow shop vs. permutation shop with time delays
Computers & Industrial Engineering, 2005This paper considers the evaluation of the worst-case performance ratio between the best solution of the flow shop problem and the permutation flow shop with time delays considerations. It is observed that, even in the restricted case of two machines and unit execution time operations, the two models may generate different optimal values for the ...
openaire +1 more source
Inequalities for stochastic flow shops and job shops
Applied Stochastic Models and Data Analysis, 1986AbstractConsider an m‐machine flow shop with n jobs. The processing time of job j, j = 1,…, n, on each one of the m machines is equal to the random variable Xj and is distributed according to Fj. We show that, under certain conditions, more homogeneous distributions F1,…, Fn result in a smaller expected makespan.
Pinedo, Michael, Wie, Sung-Hwan
openaire +2 more sources
2012
In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
2012
We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
A Note on Permutation Flow Shop Problem
Annals of Operations Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
2019
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Jacek Blazewicz +5 more
openaire +1 more source
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Jacek Blazewicz +5 more
openaire +1 more source
A Comparative Study of Flow-Shop Algorithms
Operations Research, 1975This paper describes an experimental comparison of flow-shop algorithms, motivated by the need to consolidate recent research on this topic. Using a set of test problems, it investigated various branch-and-bound and elimination strategies in a comparative study and then combined them to produce a new and efficient solution algorithm.
openaire +1 more source