Scheduling on multiple two-stage flowshops with a deadline

DOI10.1007/978-3-030-93176-6_8zbMath1498.68042OpenAlexW4205387321MaRDI QIDQ2151364

Minjie Huang, Yin Guo, Jian'er Chen

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_8

zbMATH Keywords

schedulingapproximation algorithmtwo-stage flowshop

Mathematics Subject Classification ID

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

Related Items (1)

A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

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 on multiple two-stage flowshops with a deadline