Maximizing Throughput in Flow Shop Real-Time Scheduling

DOI10.4230/LIPICS.APPROX/RANDOM.2020.48MaRDI QIDQ6084409zbMATH OpenOpenAlexFDO

Authors Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Publication date 31 October 2023

Full work available at URL https://doi.org/10.4230/lipics.approx/random.2020.48

zbMATH Keywords

approximation algorithmsflow shopreal-time schedulingthroughput maximization

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Throughput maximization of real-time scheduling with batching
• scientific article; zbMATH DE number 2119735
• scientific article; zbMATH DE number 1054688
• Improvements in throughout maximization for real-time scheduling
• Minimizing the maximum flow time in batch scheduling
• Optimal job scheduling for flowshops
• Algorithms for a realistic variant of flowshop scheduling
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• Approximability of flow shop scheduling
• Multi-phase algorithms for throughput maximization for real-time scheduling

Cites work

• A dynamic programming framework for non-preemptive scheduling problems on multiple machines
• A note on permutation flow shop problem
• A unified approach to approximating resource allocation and scheduling
• Algorithms for Scheduling Independent Tasks
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
• Approximability of flow shop scheduling
• Approximating the throughput of multiple machines in real-time scheduling
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Hardness of approximating flow and job shop scheduling problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• On the complexity of approximating \(k\)-dimensional matching
• On-line scheduling of jobs with fixed start and end times
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling parallelizable jobs online to maximize throughput
• Scheduling Split Intervals
• Speed is as powerful as clairvoyance
• The Complexity of Flowshop and Jobshop Scheduling
• Tight bounds for permutation flow shop scheduling

This page was built for publication: Maximizing Throughput in Flow Shop Real-Time Scheduling

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