Results 261 to 270 of about 3,286,488 (309)
Some of the next articles are maybe not open access.
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
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
Analysis of flow shop scheduling anomalies
European Journal of Operational Research, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. S. Panwalkar, Christos Koulamas
openaire +3 more sources
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
2012
When job parameters are uncertain or unpredictable, new types of policies become possible. Besides static policies, we now should consider dynamic policies, with or without preemption. Objectives too have more variety. The makespan, for example, is now random; we usually choose to minimize its expectation.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
When job parameters are uncertain or unpredictable, new types of policies become possible. Besides static policies, we now should consider dynamic policies, with or without preemption. Objectives too have more variety. The makespan, for example, is now random; we usually choose to minimize its expectation.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
2012
After describing some real-world examples of flow shops with no waiting, we demonstrate the equivalence of no-wait and blocking in the shop with m = 2. For the no-wait shop, some research is available on the flow time objective while the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
After describing some real-world examples of flow shops with no waiting, we demonstrate the equivalence of no-wait and blocking in the shop with m = 2. For the no-wait shop, some research is available on the flow time objective while the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
Lot sizing in a no-wait flow shop
Operations Research Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamilton Emmons, Kamlesh Mathur
openaire +3 more sources