Results 271 to 280 of about 3,286,488 (309)
Some of the next articles are maybe not open access.
2012
In this chapter we organize the literature on the hybrid flow shop scheduling problem that has appeared since the late 1950’s. We see a number of interesting and diverse industrial applications of this system, and find that the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
In this chapter we organize the literature on the hybrid flow shop scheduling problem that has appeared since the late 1950’s. We see a number of interesting and diverse industrial applications of this system, and find that the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
Proportionate flow-shop scheduling with rejection
Journal of the Operational Research Society, 2016In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions.
Dvir Shabtay, Daniel Oron
openaire +1 more source
2012
We introduce four types of flexibility encountered in a flow shop: job routing through a hybrid shop, machine assignment, allocation of a scarce resource over the tasks to speed up processing, and the composition of daily production batches to satisfy requirements for a finite set of parts over a finite horizon.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
We introduce four types of flexibility encountered in a flow shop: job routing through a hybrid shop, machine assignment, allocation of a scarce resource over the tasks to speed up processing, and the composition of daily production batches to satisfy requirements for a finite set of parts over a finite horizon.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, 2011The map-reduce paradigm is now standard in industry and academia for processing large-scale data. In this work, we formalize job scheduling in map-reduce as a novel generalization of the two-stage classical flexible flow shop (FFS) problem: instead of a single task at each stage, a job now consists of a set of tasks per stage.
Benjamin Moseley +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
Hybrid flow-shop with adjustment
Kybernetika, 2011Summary: The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing
openaire +2 more sources
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
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
A Randomized Algorithm for Flow Shop Scheduling
1999Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop scheduling where the number of machines is part of the input problem. Our algorithm has a multiplicative factor of 2(1 + δ) and an additive term of O(mln(m+ n)pmax)/δ2).
Naveen Garg 0001 +2 more
openaire +1 more source