Scheduling of coupled tasks with unit processing times

DOI10.1007/S10951-010-0167-ZMaRDI QIDQ600841zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

complexityschedulingcoupled tasksexact gap

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 900396 (Why is no real title available?)
• An exact algorithm for scheduling identical coupled tasks
• Approximation algorithms for UET scheduling problems with exact delays
• Complexity results for single-machine problems with positive finish-start time-lags
• Heuristics for a coupled-operation scheduling problem
• Improved analysis of an algorithm for the coupled task problem with UET jobs
• Modelling for the control of a complex radar system
• On the complexity of coupled-task scheduling
• Scheduling coupled tasks
• Scheduling for a multifunction phased array radar system
• Scheduling of coupled tasks and one-machine no-wait robotic cells

Cited in

(19)

• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
• Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph
• New algorithms for coupled tasks scheduling - a survey
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• Identical coupled task scheduling: polynomial complexity of the cyclic case
• Coupled-tasks in presence of bipartite compatibilities graphs
• Algorithms for dynamic scheduling of unit execution time tasks
• Parameterized complexity of a coupled-task scheduling problem
• A note on scheduling identical coupled tasks in logarithmic time
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
• Coupled task scheduling with exact delays: literature review and models
• Scheduling coupled-operation jobs with exact time-lags
• Coupled task scheduling with time-dependent processing times
• Two-machine flowshop scheduling problem with coupled-operations
• A note on scheduling coupled tasks for minimum total completion time
• Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap
• The coupled unit-time operations problem on identical parallel machines with respect to the makespan
• Two machines flow shop with reentrance and exact time lag

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)