Results 211 to 220 of about 84,491 (259)
Some of the next articles are maybe not open access.
Approximability of flow shop scheduling
Mathematical Programming, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Scheduling in network flow shops
Journal of Global Optimization, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Online scheduling of ordered flow shops
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kangbok Lee +2 more
openaire +2 more sources
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
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
Routing open shop and flow shop scheduling problems
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yu 0011 +3 more
openaire +2 more sources
Heuristics for flow-shop scheduling
International Journal of Production Research, 1980Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data.
J. R. KING, A. S. SPACHIS
openaire +1 more source
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
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
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 +3 more sources