Pages that link to "Item:Q1762669"
From MaRDI portal
The following pages link to An exact algorithm for scheduling identical coupled tasks (Q1762669):
Displaying 20 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)
- Scheduling of coupled tasks and one-machine no-wait robotic cells (Q954024) (← links)
- A note on scheduling identical coupled tasks in logarithmic time (Q968178) (← links)
- Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays (Q2060394) (← links)
- Scheduling coupled tasks with exact delays for minimum total job completion time (Q2061138) (← links)
- Coupled task scheduling with time-dependent processing times (Q2061140) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- Two-machine flowshop scheduling problem with coupled-operations (Q2327688) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- A note on scheduling coupled tasks for minimum total completion time (Q2678608) (← links)
- Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- New algorithms for coupled tasks scheduling – a survey (Q4917224) (← links)
- New efficient algorithms for the two-machine no-wait chain-reentrant shop problem (Q6645175) (← links)
