Scheduling of coupled tasks with unit processing times

DOI10.1007/s10951-010-0167-zzbMath1208.68090OpenAlexW1985321454WikidataQ57387739 ScholiaQ57387739MaRDI QIDQ600841

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)

Related Items (9)

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks ⋮ Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ The coupled unit-time operations problem on identical parallel machines with respect to the makespan ⋮ Identical coupled task scheduling: polynomial complexity of the cyclic case ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Two machines flow shop with reentrance and exact time lag ⋮ Coupled task scheduling with time-dependent processing times ⋮ Two-machine flowshop scheduling problem with coupled-operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• Improved analysis of an algorithm for the coupled task problem with UET jobs
• Scheduling for a multifunction phased array radar system
• Modelling for the control of a complex radar system
• An exact algorithm for scheduling identical coupled tasks
• Complexity results for single-machine problems with positive finish-start time-lags
• Approximation algorithms for UET scheduling problems with exact delays
• Heuristics for a coupled-operation scheduling problem
• Scheduling coupled tasks
• On the complexity of coupled-task scheduling

This page was built for publication: Scheduling of coupled tasks with unit processing times