175 search results - page 8 / 35 » Approximation Algorithms for Flexible Job Shop Problems |
MOR
2006
13 years 7 months ago
2006
ESA
2005
Springer
14 years 1 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We 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 low...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...