Results 211 to 220 of about 15,254 (266)

Scheduling in network flow shops

Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Flow Shops and Flexible Flow Shops (Deterministic)

2008
In many manufacturing and assembly facilities each job has to undergo a series of operations. Often, these operations have to be done on all jobs in the same order implying that the jobs have to follow the same route. The machines are then assumed to be set up in series and the environment is referred to as a flow shop.
openaire   +1 more source

Flow Shops, Job Shops and Open Shops (Stochastic)

2008
The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire   +1 more source

Clustered flow shop models

Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An Ordered Flow Shop with Two Agents

Asia-Pacific Journal of Operational Research, 2016
In this paper, we consider a two-agent scheduling problem in an [Formula: see text]-machine ordered flow shop where each agent is responsible for his own set of jobs and wishes to minimize the makespan. Since the problem is NP-hard, we develop a pseudo-polynomial time approach for the case with a fixed number of machines and investigate the conditions
Byung-Cheon Choi, Myoung-Ju Park
openaire   +1 more source

The clustered flow-shop problem

Zeitschrift für Operations Research, 1988
This 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   +2 more sources

Flow shop vs. permutation shop with time delays

Computers & Industrial Engineering, 2005
This 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

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   +3 more sources

Analysis of flow shop scheduling anomalies

European Journal of Operational Research, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. S. Panwalkar, Christos Koulamas
openaire   +2 more sources

Reentrant Flow Shops

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