Results 231 to 240 of about 15,254 (266)
Some of the next articles are maybe not open access.
An Evaluation of Flow Shop Sequencing Heuristics
Management Science, 1977This paper presents computational experience with eleven flow shop sequencing heuristics. Included in the study are three previously unreported heuristics, one of which turns out to be superior to the other ten heuristics tested. The comparisons were made on a variety of problem sizes, up to fifty jobs and fifty operations.
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
Permutation flow‐shop theory revisited
Naval Research Logistics Quarterly, 1978AbstractThe paper provides a new theoretical framework for generating dominance conditions and lower bounds and for solving special cases. All existing and new results have been derived in a routine and simple manner.
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
Improved Bounds for Flow Shop Scheduling
2009We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used lower bound on the optimal makespan. We also obtain a nearly tight hardness result for the general version of flow shops, where jobs are not required to be processed on each machine.
Monaldo Mastrolilli, Ola Svensson
openaire +1 more source