Scheduling multiple two-stage flowshops with a deadline

DOI10.1016/j.tcs.2022.04.004OpenAlexW4226485472MaRDI QIDQ2140576

Yin Guo, Minjie Huang, Jian'er Chen

Publication date: 23 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.004

zbMATH Keywords

schedulingapproximation algorithmcloud computingtwo-stage flowshop

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On scheduling multiple parallel two-stage flowshops with Johnson's rule

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the parallel flow shop problem
• An FPTAS for the parallel two-stage flowshop problem
• On scheduling multiple two-stage flowshops
• Improved approximation algorithms for two-stage flowshops scheduling problem
• On scheduling inclined jobs on multiple two-stage flowshops
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
• Scheduling two-stage jobs on multiple flowshops
• Scheduling a two-stage flowshop under makespan constraint
• Optimal two- and three-stage production schedules with setup times included
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• Parameterized Approximation Scheme for the Multiple Knapsack Problem
• Packing Groups of Items into Multiple Knapsacks
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Scheduling multiple two-stage flowshops with a deadline