Approximation algorithms for two-stage flexible flow shop scheduling
DOI10.1007/S10878-019-00449-3zbMATH Open1447.90014OpenAlexW2976356821MaRDI QIDQ2292124FDOQ2292124
Authors: Yan Lan, Xin Han, Minghui Zhang 
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00449-3
Recommendations
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- Approximation algorithms for scheduling multiple two-stage flowshops
- Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines
- Improved approximation algorithms for two-stage flowshops scheduling problem
- Approximation algorithms on multiple two-stage flowshops
- Approximation algorithms for a two-stage hybrid flow shop
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- scientific article; zbMATH DE number 784425
- scientific article; zbMATH DE number 5631252
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Scheduling multiprocessor tasks -- An overview
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Minimizing makespan in hybrid flowshops
- Title not available (Why is that?)
- Approximation algorithms for scheduling parallel jobs
- Two-stage proportionate flexible flow shop to minimize the makespan
- Title not available (Why is that?)
- Two-stage flexible flowshop scheduling problems with a batch processor on second stage
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved approximation algorithms for two-stage flexible flow shop scheduling
- Efficient algorithms for flexible job shop scheduling with parallel machines
- On Approximation Algorithms for Two-Stage Scheduling Problems
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- A computational study of heuristics for two-stage flexible flowshops
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility
- Approximability of flow shop scheduling
- Title not available (Why is that?)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Approximation algorithms on multiple two-stage flowshops
This page was built for publication: Approximation algorithms for two-stage flexible flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292124)
