Approximation Algorithms for Scheduling Problems with Exact Delays
From MaRDI portal
Recommendations
- Approximating coupled-task scheduling problems with equal exact delays
- Approximation algorithms for UET scheduling problems with exact delays
- An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays
- Approximating the 2-machine flow shop problem with exact delays taking two values
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
Cited in
(31)- Minimizing total completion time in two-machine flow shops with exact delays
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- An exact algorithm for the bi-objective timing problem
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay
- Approximating the 2-machine flow shop problem with exact delays taking two values
- Coupled task scheduling with exact delays: literature review and models
- Two-machine flowshop scheduling problem with coupled-operations
- Approximation algorithms for UET scheduling problems with exact delays
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays
- Two machines flow shop with reentrance and exact time lag
- Approximating coupled-task scheduling problems with equal exact delays
- scientific article; zbMATH DE number 444983 (Why is no real title available?)
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- scientific article; zbMATH DE number 7529517 (Why is no real title available?)
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
- Algorithms and Data Structures
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- On the inapproximability of two-machine open shop scheduling with exact delays
- Scheduling coupled-operation jobs with exact time-lags
- On the inapproximability of two-machine open shop scheduling with exact delays
- A coupled task scheduling approximation algorithm for minimizing the sum of completion times
- Delay-bounded scheduling without delay!
This page was built for publication: Approximation Algorithms for Scheduling Problems with Exact Delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443504)
