A linear time approximation algorithm for permutation flow shop scheduling
DOI10.1016/J.TCS.2011.10.013zbMATH Open1234.68467OpenAlexW2094146678MaRDI QIDQ764320FDOQ764320
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.013
Recommendations
- Tight bounds for permutation flow shop scheduling
- Tight Bounds for Permutation Flow Shop Scheduling
- A note on permutation flow shop problem
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Some results of the worst-case analysis for flow shop scheduling
approximation algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Szekeres+theorem&go=Go Erd��s-Szekeres theorem]permutation flow shop scheduling
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Cites Work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximability of flow shop scheduling
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Tight Bounds for Permutation Flow Shop Scheduling
- Permutation vs. non-permutation flow shop schedules
- Performance guarantees for flowshop heuristics to minimize makespan
- Title not available (Why is that?)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- A note on permutation flow shop problem
- On some geometric methods in scheduling theory: A survey
- Partitioning a sequence into few monotone subsequences
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- New results in the worst-case analysis for flow-shop scheduling
- Tight Bounds for Permutation Flow Shop Scheduling
Cited In (6)
- A note on permutation flow shop problem
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing
- Title not available (Why is that?)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays
- Title not available (Why is that?)
- Diversity of processing times in permutation flow shop scheduling problems
This page was built for publication: A linear time approximation algorithm for permutation flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764320)
