Approximability of flow shop scheduling
From MaRDI portal
Publication:1290640
DOI10.1007/BF01585870zbMATH Open0920.90073OpenAlexW2075846649MaRDI QIDQ1290640FDOQ1290640
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585870
Recommendations
- Approximation algorithms for the parallel flow shop problem
- Hardness of approximating flow and job shop scheduling problems
- Approximation results for flow shop scheduling problems with machine availability constraints
- Improved Bounds for Flow Shop Scheduling
- Approximation algorithms for two-stage flexible flow shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- scientific article; zbMATH DE number 1911010
- Improved Approximation Algorithms for Shop Scheduling Problems
- Approximation algorithms for scheduling multiple two-stage flowshops
- Tight Bounds for Permutation Flow Shop Scheduling
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Approximation algorithms for scheduling unrelated parallel machines
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Title not available (Why is that?)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Improved Approximation Algorithms for Shop Scheduling Problems
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Bounding algorithm for the routing problem with arbitrary paths and alternative servers
Cited In (51)
- On the NP-hardness of two scheduling problems under linear constraints
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Optimal results and numerical simulations for flow shop scheduling problems
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- Grouping techniques for scheduling problems: simpler and faster
- Title not available (Why is that?)
- Performance guarantees for flowshop heuristics to minimize makespan
- A heuristic algorithm for the hospital health examination scheduling problem
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- A linear time approximation algorithm for movement minimization in conveyor flow shop processing
- Parameterized complexity of machine scheduling: 15 open problems
- No-wait shop scheduling: Computational complexity and approximate algorithms
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Title not available (Why is that?)
- A linear time approximation scheme for makespan minimization in an open shop with release dates
- Heuristic factory planning algorithm for advanced planning and scheduling
- Flow shop scheduling problems with transportation constraints revisited
- Title not available (Why is that?)
- Flow shop scheduling problems with transportation constraints revisited
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Optimal control of a two-server flow-shop network
- The evolution of schematic representations of flow shop scheduling problems
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
- Transporting jobs through a two‐machine open shop
- Inapproximability results for no-wait job shop scheduling.
- A combination of flow shop scheduling and the shortest path problem
- Algorithms for Flows over Time with Scheduling Costs
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A linear time approximation algorithm for permutation flow shop scheduling
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- A model to approximate transient performance of the flowshop
- Preemptive scheduling on two identical parallel machines with a single transporter
- Time-flexible min completion time variance in a single machine by quadratic programming
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Approximation Algorithms for Generalized Path Scheduling
- An empirical analysis of the optimality rate of flow shop heuristics
- Computational complexity and algorithms for two scheduling problems under linear constraints
- Title not available (Why is that?)
- Some results of the worst-case analysis for flow shop scheduling
- An FPTAS for the parallel two-stage flowshop problem
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- Review of the ordered and proportionate flow shop scheduling research
- Moderate exponential-time algorithms for scheduling problems
This page was built for publication: Approximability of flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290640)
