Pages that link to "Item:Q2457273"
From MaRDI portal
The following pages link to Approximation algorithms for UET scheduling problems with exact delays (Q2457273):
Displayed 9 items.
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- Scheduling of coupled tasks with unit processing times (Q600841) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
- Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays (Q5443372) (← links)
- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)