Scheduling two-stage jobs on multiple flowshops

DOI10.1016/j.tcs.2019.01.017zbMath1422.68019arXiv1801.09089OpenAlexW2913982099WikidataQ128539941 ScholiaQ128539941MaRDI QIDQ2419124

Guangwei Wu, Jianxin Wang, Jian'er Chen

Publication date: 29 May 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.09089

zbMATH Keywords

algorithmschedulingcloud computingtwo-stage flowshop

Mathematics Subject Classification ID

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

Related Items (10)

Scheduling multiple two-stage flowshops with a deadline ⋮ Scheduling on multiple two-stage flowshops with a deadline ⋮ A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint ⋮ Scheduling two-stage jobs on multiple flowshops ⋮ On scheduling multiple parallel two-stage flowshops with Johnson's rule ⋮ On Approximation Algorithms for Two-Stage Scheduling Problems ⋮ On scheduling multiple two-stage flowshops ⋮ Improved approximation algorithms for two-stage flowshops scheduling problem ⋮ Scheduling periodic I/O access with bi-colored chains: models and algorithms ⋮ On scheduling inclined jobs on multiple two-stage flowshops

Cites Work

• Unnamed Item
• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem
• Polynomial time approximation schemes and parameterized complexity
• Approximation algorithms on multiple two-stage flowshops
• The hybrid flow shop scheduling problem
• Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
• Scheduling two-stage jobs on multiple flowshops
• A survey of scheduling problems with setup times or costs
• Optimal two- and three-stage production schedules with setup times included
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Improved Approximation Algorithms for Shop Scheduling Problems
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
• Scheduling independent tasks to reduce mean finishing time
• Scheduling

This page was built for publication: Scheduling two-stage jobs on multiple flowshops