Scheduling of coupled tasks with unit processing times
DOI10.1007/S10951-010-0167-ZzbMATH Open1208.68090OpenAlexW1985321454WikidataQ57387739 ScholiaQ57387739MaRDI QIDQ600841FDOQ600841
Authors: Sumit K. Garg 
Publication date: 3 November 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0167-z
Recommendations
- Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
- An exact algorithm for scheduling identical coupled tasks
- A note on scheduling identical coupled tasks in logarithmic time
- A note on scheduling coupled tasks for minimum total completion time
- New algorithms for coupled tasks scheduling - a survey
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristics for a coupled-operation scheduling problem
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling for a multifunction phased array radar system
- An exact algorithm for scheduling identical coupled tasks
- Approximation algorithms for UET scheduling problems with exact delays
- On the complexity of coupled-task scheduling
- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Modelling for the control of a complex radar system
- Scheduling coupled tasks
Cited In (17)
- Two-machine flowshop scheduling problem with coupled-operations
- Scheduling coupled-operation jobs with exact time-lags
- A note on scheduling identical coupled tasks in logarithmic time
- A note on scheduling coupled tasks for minimum total completion time
- Coupled task scheduling with time-dependent processing times
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan
- Algorithms for dynamic scheduling of unit execution time tasks
- Coupled task scheduling with exact delays: literature review and models
- New algorithms for coupled tasks scheduling - a survey
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Scheduling of coupled tasks and one-machine no-wait robotic cells
- Two machines flow shop with reentrance and exact time lag
- Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
- Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
- Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
This page was built for publication: Scheduling of coupled tasks with unit processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600841)
