Maximizing Throughput in Flow Shop Real-Time Scheduling
From MaRDI portal
Publication:6084409
DOI10.4230/lipics.approx/random.2020.48zbMath1529.90040OpenAlexW3082070611MaRDI QIDQ6084409
Baruch Schieber, Hadas Shachnai, Unnamed Author, Jing Li, Kanthi K. Sarpatwar
Publication date: 31 October 2023
Full work available at URL: https://doi.org/10.4230/lipics.approx/random.2020.48
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
- A note on permutation flow shop problem
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Approximability of flow shop scheduling
- On-line scheduling of jobs with fixed start and end times
- Scheduling parallelizable jobs online to maximize throughput
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Optimal two- and three-stage production schedules with setup times included
- Algorithms for Scheduling Independent Tasks
- The Complexity of Flowshop and Jobshop Scheduling
- Speed is as powerful as clairvoyance
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Hardness of Approximating Flow and Job Shop Scheduling Problems
- Scheduling Split Intervals
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Tight Bounds for Permutation Flow Shop Scheduling
- A unified approach to approximating resource allocation and scheduling
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Maximizing Throughput in Flow Shop Real-Time Scheduling
