Results 251 to 260 of about 8,566,720 (303)
Some of the next articles are maybe not open access.
A contribution to the stochastic flow shop scheduling problem
European Journal of Operational Research, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gourgand, Michel +2 more
openaire +4 more sources
Admissible Heuristic Functions For Flow-Shop Problems
International Journal of Computers and Applications, 2006AbstractA set of heuristic functions is developed for use in conjunction with an intelligent heuristic search algorithm (IHSA*) for solving flowshop problems involving two or three machines with any number of jobs. The admissibility of these functions is established and a subset of three admissible heuristic functions is identified in terms of the ...
Fan, Joshua P, Winley, Graham K
openaire +1 more source
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
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
A Contribution to the Reentrant Flow-Shop Scheduling Problem
IFAC Proceedings Volumes, 2013Abstract This paper considers a flow-shop scheduling problem which is characterized by reentrants and aims on the minimization of makespan. Reentrants are events of a repeated processing of a specific job on a machine, which can occur due to, e.g., quality reasons.
Richard Hinze +3 more
openaire +1 more source
Special cases of the flow‐shop problem
Naval Research Logistics Quarterly, 1977AbstractThe paper examines all known special cases of the mXn flow‐shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.
openaire +2 more sources
The proportionate flow shop total tardiness problem
European Journal of Operational Research, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Flow shop scheduling problem with conflict graphs
Annals of Operations Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nour El Houda Tellache, Mourad Boudhar
openaire +3 more sources
A memetic algorithm for Permutation Flow Shop Problems
2013 IEEE Congress on Evolutionary Computation, 2013The Permutation Flow Shop Scheduling Problem (PFSP) is a well-known combinatorial optimization problem. In this paper, a Genetic Algorithm (GA) based approach has been developed to solve PFSP, with the objective of minimizing the makespan for a set of jobs.
Humyun Fuad Rahman +2 more
openaire +1 more source
Flow Shop Problems with Time Lags
Management Science, 1983This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and unrestricted cases.
openaire +2 more sources