Approximation algorithms for scheduling multiple two-stage flowshops

DOI10.1007/978-3-319-62389-4_43MaRDI QIDQ2412433zbMATH OpenOpenAlexFDO

Authors Guangwei Wu, Jianxin Wang

Publication date 23 October 2017

Full work available at URL https://doi.org/10.1007/978-3-319-62389-4_43

zbMATH Keywords

approximation algorithmcloud computingmultiple two-stage flowshopsscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On scheduling multiple two-stage flowshops
• Approximation algorithms on multiple two-stage flowshops
• Improved approximation algorithms for two-stage flowshops scheduling problem
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
• Approximation algorithms for two-stage flexible flow shop scheduling

Cited in

(23)

• Approximability of flow shop scheduling
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• Approximation algorithms on multiple two-stage flowshops
• On scheduling multiple two-stage flowshops
• Improved approximation algorithms for two-stage flexible flow shop scheduling
• Scheduling multiple two-stage flowshops with a deadline
• Scheduling on multiple two-stage flowshops with a deadline
• Streaming algorithms for multitasking scheduling with shared processing
• Improved approximation algorithms for two-stage flowshops scheduling problem
• Approximation algorithms for two-stage flexible flow shop scheduling
• On scheduling inclined jobs on multiple two-stage flowshops
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
• A data intensive heuristic approach to the two-stage streaming scheduling problem
• Scheduling two-stage jobs on multiple flowshops
• A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
• Approximating the non-contiguous multiple organization packing problem
• Linear time algorithms for multiple cluster scheduling and multiple strip packing
• scientific article; zbMATH DE number 1979499 (Why is no real title available?)
• On Approximation Algorithms for Two-Stage Scheduling Problems
• On scheduling multiple parallel two-stage flowshops with Johnson's rule
• Applying Johnson's rule in scheduling multiple parallel two-stage flowshops
• A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

This page was built for publication: Approximation algorithms for scheduling multiple two-stage flowshops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412433)